Ad Hoc

5,110 views
5,052 views

Published on

Use of Routing Protocols in Mobile Ad Hoc Network

Published in: Technology, Business
0 Comments
3 Likes
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total views
5,110
On SlideShare
0
From Embeds
0
Number of Embeds
20
Actions
Shares
0
Downloads
633
Comments
0
Likes
3
Embeds 0
No embeds

No notes for slide

Ad Hoc

  1. 1. Use Of Routing Protocols In Mobile Ad Hoc Network <ul><li>Presented by : </li></ul><ul><li>IQxplorer </li></ul>
  2. 2. Types Of Wireless Networks <ul><li>Infrastructure based(Cellular Network). </li></ul><ul><li>Infrastructureless Network ( Mobile Ad hoc </li></ul><ul><li>NETwork) (MANET). </li></ul>
  3. 3. Characteristics Of An Ad-hoc Network <ul><li>Collection of mobile nodes forming a temporary network </li></ul><ul><li>Network topology changes frequently and </li></ul><ul><li>unpredictably </li></ul><ul><li>No centralized administration or standard </li></ul><ul><li>support services </li></ul><ul><li>Host is also function as router. </li></ul>
  4. 4. Why Is Routing Different In Ad Hoc ??? <ul><li>Host mobility </li></ul><ul><ul><li>Dynamic topology </li></ul></ul><ul><ul><li>link failure/repair due to mobility </li></ul></ul><ul><li>Distributed Environment </li></ul><ul><li>Bandwidth constrained </li></ul><ul><li>Energy constrained </li></ul>
  5. 5. Categorization Of Ad-Hoc Routing Protocols
  6. 6. Table Driven Routing Protocol <ul><li>Proactive. </li></ul><ul><li>Each node maintains one or more tables </li></ul><ul><li>containing routing information to every other </li></ul><ul><li>node in the network. </li></ul><ul><li>Tables need to be consistent and up-to-date </li></ul><ul><ul><li>view of the network . </li></ul></ul><ul><li>Updates propagate through the network </li></ul>
  7. 7. Source Initiated On demand Routing Protocol <ul><li>Reactive. </li></ul><ul><li>on-demand style: create routes only when it is desired by the source node </li></ul><ul><li>When a node requires a route to a destination, it initiates a route discovery process </li></ul><ul><li>Route is maintained until destination becomes unreachable, or source no longer is interested in destination. </li></ul>
  8. 8. Destination-Sequenced Distance Vector Protocol (DSDV) <ul><li>Basic Routing Protocol </li></ul><ul><li>Each node maintains a list of all destinations and number of hops to each destination. </li></ul><ul><li>Each entry is marked with a sequence number. </li></ul><ul><li>Periodically send table to all neighbors to maintain topology </li></ul>
  9. 9. Example Of DSDV A’s Routing Table Before Change A’s Routing Table After Change Destination Next Hop Distance Sequence Number A A 0 S205_A B B 1 S334_B C C 1 S198_C D D 1 S567_D E D 2 S767_E F D 2 S45_F Destination Next Hop Distance Sequence Number A A 0 S304_A B D 3 S424_B C C 1 S297_C D D 1 S687_D E D 2 S868_E F D 2 S164_F
  10. 10. Clusterhead Gateway Switch Routing (CGSR) <ul><li>Similar to DSDV </li></ul><ul><li>Based on concept of clusters and cluster heads </li></ul><ul><li>Routing is done via the cluster heads and </li></ul><ul><li>gateways </li></ul><ul><li>A routing table among cluster heads are </li></ul><ul><ul><li>maintained </li></ul></ul>
  11. 11. Example Of CGSR <ul><li>Data forwarding steps: </li></ul><ul><ul><li>from cluster head to </li></ul></ul><ul><ul><li>cluster head </li></ul></ul><ul><ul><ul><ul><ul><li>in a hierarchical manner </li></ul></ul></ul></ul></ul><ul><ul><li>then from cluster head to </li></ul></ul><ul><ul><li>cluster members </li></ul></ul><ul><ul><li>between two cluster heads, </li></ul></ul><ul><ul><li>gateways are used to forward </li></ul></ul><ul><ul><li>the packets </li></ul></ul>
  12. 12. Source Initiated On Demand Routing Protocol
  13. 13. Ad Hoc On-Demand Distance Vector Routing (AODV) <ul><li>Pure on-demand protocol </li></ul><ul><li>Node does not need to maintain knowledge of another node unless it communicates with it </li></ul><ul><li>AODV includes route discovery and route maintenance. </li></ul><ul><li>AODV minimizes the number of broadcasts by creating routes on-demand </li></ul><ul><li>AODV uses only symmetric links because the route reply packet follows the reverse path of route request packet </li></ul>
  14. 14. PATH DISCOVERY <ul><li>In the path discovery (RREQ) phase, source broadcasts RREQ message. </li></ul><ul><li>Intermediate nodes record in their route tables the address of neighbor from which RREQ is received to establish a reverse path. </li></ul><ul><li>When RREQ reaches destination or an intermediate node responds by unicasting a route reply (RREP) back to neighbor </li></ul><ul><li>If source node moves, reestablish the path. </li></ul><ul><li>If destination or intermediate node moves, send link failure notification message to each of its active upstream. </li></ul><ul><li>Then reinitiate path discovery . </li></ul>
  15. 15. Dynamic Source Routing Protocol (DSR) <ul><li>on-demand </li></ul><ul><li>A node maintains route cache containing the </li></ul><ul><li>routes it knows </li></ul><ul><li>Two main phases </li></ul><ul><ul><li>Route discovery </li></ul></ul><ul><ul><li>Route maintenance </li></ul></ul><ul><li>Basic Operation is similar to AODV. </li></ul>
  16. 16. Example Of DSR
  17. 17. DISADVANTAGE OF PROACTIVE AND REACTIVE APPROACH
  18. 18. Hybrid Routing Protocols
  19. 19. Zone Routing Protocol <ul><li>Hybrid of table-driven and on-demand!! </li></ul><ul><li>From each node, there is a concept of “ zone ” . </li></ul><ul><ul><li>Within each zone, the routing is performed in a </li></ul></ul><ul><ul><li>table-driven manner (proactive). </li></ul></ul><ul><ul><li>However, a node does not try to keep global </li></ul></ul><ul><ul><li>routing information. </li></ul></ul><ul><li>For inter-zone routing, on-demand routing is used. </li></ul>
  20. 20. Example Of ZRP <ul><li>Three types of nodes: </li></ul><ul><ul><li>Border Nodes </li></ul></ul><ul><ul><li>Peripherals Nodes </li></ul></ul><ul><ul><li>Interior Nodes </li></ul></ul>
  21. 21. Comparison Parameters On Demand Table Driven Availability of routing information Available when needed Always available regardless of need Routing philosophy Flat Mostly flat, except for CGSR Periodic route updates Not required Required Coping with mobility Use localized route discovery Inform other nodes to achieve consistent routing table Signaling traffic generated Grows with increasing mobility Greater than that of on demand routing
  22. 22. References <ul><li>Elizabeth M. Royer, Chai-Keong Toh, A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks, Proc. IEEE,1999. </li></ul><ul><li>David B. Johnson, &quot; Routing in Ad hoc Networks of Mobile Hosts &quot;, Proc </li></ul><ul><li>IEEE Workshop on Mobile Computing Systems and Applications. </li></ul><ul><li>Nicklas Beijar “ Zone Routing Protocol “. </li></ul><ul><li>www.cse.wustl.edu/~jain/cis788-99/adhoc_routing/ </li></ul><ul><li>http://www.comp.brad.ac.uk/~sburuha1/index.htm </li></ul><ul><li>www.computingunplugged.com/ issues/issue200407/00001326001.html </li></ul><ul><li>http://www.ietf.org/rfc/rfc3561.txt </li></ul>
  23. 23. <ul><li>THANKYOU </li></ul><ul><li>? </li></ul>

×