ROUTING PROTOCOLS IN AD-

HOC NETWORK

Project Guide : - By-Md.Asif

Mr.Trith Raj Sudhir KAtiyar
Tanuj Kumar
 ROUTING PROTOCOL
 A routing protocol is a protocol that specifies
how routers communicate with each other.

 A router is an electronic device that intercepts

signals on a computer network.

 A routing protocol uses metrics to determine

which path to utilize to transmit a packet across
a network.
 AD-HOC NETWORK
 Ad hoc is a Latin phrase which means "For
this“.
 A wireless ad hoc network is a
decentralized wireless network.
 The network is ad-hoc because it does not
rely on a pre-existing infrastructure, such as
routers in wired networks.
 It provide a dedicated link betweek the
devices for short time interval as in mobile
network(MANET).
 OBJECTIVE
 Understand the concept of ad hoc networks.

 Select the routing protocol.

 Data transmission using “Best or shortest

path”.

 Instant connection is provided.

 Data is sent without using wires.

 AD HOC ROUTING PROTOCOLS

 An ad hoc routing protocol is a convention,

or standard, that controls how nodes decide
which way to route packets between
computing devices in a ad hoc network.
They are :-

1. Pro-active (table-driven) routing

2. Reactive (on-demand) routing
 Pro-active protocols maintains fresh lists of
destinations and their routes by periodically
distributing routing tables throughout the
network.

 Reactive protocols finds a route on demand

by flooding the network with Route Request
packets.
 AODV PROTOCOL
 Ad hoc On-Demand Distance Vector (AODV)
Routing is a routing protocol for mobile ad hoc
networks(MANETs) and other wireless ad-hoc
networks.
 It is a reactive routing protocol, meaning that it
establishes a route to a destination only on demand.
AODV Protocol Activities :-
 Route discovery

->Undertaken whenever a node needs a “next hop” to

forward a packet to a destination
 Route maintenance
->Used when link breaks, rendering next hop unusable
 Routing (easy!)
 ROUTE DISCOVERY
Route Request:
 Source broadcasts Route Request (RREQ) message for
specified destination
 Intermediate node:
 Forwards (broadcasts) message toward destination
 Creates next-hop entry for reverse path to source, to use when
sending reply (assumes bidirectional link…)
  Destination unicasts Route Reply (RREP) message to
ROUTE REPLY:
source
 RREP contains sequence number, hop-count field (initialized to
0)
 Will be sent along “reverse” path hops created by intermediate
nodes which forwarded RREQ
 Intermediate node:
 Create next-hop entry for destination as RREP is received,
forward along “reverse path” hop
 Increment hop-count field in RREP and forward
 Source:
 If multiple replies, uses one with lowest hop count
ROUTE MAINTENANCE
 Used when link breakage occurs
 Link
breakage detected by link-layer ACK, “passive
ACK”, AODV “Hello” messages
 Detecting node may attempt “local repair”
 Send RREQ for destination from intermediate node
 Route Error (RERR) message generated
 Contains list of unreachable destinations
 Sent to “precursors”: neighbors who recently sent
packet which was forwarded over broken link
 Propagated recursively
 ISSUES
 Scalability
 Noinherent “subnetting” provision in routing tables
– one entry per destination
 Directionality
 Assumesthere is at least one bidirectional path
between any two nodes
 Multicast
 True multicast-tree generation and maintenance
 Detailed in supplementary (expired…) draft

 Broadcast
 Suggested use of IP Ident field for duplicate
detection
 REQUIREMENTS
 SOFTWARE REQUIREMENTS: 
Operating System : FEDORA/Windows
Software used : NETWORK SIMULATOR 2
  HARDWARE REQUIREMENTS: 

1 routing protocol
Up to 100 routes
Memory: 512 MB Storage :2 GB
 
 FUTURE WORK
In the future, extensive simulations could be
carried out using the link state algorithm, in
order to gain a more in-depth performance
analysis of the ad hoc routing protocols. Other
new protocol performance could be studied
too.
THANK YOU