|
 


 
  
Presented By :-
|




J te:-28/03/2011

Jept. Of Computer Science & Engg.

ORISSA ENGINEERING COLLEGE
BHUBANESWAR
Types of Wireless Networks

D Infrastructure based(Cellular Network).

D Infrastructureless Network[obile Ad hoc

NETwork) (ANET).
0



 




   

D Collection of mobile nodes forming a temporary

network
D Network topology changes frequently and
unpredictably
D No centralized administration or standard
support services
D Host is also function as router
Why is Routing Different in Ad Hoc ???

D Host mobility
‡ Dynamic topology
‡ link failure/repair due to mobility
D Distributed Environment
D Bandwidth constrained
D Energy constrained
Categorization of Ad-Hoc Routing Protocols
Table Driven Routing Protocol

D Proactive.
D Each node maintains one or more tables
containing routing information to every other
node in the network.
D Tables need to be consistent and up-to-date
view of the network.
D Updates propagate through the network
ource Initiated On demand routing protocol

D Reactive.
D on-demand style: create routes only when it is
desired by the source node
D When a node requires a route to a destination,
it initiates a route discovery process
D Route is maintained until destination becomes
unreachable, or source no longer is interested
in destination.

|
 

Destination-equenced Distance Vector Protocol

Destination-
(DDV)

D Basic Routing Protocol

D Each node maintains a list of all destinations
and number of hops to each destination.
D Each entry is marked with a sequence number.
D Periodically send table to all neighbors to
maintain topology
Example of DDV
2
 
  
Jestin tion Next Hop Jist nce Sequence Number
A A 0 S205_A
B B 1 S334_B
C C 1 S198_C
J J 1 S567_J
E J 2 S767_E
F J 2 S45_F

2
 
 2 
Jestin tion Next Hop Jist nce Sequence Number

A A 0 S304_A

B J 3 S424_B

C C 1 S297_C

J J 1 S687_J

E J 2 S868_E

F J 2 S164_F
Clusterhead Gateway witch Routing
(CGR)

D imilar to DDV
D Based on concept of clusters and cluster heads
D Routing is done via the cluster heads and
gateways
D A routing table among cluster heads are
maintained
Example of CGR

DData forwarding steps:

‡from cluster head to
cluster head
±in a hierarchical manner
‡then from cluster head to
cluster members
‡between two cluster heads,
gateways are used to forward
the packets

   

 

Ad hoc On-
On-demand Distance Vector Routing
(AODV)
D Pure on-demand protocol
D Node does not need to maintain knowledge of another
node unless it communicates with it
D AODV includes route discovery and route maintenance.
D AODV minimizes the number of broadcasts by creating
routes on-demand
D AODV uses only symmetric links because the route reply
packet follows the reverse path of route request packet
D AODV uses hello messages to know its neighbors and
to ensure symmetric links
Path discovery

D In the path discovery

(RREQ) phase, source
broadcasts RREQ message.
D Intermediate nodes record
in their route tables the
address of neighbor from
which RREQ is received to
establish a reverse path.
D When RREQ reaches
destination or an
intermediate node
responds by unicasting a
route reply (RREP) back to
neighbor.
Path maintenance

D If source node moves, reestablish the path.

D If destination or intermediate node moves,
send link failure notification message to each
of its active upstream.
D Then reinitiate path discovery .
Dynamic ource Routing Protocol
(DR)

D on-demand
D A node maintains route cache containing the
routes it knows
D Two main phases
‡ Route discovery
‡ Route maintenance
D Basic Operation is similar to AODV.
D ain difference
‡ To use routing cache for link failure.
‡ When route discovery phase, node send route
request message with its own address.
Example of DR
 |
 

‰one Routing Protocol

D Hybrid of table-driven and on-demand!!

D From each node, there is a concept of ³zone´.
‡ Within each zone, the routing is performed in a
table-driven manner (proactive).
‡ However, a node does not try to keep global
routing information.
D For inter-zone routing, on-demand routing is
used.
Example of ‰PR

D Three types of nodes:

‡ Border Nodes
‡ Peripherals Nodes
‡ Interior Nodes
 Comparison


   





  

  




 


   


  
   

0     
   

    
 
 
 
 

!



 "   "


of