Routing Protocols in Ad-hoc Network

8/7/2019 Routing Protocols in Ad-hoc Network

1/14

By-Md.AsifSudhir KAtiyar

Tanuj Kumar

Project Guide : -

Mr.Trith Raj


2/14

A routing protocol is a protocol that specifieshow routers communicate with each other.

A router is an electronic device that interceptssignals on a computer network.

A routing protocol uses metrics to determine

which path to utilize to transmit a packet acrossa network.


3/14

Ad hoc is a Latin phrase which means "Forthis.A w ireless ad hoc net w ork is a decentralizedwireless network.The network is ad-hoc because it does notrely on a pre-existing infrastructure, such asrouters in wired networks.

It provide a dedicated link betweek thedevices for short time interval as in mobilenetwork(MANET).


4/14

U nderstand the concept of ad hoc networks.

Select the routing protocol.

Data transmission using Best or shortestpath.

Instant connection is provided.

Data is sent without using wires.


5/14

An ad hoc routing protocol is a convention,or standard, that controls how nodes decidewhich way to route packets between

computing devices in a ad hoc network.They are :-

1. Pro-active (table-driven) routing2. Reactive (on-demand) routing


6/14


7/14

Ad hoc On-Demand Distance Vector ( AODV)Routing is a routing protocol for mobile ad hocnetworks(MANETs) and other wireless ad-hocnetworks.It is a reactive routing protocol, meaning that itestablishes a route to a destination only ondemand.

AODV Protocol Activities :-

Route discovery->U ndertaken whenever a node needs a next hop toforward a packet to a destination

Route maintenance->U sed when link breaks, rendering next hop unusable

Routing (easy!)


8/14

Route Request:Source broadcasts Route Request (RREQ) message forspecified destinationIntermediate node:

Forwards (broadcasts) message toward destinationCreates next-hop entry for reverse path to source, to use whensending reply (assumes bidirectional link)


9/14

Destination unicasts Route Reply (RREP) message tosource

RREP contains sequence number, hop-count field (initialized to0)Will be sent along reverse path hops created by intermediatenodes which forwarded RREQ

Intermediate node:Create next-hop entry for destination as RREP is received,forward along reverse path hopIncrement hop-count field in RREP and forward

Source:If multiple replies, uses one with lowest hop count


10/14

U sed when link breakage occursLink breakage detected by link-layer ACK, passiveACK, AODV Hello messages

Detecting node may attempt local repairSend RREQ for destination from intermediate node

Route Error (RERR) message generatedContains list of unreachable destinations

Sent to precursors: neighbors who recently sentpacket which was forwarded over broken linkPropagated recursively


11/14

ScalabilityNo inherent subnetting provision in routingtables one entry per destination

DirectionalityAssumes there is at least one bidirectional pathbetween any two nodes

MulticastTrue multicast-tree generation and maintenanceDetailed in supplementary (expired) draft

BroadcastSuggested use of IP Ident field for duplicatedetection


12/14

SOFTWARE REQUIREMENTS:

Operating System : FEDOR A/ Windo w s

Software used : NETWORK SIMULATOR 2H ARDWARE REQUIREMENTS:

1 routing protocolU p to 100 routesMemory: 512 MB Storage :2 GB


13/14

In the future, extensive simulations could becarried out using the link state algorithm, inorder to gain a more in-depth performance

analysis of the ad hoc routing protocols. Othernew protocol performance could be studiedtoo.


14/14

Documents

Routing Protocols in Ad-hoc Network