Routing Protocols for Mobile Ad Hoc Network

• Published in: Wireless Networking and Mobile Data Management pp. 179 - 215
• Main Author: Ghosh, R. K
• Format: Book Chapter
• Language: English
• Published: Singapore Springer Singapore Pte. Limited 2017; Springer Singapore
• Subjects: Dynamic Source Route; Mobile Host; Multicast Group; Multicast Tree; Network hardware; Route Discovery
• ISBN: 9811039402; 9789811039409
• DOI: 10.1007/978-981-10-3941-6_7

Routing in mobile ad hoc network was a subject of intense research during early 1990s to mid 2000. Ad hoc networks are relevant in research even today due to applications involving vehicle to vehicle communication and embedded processing involving IoTs. Routing in any network can be viewed abstractly as finding and maintaining shortest-path between communicating pairs of nodes in a weighted graph. Each node maintains a preferred neighbor, which is the next hop on the path to reach a destination. Two different classes of routing algorithms have been proposed in the literature, namely, proactive and reactive. In a proactive algorithm, each node maintains updated list of destinations and periodically advertises routing table to all the neighbors. This class of algorithms suffer from slow convergence. Reactive or on-demand routing algorithm, on the other hand, initiate a route discovery when a node does not have a fresh enough route to a destination it requires to reach. Flooding of route request queries can lead to congestion in network. The other problem is high latency in route discovery. In this chapter, we examine four selected and interesting variations of the routing schemes, viz., DSDV, DSR, AODV and ZRP. DSDV is a proactive algorithm and one of the earliest work in the area. DSR is a reactive routing protocol based on source initiated routing. AODV is again a reactive protocol, but it incorporates both unicast and multicast in a single protocol. ZRP is a zone based hybrid routing scheme. The scope of proactive scheme is restricted to a local neighborhood of each node called its zone. A route to a distant node is determined by querying a subset of nodes in the network.