Displacement-based Route Update Strategies for Proactive Routing Protocols in Mobile Ad Hoc Networks

This paper presents a new route update strategy for performing proactive route discovery in Mobile Ad hoc Networks (MANETs). In this strategy, the rate at which route updates are sent into the network is controlled by how often a node changes its location by a required distance. We refer to this updating strategy as Minimum Displacement Update Routing (MDUR). We imple- mented MDUR on top of the Fisheye State Routing (FSR) protocol and investigated its performance by simulation. The simulations where performed in a number of different scenarios, with varied network mobility, density, traffic and boundary. Our results in- dicate that MDUR has lower levels of control overhead than FSR and achieves higher levels of throughput as the density and the level of traffic in the network is increased. I. INTRODUCTION Mobile Ad Hoc Networks (MANETs), are made up of a number of nodes, which are capable of performing routing without using a dedicated centralised controller or a base sta- tion. This key feature of these networks enable them to be em- ployed in places where an infrastructure is not available, such as in disaster relief and on battle grounds. However, the dy- namic nature of these networks and the scarcity of bandwidth in the wireless medium, along with the limited power in mo- bile devices (such as PDA's or laptops) makes routing in these networks a challenging task. A Routing protocols designed for MANETs must work consistently as the size and the density of the network varies and efficiently use the network resources to provide each user with the required levels of quality of service for different types of applications used. With so many variables to consider in order to design an efficient routing protocol for MANETs, a number of differ- ent types of routing strategies have been proposed by various authors. These protocols can be classified into three groups; global/proactive, on-demand/reactive and hybrid. Most proac- tive routing protocols are based on the link state and distance vector algorithms. In these protocols, each node maintains up- to-date routing information to every other node in the network by periodically exchanging distance vector or link state infor- mation using different updating strategies (discussed in the fol- lowing section). In on-demand routing protocols each node only maintains active routes. That is, when a node requires a route to a par- ticular destination, a route discovery is initiated. The route de- termined in the route discovery phase is maintained while the route is still active (i.e. the source has data to send to the desti- nation). The advantage of on-demand protocols is that they re- duce the amount of bandwidth usage and redundancy by deter- mining and maintaining routes when they are required. These

[1]  Ivan Stojmenovic,et al.  Position-based routing in ad hoc networks , 2002, IEEE Commun. Mag..

[2]  Suresh Singh,et al.  Scalable Routing Protocol for Ad Hoc Networks , 2001, Wirel. Networks.

[3]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[4]  J. J. Garcia-Luna-Aceves,et al.  Source-tree routing in wireless networks , 1999, Proceedings. Seventh International Conference on Network Protocols.

[5]  Mario Joa-Ng,et al.  A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[6]  Mario Gerla,et al.  Fisheye State Routing Protocol (FSR) for Ad Hoc Networks , 2002 .

[7]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[8]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[9]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[10]  Xiaoyan Hong,et al.  A wireless hierarchical routing protocol with group mobility , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[11]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[12]  J. J. Garcia-Luna-Aceves,et al.  A routing protocol for packet radio networks , 1995, MobiCom '95.

[13]  Atsushi Iwata,et al.  Scalable routing strategies for ad hoc wireless networks , 1999, IEEE J. Sel. Areas Commun..

[14]  Eryk Dutkiewicz,et al.  Scalable routing strategy for dynamic zones-based MANETs , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[15]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[16]  Chai-Keong Toh,et al.  A novel distributed routing protocol to support ad-hoc mobile computing , 1996, Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference on Computers and Communications.