An Efficient Heuristic Gossiping Mechanism in Ad Hoc Routing

Many ad hoc routing protocols are based on some variant of flooding. Despite various optimizations, many routing messages are propagated unnecessarily. In this paper, we propose a heuristic gossiping-based approach, where each node forwards a message with some probability according to the residual energy of a node, its velocity, and the information from its neighbor, to reduce the overhead of the routing protocols. In the network topology we have considered, this simple heuristic gossiping-based protocol reduces routing load by 48% compared with conventional flooding, and with other performances improved meanwhile. Our gossiping mechanism can also be combined with various optimizations of flooding to yield further benefits. Simulations show that adding heuristic gossiping mechanism to DSR results in significant performance improvements.

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

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

[3]  Anis Laouiti,et al.  Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks , 2000 .

[4]  Andrew T. Campbell,et al.  HMP: hotspot mitigation protocol for mobile ad hoc networks , 2003, IWQoS'03.

[5]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[6]  Anis Laouiti,et al.  Multipoint relaying for flooding broadcast messages in mobile wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[7]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[8]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[9]  Wei Peng,et al.  On the reduction of broadcast redundancy in mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[10]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[11]  Ion I. Mandoiu,et al.  Selecting Forwarding Neighbors in Wireless Ad Hoc Networks , 2001, DIALM '01.

[12]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, IEEE/ACM Transactions on Networking.