Top Banner
Minor project presentation 1 Department of IT, NEHU study and analysis of routing protocol for wireless network for rural area using ns2
62
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript

study and analysis of routing protocol for wireless network for rural area using ns2

Department of IT, NEHU1

Project guide Md. I. HussainProject Members:: Manas pratim sarma Aditya Bora Montu Borthakur Keshab nath David chetiastudy and analysis of routing protocol for wireless network for rural area using ns2

2

Problem Statement

Study and analysis of routing protocol for rural wireless network using NS2

study and analysis of routing protocol for wireless network for rural area using ns2

3

OUT LINEy MOTIVATION. y ABSTRACT.

y STUDY PART : WIRELESS NETWORK. WIRELESS NETWORK IN RURAL AREA. CHALLENGES OF WIRELESS NETWORK IN RURAL AREA. SIMILAR ON GOING PROJECT. AD-HOC ROUTING PROTOCOL : DSDV. ON-DEMAND ROUTING PROTOCOL : DSR, AODV. LONG-DISTANCE WIRED NETWORK.

ANALYSIS PART: ANALYSIS OF DSDV,AODV AND DSR ANALYSIS IN BOTH SHORT DISTANCE AND LONG DISTANCE.

MOTIVATIONy The main purpose of this thesis is measure the performance of routing protocol over wireless network in case of long distance communication basically in rural area.

In wireless network so many problems are there, basically wireless link failure, handoff problem. All of these problem depends on the PROTOCOL that we used for the network. So we are coming to the point of analysis of routing protocol in wireless network.

study and analysis of routing protocol for wireless network for rural area using ns2

ABSTRACTWireless network allows users the freedom to travel from one location to another location without interruption of their computing service. wireless network require one fixed base station(BS). All users within the range of the base station can communicate to each other through base station , with this flexibility wireless network have the ability to from any where , at any time , as long as two or more wireless user s are willing to communicate. In this thesis, using the NS simulator, we will examine in detail the behavior of the wireless networks with a mobile node using different routing protocol.

study and analysis of routing protocol for wireless network for rural area using ns2

Wireless network???? WLANs send and receive data through the air and use radio and infrared waves to transmit information without a physical connection. The access point receives, buffers and transmits data between the WLAN and the wired network infrastructure. A single access point can support a small group of users and can function within a range of less than one hundred to several hundred feet.

y Wireless network types :

1. Infrastructure Networks .2. Infrastructure Less (Ad hoc) Networks .study and analysis of routing protocol for wireless network for rural area using ns2

Point to multipoint topology :

study and analysis of wireless network for rural area using ns2

8

Mesh Network

1/9/2012

study and analysis of wireless network for rural area using ns2

9

An introduction to wireless in rural areas Some technology in rural area :

1. Very High Frequency (VHF) radio telephone service . 2. Very Small Aperture Terminals (VSATs) are also used to link to satellites to provide Internet access, public telephone service and fax lines to certain rural areas . The difficulties that occurs in implementing wired networks in rural area are . 1. More expansive . 2. Geographical/ Natural barriers . 3. More time consuming .

1/9/2012

study and analysis of wireless network for rural area using ns2

10

Challenges of Wireless rural networks.

1. Enhancing data rate . 2. Lower data size and cost . 3. Low power networking . 4. Security issues. 5. Scalability .

1/9/2012

study and analysis of wireless network for rural area using ns2

11

SIMILAR ON GOING PROJECTS (1) Akshaya.

The Akshaya project, helps bring the benefits of e-governance and utility services like basic connectivity to individual households in Kerala. Akshaya is the country's largest rural wireless network.

(2) CASE STUDY. Bhutan: Wireless IP based Rural Access Pilot Project Use of VoWLAN

(Voice over WLAN) for the Provision of Rural Communications.

(3)

WIRELESS NETWORK DESIGN FOR TELECENTER IN RURAL AREA BY SATEA HIKMAT ABOUD, UNIVERSITY OF UTARA, MALAYSIA

So far the routing protocols used in wireless networks are1. Ad hoc routing protocols 2.Cellular routing protocols .

Ad hoc routing protocols ..(1) Globally pre computed, table based : DSDV Destination-Sequenced Distance Vector HSR Hierarchical State Routing ZHLS Zone-based Hierarchical Link State Routing Protocol

(2) On-Demand, source initiated : AODV Ad Hoc On-demand Distance Vector

Routing DSR Dynamic Source Routing CBRP Cluster Based Routing Protocols ABR Associability Based Routing

Dynamic source routing

Source routingThe sender of a packet determines the complete sequence of nodes through which to forward the packet

DSR Components..y Route discoveryy The mechanism by which a sending node obtains a route

to destination y Route maintenance y The mechanism by which a sending node detects that the network topology has changed and its route to destination is no longer valid

Basic Operation Route Discoveryy The sender y Broadcast a route request packet y The receiver y y

If same, discard Send a route reply Append this host's address to the route record, and rebroadcast

y This host is the targety

y Elsey

C Broadcasts Route Request to FA D ERoute Request

Source C

B Destination F G H

1. Node C (initiator) sends a Route sends a small package by 2..If the receiver is the destination host, Request route reply flooding the network Else it appends its ID to the packet and forward the packet to the next node until the destination is encountered

H Responds to Route RequestA D

E Source C B Destination F G HG,H,F

4.. H send find a path topacket which has a, list of all searching forwardscache route to reach the 3..Node H a rout reply the destination F through nodes that its own the packet . destination

Route Maintenance :y

y

y

If a packet cant be received by a node, it is retransmitted up to some maximum number of times until a confirmation is received from the next hop. A Route Error message is sent to the initiator, that can remove that Source Route from its Route Cache. The initiator check his Route Cache for another route to the target. If there is no route in the cache, a Route Request packet is broadcasted

Basic Operation Route Maintenance

B RERR RERR D G A H G

E

Route Cache (A) G: A, B, D, G G: A, C, E, H, G F: B, C, F

C FDynamic Source Routing in Ad hoc Wireless Networks

20 / 19

Ad hoc On Demand Distance Vectory In AODV, the network is silent until a connection is

needed. At that point the network node that needs a connection broadcasts a request for connection.yy

Each node only keeps next-hop informationSource broadcasts ROUTE REQUEST packetsy

Each node that sees the request and forwards it creates a reverse route to the source If the node knows the route to the destination, it responds with a ROUTE REPLY

y

RREQ

sourceRREP

destination

Reply packet follows broadcast path of route request packet recorded The neighbors in turn the reversethe packet till it reaches the destinationin broadcast packet

Destination Sequenced Distance Vector RoutingPackets transmitted according to the routing table Each node maintains routing table with entry for each node in the network Each node maintains its own sequence number Used for freedom from loops To distinguish stale routes from new ones

Destinat ion A B C1/9/2012

Next hop A B B

Hop no. 0 1 1

Seq. No. A 46 B 36 C 28

Install time 01000 01500 0200023

DSDV : Routing Updatey Each node periodically transmits updates to keep table consistency y Includes its own sequence number #, route table updates y Nodes also send routing table updates for important link changes (i.e. link breaks) y When two routes to a destination received from two different neighbors Choose the one with the greatest destination sequence number If equal, choose the smallest hop-count1/9/2012 24

1/9/2012

25

1/9/2012

26

1/9/2012

27

1/9/2012

28

1/9/2012

29

1/9/2012

30

1/9/2012

31

Limitations of existing routing protocols 1. Multiple Route Reply packets in response to asingle Route Request packet can lead to heavy control overhead.

2. Unnecessary bandwidth consumption.3.Packet header size grows with route length due to source routing 4. Flood of route requests may potentially reach all nodes in the network

1/9/2012

study and analysis of wireless network for rural area using ns2

32

.

Various types of long distance protocols are ..

wired network

1. Distance vector routing protocol . 2. Link state routing protocol . 3. Hierarchical routing protocol .

1/9/2012

study and analysis of wireless network for rural area using ns2

33

LINK STATE ROUTING.How routers using Link State Routing Protocols reach convergence Each routers learns about its neighbors and their network address. Link state routers exchange hello packet to meet other directly Calculates delay or cost to the neighbors. (round trip time) Each router builds its own Link State Packet (LSP) which includes information about neighbors such as Sender ID, seq. no., age & list of neighbors and delay After the LSP is created the router floods it to all neighbors who stores it and then forward it until all routers have the same information Once all the routers have received all the LSPs, the routers then construct a topological map of the network which is used to determine the best routes to a destination1/9/2012 study and analysis of wireless network for rural area using ns2 34

Distance Vector Routing Protocoly Each router maintain a table giving the best known route to each destination and which line to be used. y Distance vector routing protocol requires that a router informs its neighbors of topology changes periodically . y Routers are advertised as a vector of distance and direction

Direction next hop address Distance metrics such as hop county Distance vector routing keeps track of

1. direction in which packet should be 2. distance from its destination.

forwarded.

1/9/2012

study and analysis of wireless network for rural area using ns2

35

Link state routing Vs Distance vector routing

1/9/2012

study and analysis of wireless network for rural area using ns2

36

HIERARCHICAL ROUTING.y Routers are divide into REGIONS y Each Router has details about how to route packet within one region only. y For interconnected networks , each network is considered as separate

region.

1/9/2012

study and analysis of wireless network for rural area using ns2

37

ANALYSIS OF ROUTING PROTOCOL

PERFORMANCE ANALYSIS USING SIMULATIONy Simulation :Simulation can be defined as extraction of some essential information from a model to generate some characteristics and distinguish it from other model .y

Network Simulation :We carried out the whole simulation experiment in Linux (Fedora 10) using the latest network simulator (NS2.34). Ns 2.34 is a discrete event network simulator used for networking research. Ns2 provides the substantial support for simulation of network layer protocol i.e. routing protocol and transport layer protocol (TCP). We simulate the existing routing protocol over wireless network.

NS2 Software structurey NS-2 is a object oriented discrete event

simulator uses two language-

C++ for the core of the ns simulator. OTCL for control the network infrastructure.

y Component of NS-2.34 ns one of the component for generating .tr file. nam to visualize the simulation in graphical interface. xgraph to show the statistical result.

y What is .tr file ?? .tr file is generated after running the tcl script . It contains the all event information of the simulation asM 10.00000 0 (5.00, 5.00, 0.00), (250.00, 250.00), 3.00 s 10.000000000 _0_ AGT --- 0 tcp 40 [0 0 0 0] ------- [0:0 1:0 32 0] [0 0] 0 0 r 10.000000000 _0_ RTR --- 0 tcp 40 [0 0 0 0] ------- [0:0 1:0 32 0] [0 0] 0 0 .

Steps Of SimulationTcl script Filename.tcl ns Filename.tcl

filename.nam

Filename.tr

win.tr

nam Filename.tcl Network animator window view

Xgraph Filename.tr

Analysis using perl code

Xgraph view

Simulation of ad-hoc network using ns-2.34y Network infrastructure setupIn order to perform out test we are considering a simplified wireless topology as

Mobile host source station

Fixed base station

Mobile host destinati on station

Here source mobile host communicate to destination mobile host through the fixed base station while they are moving . Here we are not considering the hand off mechanism since only one base station.

IMPLEMENTATIONy For implementation let us consider a scenario with three nodes.1 2

0

Here node 2 is the base station. Node 0 and 1 is the moving station . we placing each of the node in the simulation environment in terms of its co-ordinate.

CONFIGURATION SETUP 1Firstly we will consider : (1) Mobility model as

A Wireless Channel. Radio propagation as TwoRayGround. Antenna type as OmniAntenna. Topography space 500*400 area. Maximum no. of node 3 and maximum speed of node 5 m/s. Simulation time 150 seconds.

(2)Traffic model as TCP connection between node 0 and node 1. Maximum size of a packet 40 bytes. Nodes move towards its destination co-ordinate.

ANALYSIS OF DSDVy Using the CONFIGURATION SETUP 1 when we use DSDV routing protocol simulation starts at 56.35 seconds.

ANALYSIS OF AODVy Using the CONFIGURATION SETUP 1 when we use AODV routing protocol simulation starts at 38.88 seconds.

ANALYSIS OF DSRy Using the CONFIGURATION SETUP 1 when we use DSR routing protocol simulation starts at 40.21 seconds.

XGRAPH PLOTING OF DSDV,AODV,DSR

PERFORMANCE ANALYSIS USING PERLy For competitive study of dsdv ,aodv and dsr we have to consider the following performance metrics Throughputs : It measure the performance of the network in terms of data rates i.e. how many packet sent over a interval of time in bit/sec. Packet delivery ratio : It measure the number of packet sent divided by number of packet received . so we have to calculate the number of packet sent and number of packet received for whole simulation. Average end to end delay : It describe the all possible delay for a packet , i.e. time difference between the receiving time and sending time.

So we will measure the difference between the above routing protocol using the above metrics.

COMEPERISION ANALYSISDSDVTHROUGHPUTS87833.4099337707 bit/sec

AODV63681.219423624 bit/sec

DSR37633.1191057963 bit/sec

AVERAGE END TO END DELAY

0.131129396542649 second

0.237035111771795 0.146208236424361 second Second 99.7248816991306 bytes 99.8140006763612 bytes

PACKET DELIVERY 99.7123405887429 bytes RATIO

PACKET SENT

10429

9087

11828

PACKET RECEIVED

10399

9062

11806

Graphical presentationTHROUGHPU TS100000 80000 60000 40000 20000 0

END TO END DELAY0.25 0.2 0.15 0.1 0.05 0

PACKET DELIVERY RATIO99.85 99.8 99.75 99.7 99.65

CONCLUSION FROM THE ABOVEy Using the CONFIGURATION SETUP 1 we are getting the above

result and we can conclude that.. From xgraph we can say that AODV routing protocol can sent and received packet from larger distance than DSDV and DSR. Throughput of DSDV routing protocol is better than DSDV and DSR. End to end delay of DSDV is less than AODV and DSR. Packet delivery ratio of DSR is better than AODV and DSDV. BUT SINCE WE ARE MAINLY CONCENTRATE ON DISTANCE SO WE CAN SAY THAT AODV ROUTING PROTOCOL IS BETTER THAN DSDV AND DSR IN TERMS OF DISTANCE.

CONFIGURATION SETUP 2(1) Mobility model as

A Wireless Channel. Radio propagation as Shadowing. Antenna type as DirAntenna.(For long distance) Topography space 1000*800 area. Maximum no. of node 3 and maximum speed of node 10 m/s. Simulation time 150 seconds.

(2)Traffic model as TCP connection between node 0 and node 1. Maximum size of a packet 40 bytes. Nodes move towards its destination co-ordinate.

XGRAPH VIEW using configuration setup 2 for DSDV,AODV and DSR

DIFFERENT PERFORMANCE METRICS ANALYSISDSDVTHROUGHPUTS22670.5143627882 bit/sec

AODV61556.2082014668 bit/sec

DSR33155.3655969049 bit/sec

AVERAGE END TO END DELAY

0.156224659065981 second

0.243004117701172 0.186042924432873 second Second 98.4912358553361 bytes 9014 99.459234608985 bytes 4808

PACKET DELIVERY 99.3412384716733 bytes RATIO PACKET SENT3036

PACKET RECEIVED

3016

8878

4782

GRAPHICAL PRESENTATIONTHROUGHPU TS70000 60000 50000 40000 30000 20000 10000 0

END TO END DELAY0.3 0.25 0.2 0.15 0.1 0.05 0

PACKET DELIVERY RATIO99.6 99.4 99.2 99 98.8 98.6 98.4 98.2 98

CONCLUSION FROM THE CONFIGURATION SETUP 2y Using the CONFIGURATION SETUP 2 we are getting the above result and we can conclude that.. DSDV protocol can not be used for long distance communication. Both AODV and DSR can be used for long distance communication but they behave differently. In case of AODV - Initially window size of AODV is higher (when mobile nodes come towards each other) but when time increases then window size decreases. In case of DSR - Initially window size of DSR is almost zero(when mobile nodes come towards each other) but when time increases then window size gradually increases. So both AODV and DSR can be used for long distance communication, but again we will comprise the performance metrics of AODV and DSR.

GRAPHICAL COMPERISION OF AODV AND DSR IN CASE OF BOTH SHORT AND LONG DISTANCE0.3 0.25 0.2 0.15 0.1 0.05 0 AODV DSR Long dist. end to end delay 98.5 98 97.5 AODV DSR Long dist. Packet delivery ratio Short dist. End to end delay 100 99.5 99 Short dist. Packet delivery ratio

THROUGHPUTS70000 60000 50000 40000 30000 Long dist. Throughputs 20000 10000 0 AODV DSR

Short dist. Throughputs

RESULTy From the above in case of both short and long distance point of view we conclude that

In case of end to end delay and packet delivery fraction DSR protocol perform better than AODV protocol in long distance communication. In case of throughputs AODV protocol perform better than DSR protocol in long distance communication. Since , in today s world everybody want high speed communication so AODV ROUTING PROTOCOL CAN BE USED FOR LONG-DISTANCE RURAL WIRELESS NETWORK.

FUTURE WORK

y We analysis the routing protocol maximum up to 3 kilometer length , i.e. AODV is better up to 3 k.m. range . In future it can be also extend the length up to 20 k.m or 30 k.m and so on.

y We analysis only the existing routing protocol , In future it can be also analysis the some new routing protocol such as , ADVANCED GREEDY FORWARDING , PREFERRED GROUP BROADCASTING etc.

REFERENCES