Controlling Route Discovery for Efficient Routing in Resource-Constrained Sensor Networks

Existing ad-hoc network routing strategies base their operations on flooding route requests throughout the network and choosing the shortest path thereafter. However, this typically results in a large number of unnecessary transmissions, which could be expensive for resource-constrained nodes such as those in a sensor network. In this paper, we propose a new mechanism HopAlert which optimizes route establishment and packet routing by limiting the number of nodes taking part in the route discovery process while achieving a low number of hops establishment. Using analysis and simulations, we show that this results in more routes with shorter hop counts than a reactive flooding protocol such as AODV while achieving higher savings.

[1]  Tracy Camp,et al.  Comparison of broadcasting techniques for mobile ad hoc networks , 2002, MobiHoc '02.

[2]  Jianfei Cai,et al.  Modeling Hop Length Distributions for Reactive Routing Protocols in One Dimensional MANETs , 2007, 2007 IEEE International Conference on Communications.

[3]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[4]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

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