1 / 32

A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks

This review explores table-driven and source-initiated routing protocols for Ad Hoc mobile wireless networks, analyzing various protocols, comparisons, applications, and challenges. The study addresses network limitations and the need for efficient routing strategies, offering insights into key routing technologies.

margaretanderson
Download Presentation

A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks Author: E. Royer and C.-K. Toh Source: IEEE Personal Communication April 1999, vol. 6, no. 2, page. 48~51 Date: 2002/12/12

  2. Outline • Introduction • Table-Driven Routing • Source-Initiated On-Demand Routing • Comparisons • Application and Challenges • Conclusion

  3. Introduction • Current variations of mobile wireless networks • Infrastructured network • Infrastructureless mobile network (Ad Hoc) • Existing Ad Hoc routing protocols • limitation of these networks • High power consumption • Low bandwidth • High error rates • Categorized as • Table-driven • Source-initiated (demand-driven)

  4. Ad Hoc Routing Protocols

  5. Table-Driven Routing Protocols • Destination-Sequenced Distance-Vector Routing (DSDV) • Clusterhead Gateway Switch Routing (CGSR) • The Wireless Routing Protocol (WRP)

  6. Destination-Sequenced Distance-Vector Routing • Based on Bellman-Ford algorithm • Every mobile station maintains a routing table that lists all available destinations. • The stations periodically transmit their routing tables to their immediate neighbors.

  7. 1 Movement in DSDV MH4 forwarding table 1. update table 2. advertise changes 3 4 5 8 2 6 7 1

  8. MH4 forwarding table (updated) MH4 advertised table (updated)

  9. Clusterhead Gateway Switch Routing • Cluster member table • Using DSDV algorithm. • The mobile nodes are aggregated into clusters and a cluster-head is elected. • Least Cluster Change (LCC) algorithm • A cluster-head control a group of ad hoc nodes. • A gateway is a node that is in the communication range of two or more cluster-heads.

  10. 12 1 10 CGSR Example 6 11 5 7 4 8 2 9 3 Internal node Cluster-head Gateway

  11. The Wireless Routing Protocol • A table-based distance-vector routing protocol • Each node maintains • Distance table • Routing table • Link-Cost table • Message Retransmission List (MRL) table

  12. Source-Initiated On-Demand Routing Protocols • Ad Hoc On-Demand Distance Vector Routing • Dynamic Source Routing • Temporally Ordered Routing Algorithm • Associativity-Based Routing • Signal Stability Routing

  13. Ad Hoc On-Demand Distance Vector Routing • Route discovery • Route Request (RREQ) • Route Reply (RREP) • Route maintenance • Hello messages • Failure notification message

  14. Destination N2 N8 N5 Source N1 N4 N7 N3 N6 Ad Hoc On-Demand Distance Vector Routing (cont.)

  15. Destination N2 N8 N5 Source N1 N4 N7 N3 N6 Ad Hoc On-Demand Distance Vector Routing (cont.)

  16. Dynamic Source Routing • Route discovery • Route request • Route reply • Route maintenance • Route error packets

  17. N1-N2 Destination N2 N1-N2-N5 N8 N5 N1 N1-N3-N4-N7 Source N1 N1-N3-N4 N1-N3 N4 N7 N1 N3 N1-N3-N4-N6 N6 N1-N3-N4 Dynamic Source Routing

  18. Destination N1-N2-N5-N8 N2 N1-N2-N5-N8 N1-N2-N5-N8 N8 N5 Source N1 N4 N7 N3 N6 Dynamic Source Routing

  19. Temporally Ordered Routing Algorithm • Route creation • Directed acyclic graph (DAG) • Route maintenance • New reference level • Route erasure • Clear packet

  20. Source Ad hoc node Height metric Destination Temporally Ordered Routing Algorithm (cont.)

  21. B C B C A A D D G G E E F F (2) (1) B C B C A A D D G G E E F F (3) (4) Link failure Link reversal Temporally Ordered Routing Algorithm (cont.)

  22. Associativity-Based Routing • Route discovery • Broadcast Query (BQ) • Await-Reply (BQ-Reply) • Route reconstruction • Route notification (RN) • Localized query (LQ) • Route deletion • Route delete (RD)

  23. SRC BQ DEST SRC RN[1] Route maintenance for a source move Associativity-Based Routing(cont.)

  24. DEST LQ[H] SRC H=3 DEST RN[0] RN[0] Route maintenance for a destination move Associativity-Based Routing(cont.)

  25. Signal Stability Routing • Route discovery • Beacon to each neighboring node • Static Routing Protocol (SRP) • Route maintenance • Dynamic Routing Protocol (DRP) • Route failed • Error message

  26. Comparisons of Table-driven Protocols

  27. Comparisons of On-Demand Protocols

  28. Comparisons (cont.) • ADOV VS. DSR • Overhead of DSR is potentially larger than ADOV (carry information) • Symmetric & Asymmetric • Single route & Multiple routes • DSR is not scalable to large networks

  29. Comparisons (cont.) • TORA (link reversal) • Best suited for networks with large dense populations of nodes • Multiple routes • Fewer route rebuilding • With LAM algorithm to provide multicast capability (GPS)

  30. Comparisons (cont.) • ABR • Aggregated associativity ticks • Guarantee to be free of packet duplicate • Beacon • SSR • Signal strength and location stability not necessarily shortest in hop count • Intermediate can’t reply (long delay)

  31. Applications and Challenges • Application • Military (non-fixed) • Conference/meeting/lectures • Emergency • Challenges • Multicast (dynamic multicast-tree ) • QoS support (MAC layer) • Power-aware routing (handheld devices) • Location aided routing (analogous ABR) • security, service discovery, internet protocol operability.

  32. Conclusion • Classification Table-driven & On-demand • Provide several routing scheme • According Advantage & disadvantage to choose protocol and implement network • Many challenge need to be met

More Related