Dynamic probabilistic broadcasting in mobile ad hoc networks

In mobile ad hoc networks (MANET), broadcasting is extensively used in route discovery, address resolution, and many other network services. The efficiency of broadcasting protocol can dramatically affect the performance of the entire network. Proper use of probabilistic method can reduce the number of rebroadcasting, therefore reduce the chance of contention and collision among neighboring nodes. A good probabilistic broadcast protocol can achieve high throughput and low energy consumption without suffering significant reachability degradation. In this paper, we propose a dynamic probabilistic approach and compare it with simple flooding and fixed probabilistic scheme. Our approach dynamically adjusts the rebroadcasting probability according to the node distribution and movement in the ad hoc network. The adaptation is based on locally available information without the assistance of location or distance measuring devices. Simulation results show our approach perform better than both simple flooding and fixed probabilistic schemes.

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

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

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

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

[5]  Jerzy Kocinski Phase transition phenomena , 1983 .

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

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

[8]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[9]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[10]  S. Redner,et al.  Introduction To Percolation Theory , 2018 .

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

[12]  Stephen B. Wicker,et al.  Phase transition phenomena in wireless ad hoc networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[13]  Kenneth P. Birman,et al.  A randomized error recovery algorithm for reliable multicast , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Jie Wu,et al.  A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks , 2001, Telecommun. Syst..

[15]  J. Spencer Ten lectures on the probabilistic method , 1987 .

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

[17]  Nj Piscataway,et al.  Wireless LAN medium access control (MAC) and physical layer (PHY) specifications , 1996 .

[18]  André Schumacher Dominating Set Based Routing , 2003 .

[19]  Dharma P. Agrawal,et al.  Introduction to Wireless and Mobile Systems , 2002 .