Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.
Upcoming SlideShare
Ppt of routing protocols


Wireless routing protocols

Related Books

Free with a 30 day trial from Scribd

See all

Related Audiobooks

Free with a 30 day trial from Scribd

See all

Wireless routing protocols

  1. 1. ROUTING PROTOCOLS IN WIRELESS NETWORK PRESENTED BY :- PANKAJ BARODIA ROLL NO. :- 09112019 M.TECH (CSE) Deenbandhu Chhotu Ram University of Science and Technology Murthal, Sonipat (Haryana), June 2011
  2. 2. What is routing ? <ul><li>Routing is the process of selecting paths in a network along which to send network traffic. </li></ul><ul><li>It is of two types – </li></ul><ul><li>Static Routing </li></ul><ul><li>Dynamic Routing </li></ul>What is protocol ? A specific set of communication rules by which computers communicate with each other.
  3. 3. What is routing protocols ? <ul><li>A routing protocol is a protocol that specifies how routers communicate with each other. </li></ul><ul><li>Routing protocols use metrics to evaluate what path will be the best for a packet to travel. </li></ul><ul><li>A metric is a standard of measurement, such as </li></ul><ul><li>- Path bandwidth </li></ul><ul><li>- Reliability </li></ul><ul><li>- Delay </li></ul><ul><li>- Current load on that path </li></ul>
  4. 4. Types of Wireless Network <ul><li>There are basically four different types of wireless networks. </li></ul><ul><li>- WPAN (Wireless Personal Area Network) </li></ul><ul><li>- WLAN (Wireless Local Area Network) </li></ul><ul><li>WMAN (Wireless Metropolitan Area Network) </li></ul><ul><li>WWAN (Wireless Wide Area Network) </li></ul>
  5. 5. Wireless Networks Division
  6. 6. Ad-Hoc Routing protocols Ad-Hoc Routing Protocols Table Driven On-demand Driven WRP DSDV CGSR AODV DSR LMR ABR TORA LSR Direct Descendants Logical Descendants Proactive Reactive
  7. 7. Table Driven Routing Protocols <ul><li>Destination Sequenced Distance – Vector Routing Protocol (DSDV) </li></ul><ul><li>The Wireless Routing Protocol (WRP) </li></ul><ul><li>Global State Routing (GSR) </li></ul><ul><li>Fisheye State Routing (FSR) </li></ul><ul><li>Hierarchical State Routing (HSR) </li></ul><ul><li>Zone-based Hierarchical Link State Routing Protocol (ZHLS) </li></ul><ul><li>Clusterhead Gateway Switch Routing Protocol (CGSR) </li></ul>
  8. 8. On-Demand Routing Protocols <ul><li>Cluster based Routing Protocol (CBRP) </li></ul><ul><li>Ad hoc On-demand Distance Vector Routing (AODV) </li></ul><ul><li>Dynamic Source Routing Protocol (DSRP) </li></ul><ul><li>Temporally Ordered Routing Algorithm (TORA) </li></ul><ul><li>Associativity Based Routing (ABR) </li></ul><ul><li>Signal Stability Routing (SSR) </li></ul>
  9. 9. Destination Sequenced Distance Vector (DSDV) <ul><li>Each Node Maintains Tables for: </li></ul><ul><ul><li>Next Hop on Path </li></ul></ul><ul><ul><li>Distance (in hops) to destination </li></ul></ul><ul><ul><li>Sequence Number ( keep current route) </li></ul></ul><ul><li>Nodes Exchange Updates With Neighbors </li></ul><ul><li>If the two nodes have the same sequence number then route with the best metric is used </li></ul>
  10. 10. Routing table of Node A in this network is A B C Destination Next Hop Number of Hops Sequence Number Install Time A A 0 A 46 001000 B B 1 B 36 001200 C B 2 C 28 001500
  11. 11. Advantages of DSDV <ul><li>It is quite suitable for creating ad-hoc networks with small number of nodes </li></ul><ul><li>Solve the Routing Loop problem </li></ul><ul><li>Count to infinity problem is reduced </li></ul><ul><li>DSDV maintains only the best path instead of maintaining multiple paths to every destination </li></ul>
  12. 12. Disadvantages of DSDV <ul><li>DSDV requires a regular update of its routing tables, which uses up battery power and a small amount of bandwidth even when the network is idle </li></ul><ul><li>Whenever the topology of the network changes, a new sequence number is necessary </li></ul><ul><li>DSDV is not suitable for highly dynamic networks </li></ul>
  13. 13. Wireless Routing Protocols <ul><li>Each Node maintains four tables </li></ul><ul><li> - Distance table </li></ul><ul><ul><li>- Routing table </li></ul></ul><ul><ul><li>- Link-cost table </li></ul></ul><ul><ul><li>- Message retransmission list (MRL) table </li></ul></ul><ul><li>MRL contains the sequence number of the update message, a retransmission counter and a list of updates sent in the update message </li></ul><ul><li>Nodes inform each other of link changes using update messages </li></ul>
  14. 14. <ul><li>Nodes send update messages after processing updates from their neighbors or after detecting a change in the link </li></ul><ul><li>If a node is not sending messages, it must send a HELLO message within a specified time to ensure connectivity </li></ul><ul><li>If the node receives a HELLO message from a new node, that node is added to the table </li></ul><ul><li>It avoids the “count to infinity” problem </li></ul>
  15. 15. Disadvantages of WRP <ul><li>Four tables requires a large amount of memory </li></ul><ul><li>Periodic hello message consumes power and bandwidth </li></ul>Advantages of WRP <ul><li>A problem of the Bellman-Ford protocol is the count-to-infinity problem. This is a problem that is solved by WRP </li></ul>
  16. 16. <ul><li>CGSR uses DSDV routing scheme </li></ul><ul><li>Based on concept of clusters and cluster heads </li></ul><ul><li>Routing is done via the cluster heads and gateways </li></ul><ul><li>A packet sent by a node is first routed to its cluster head and then the packet is routed from the cluster head to gateway to another cluster head and so on until the cluster head of the destination node is reached </li></ul>Clusterhead Gateway Switch Routing (CGSR)
  17. 17. CGSR Example <ul><ul><ul><li>Cluster head : </li></ul></ul></ul><ul><ul><ul><ul><li>- Forwards packets to gateways on behalf of source nodes </li></ul></ul></ul></ul><ul><ul><ul><ul><li>- Dynamically elected </li></ul></ul></ul></ul><ul><ul><ul><ul><li>Gateway : </li></ul></ul></ul></ul><ul><ul><ul><ul><li>- nodes within the communication range of two or more cluster head </li></ul></ul></ul></ul>1 2 3 5 4 6 7 8 Gateway Cluster head Node Cluster 1 Cluster 2 Cluster 3
  18. 18. Advantages of CGSR <ul><li>Better bandwidth utilization </li></ul><ul><li>Reduce the size of distance vector table because the routing is performed only over cluster head </li></ul>
  19. 19. Disadvantages of CGSR <ul><li>More time is spend in selection of cluster heads and gateways </li></ul><ul><li>If the mobile node uses CDMA/TDMA then it can take some time to get permission to send packets </li></ul><ul><li>Changes in the cluster-head, may result in multiple path breaks </li></ul>
  20. 20. Ad Hoc On-demand Distance Vector Routing (AODV) <ul><li>Route Discovery Process : </li></ul><ul><li>Source Node initiates path discovery process by broadcasting RREQ </li></ul><ul><li>RREQ is forwarded until it reaches an intermediate node that has a recent route information about the destination or till it reaches the destination </li></ul><ul><li>The RREQ uses sequence numbers to ensure that the routes are loop free and reply contains latest information only </li></ul>
  21. 21. <ul><li>When a node forwards a route request packet to its neighbors, it also records in its tables the node from which the first copy of the request came </li></ul><ul><li>This table is used to construct the reverse path for the RREQ </li></ul><ul><li>As the RREP traverses back to the source, the nodes along the path enter the forward route into their tables </li></ul>Route reply process :
  22. 22. <ul><li>If one of the intermediate nodes move then the moved nodes neighbor realizes the link failure and sends a link failure notification to its upstream neighbors and so on till it reaches the source </li></ul><ul><li>Route Error Packets (RERR) are used to erase broken links </li></ul>
  23. 23. 1 2 3 5 7 8 4 6 1 2 3 5 7 8 4 Propagation of Route Request (RREQ) packet 6 Path taken by the Route Reply (RREP) packet Route Discovery in AODV :
  24. 24. Protocol Messaging S 1 2 D Hello RREQ RREP Data RERR
  25. 25. Advantages of AODV <ul><li>The main advantage of this protocol is that routes are established on demand and destination sequence numbers are used to find the latest route to the destination </li></ul><ul><li>The connection setup delay is lower </li></ul>
  26. 26. Disadvantages of AODV <ul><li>Intermediate nodes can lead to inconsistent routes if the source sequence number is very old </li></ul><ul><li>The periodic beaconing leads to unnecessary bandwidth consumption </li></ul>
  27. 27. Dynamic Source Routing (DSR) The two major phases of the protocol are : 1. Route discovery 2. Route maintenance
  28. 28. DSR - Route Discovery <ul><li>The sender : </li></ul><ul><li>broadcast a route request packet </li></ul><ul><li>The receiver : </li></ul><ul><li>I t looks up its route cache to determine if it already contains a route to the destination </li></ul><ul><li>If host's address is already listed in the route record </li></ul><ul><li>- Discard </li></ul><ul><li>If host is the target </li></ul><ul><li>- Send a route reply </li></ul><ul><li>Else </li></ul><ul><li>- Append this host's address to the route record, and re-broadcast </li></ul>
  29. 29. <ul><li>Route reply is generated when the route request reaches either destination itself or intermediate node </li></ul><ul><li>When destination is reached then destination returns RouteReply with full path </li></ul><ul><li>Source node caches all paths that it receives and choose Shortest Path among all the path that it receives </li></ul>
  30. 30. DSR – Route Request S A G C F D B E S S-B S-B-E S-A S S-A-G S-A-G-F S-B S-B-C S-B-C RouteRequest Dropped
  31. 31. DSR – Route Reply S A G C F D B E S-B-E-D S-B-E-D S-B-E-D S-A-G-F-D S-A-G-F-D S-A-G-F-D S-A-G-F-D S-B-E-D S-A-G-F-D
  32. 32. DSR - Route Maintenance <ul><li>Triggered when a link breaks between two nodes along the path from the Source to the destination </li></ul><ul><li>Node who discover the break send a RouteError to inform the source node about the broken link </li></ul><ul><li>Source Node </li></ul><ul><ul><ul><li>- Erase the route from the cache, and </li></ul></ul></ul><ul><ul><ul><li>- Use another cached routes, Or </li></ul></ul></ul><ul><ul><ul><li>- Request a new Route </li></ul></ul></ul>
  33. 33. DSR - Route Maintenance S A G C F D B E RouteError RouteError S-B-E-D S-A-G-F-D
  34. 34. Advantages of DSR <ul><li>A route is established only when it is required and hence the need to find routes to all other nodes is eliminated </li></ul><ul><li>The intermediate nodes utilize the route cache information to reduce the control overhead </li></ul>
  35. 35. Disadvantages of DSR <ul><li>The route maintenance mechanism does not locally repair a broken link </li></ul><ul><li>The connection setup delay is higher than in table-driven protocols </li></ul><ul><li>This routing overhead is directly proportional to the path length </li></ul>
  36. 36. Temporally Ordered Routing Algorithm (TORA) <ul><li>It is based on Link Reversal Algorithms </li></ul><ul><li>It is a source-initiated on-demand routing protocol and it finds multiple routes from a source node to a destination node </li></ul><ul><li>It has three basic functions </li></ul><ul><li>- Route creation </li></ul><ul><li>- Route maintenance </li></ul><ul><li>- Route erasure </li></ul>
  37. 37. TORA – Route Discovery <ul><li>Route Creation is done using QRY and UPD packets </li></ul><ul><li>QRY packet : contains the destination-ID (did) for which the algorithm is running </li></ul><ul><li>UPD packet : contains the (did) and the Height of the node i (Hi) that is broadcasting the packet </li></ul><ul><li>The height of destination set to 0 and all other node's height set to NULL </li></ul><ul><li>The source broadcasts a QRY packet with the destination node's ID in it </li></ul>
  38. 38. <ul><li>A node with not NULL height responds with a UPD packet that has its height in it </li></ul><ul><li>A node receiving a UPD packet sets its height to one more than that of the node that generated the UPD </li></ul><ul><li>A node with higher height is considered upstream and a node with lower height considered downstream </li></ul><ul><li>In this way a directed acyclic graph is constructed from source to the destination </li></ul>
  39. 39. <ul><li>Route Erasure : </li></ul><ul><ul><li>- A clear packet (CLR) is flooded through network to erase invalid routes </li></ul></ul>
  40. 40. Illustration of TORA height metric Source Destination H = 0 H = 1 H = 2 H = 3
  41. 41. Route Creation of TORA 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 s s d d Propagation of QRY (reference level, height) Height of each node updated by UPD (-,-) (-,-) (-,-) (-,-) (-,-) (-,-) (0,0) (-,-) (0,3) (0,3) (0,3) (0,2) (0,1) (0,0) (0,1) (0,2)
  43. 43. Route maintenance C A B E F D UPD X UPD G (DEST) H
  44. 44. Advantages of TORA <ul><li>An on-demand routing protocol create a DAG only when necessary </li></ul><ul><li>Multiple paths created </li></ul><ul><li>Good in dense networks </li></ul>
  45. 45. Disadvantages of TORA <ul><li>Not much used since DSR and AODV outperform TORA </li></ul><ul><li>Performance degrades with increasing mobility </li></ul>
  46. 46. References : <ul><li>Jochen Schiller. Mobile Communications. Addison-Wesley </li></ul><ul><li>Andrew S. Tanenbaum. Computer Networks, 4th Edition. PRENTICE HALL </li></ul><ul><li>David B. Johnson, Davis A. Maltz, &quot;Dynamic Source Routing in Ad Hoc Networks&quot;, Mobile Computing, T. Imielinski and H. Korth, Eds., Kulwer </li></ul><ul><li> </li></ul><ul><li> </li></ul><ul><li> </li></ul><ul><li> (802.11) </li></ul>
  47. 47. <ul><li> (AODV) </li></ul><ul><li> </li></ul><ul><li> (SSR) </li></ul>
  • DharanipriyaR

    Aug. 31, 2021
  • VikasPandey261

    Aug. 2, 2021
  • naveenkumar5374

    Jun. 18, 2021
  • AnaniyaAgarwal

    Mar. 11, 2021
  • VadivelVadivel8

    Oct. 24, 2020
  • raviram123

    Oct. 20, 2020
  • KasulaJaggdish

    Jul. 31, 2020
  • abha_jain

    Feb. 10, 2020
  • raheelsarwar

    Dec. 7, 2019
  • KishanTheratipally

    Dec. 4, 2019
  • Askarcse

    Nov. 17, 2019
  • MohammadRezaArab1

    Nov. 8, 2019
  • hidayat_Azam

    Jul. 17, 2019
  • sivad4

    May. 31, 2019
  • pratibhabasate

    May. 13, 2019
  • tugumejohn

    May. 2, 2019
  • kinthaliakhil1

    Apr. 23, 2019
  • yogeshsolanki13

    Apr. 8, 2019
  • AhNh1

    Mar. 10, 2019
  • pavankumar2452

    Feb. 26, 2019


Total views


On Slideshare


From embeds


Number of embeds