A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks

Flooding is one of the most fundamental operations in mobile ad hoc networks. Traditional implementation of flooding suffers from the problems of excessive redundancy of messages, resource contention, and signal collision. This causes high protocol overhead and interference with the existing traffic in the networks. Some efficient flooding algorithms were proposed to avoid these problems. However, these algorithms either perform poorly in reducing redundant transmissions or require each node to maintain 2-hop (or more) neighbors information. In the paper, we study the sufficient and necessary condition of 100 percent deliverability for flooding schemes that are based on only 1-hop neighbors information. We further propose an efficient flooding algorithm that achieves the local optimality in two senses: 1) the number of forwarding nodes in each step is minimal and 2) the time complexity for computing forwarding nodes is the lowest, which is O(nlogn), where n is the number of neighbors of a node. Extensive simulations have been conducted and simulation results have shown the excellent performance of our algorithm

[1]  Hai Liu,et al.  Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks , 2004, IEEE Trans. Mob. Comput..

[2]  Zygmunt J. Haas,et al.  The zone routing protocol (zrp) for ad hoc networks" intemet draft , 2002 .

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

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

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

[6]  André Schiper,et al.  Probabilistic broadcast for flooding in wireless mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[7]  Vaduvur Bharghavan,et al.  Enhancing ad hoc routing with dynamic virtual infrastructures , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[8]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[9]  Junmo Yang,et al.  Location aided broadcast in wireless ad hoc networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[10]  Rajiv Gandhi,et al.  Minimizing broadcast latency and redundancy in ad hoc networks , 2003, MobiHoc '03.

[11]  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).

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

[13]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[14]  Andrzej Pelc,et al.  Deterministic broadcasting time in radio networks of unknown topology , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[15]  Ivan Marsic,et al.  An efficient distributed network-wide broadcast algorithm for mobile ad hoc networks , 2000 .

[16]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[17]  Kien A. Hua,et al.  Leveraging 1-hop neighborhood knowledge for efficient flooding in wireless ad hoc networks , 2005, PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005..

[18]  Anthony Ephremides,et al.  On the construction of energy-efficient broadcast and multicast trees in wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[19]  Koen Langendoen,et al.  Distributed localization in wireless sensor networks: a quantitative compariso , 2003, Comput. Networks.

[20]  Chong-kwon Kim,et al.  Multicast tree construction and flooding in wireless ad hoc networks , 2000, MSWIM '00.

[21]  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.

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

[23]  Jie Wu,et al.  Broadcasting in Ad Hoc Networks Based on Self-Pruning , 2003, Int. J. Found. Comput. Sci..

[24]  Jie Wu,et al.  A generic broadcast protocol in ad hoc networks based on self-pruning , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[25]  Yu-Chee Tseng,et al.  Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[26]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[27]  Dave Maltz,et al.  A Simple Protocol for Multicast and Broadcast in Mobile Ad Hoc Networks , 2001 .

[28]  Jie Wu,et al.  Double-covered broadcast (DCB): a simple reliable broadcast algorithm in MANETs , 2004, IEEE INFOCOM 2004.

[29]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2001, MobiCom '01.

[30]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[31]  Gene Tsudik,et al.  Flooding for Reliable Multicast in Multi-Hop Ad Hoc Networks , 1999, DIALM '99.