Approaching Optimal Broadcast Efficiency in Multi-Hop Wireless Networks

It is an almost classical problem to develop an efficient broadcast mechanism in multi-hop networks. However, the problem is far from solved though a lot of research till recently has been focused on it. In this letter, we analyze the optimal distribution of forwarding nodes that can doubly cover the network with the minimum transmission overlapped area in a multi-hop wireless network where nodes are ideally distributed. On this basis we propose a simple and effective broadcast method to significantly increase the transmission efficiency and deliverability. In this method, the total number of retransmissions is quite low since each node only needs to select three forwarding nodes, and high deliverability can be achieved for the set of forwarding nodes provide nearly double coverage to the whole network. In addition, the method has excellent scalability in large scale networks and highly dynamic environment.

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

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

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

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

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

[6]  Torsten Braun,et al.  Optimized Stateless Broadcasting in Wireless Multi-Hop Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[7]  Hai Liu,et al.  A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks , 2007, IEEE Transactions on Parallel and Distributed Systems.

[8]  R. Kershner The Number of Circles Covering a Set , 1939 .

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