Flooding for reliable multicast in multi-hop ad hoc networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
SAINT '05 Proceedings of the The 2005 Symposium on Applications and the Internet
Geometric Broadcast Protocol for Sensor and Actor Networks
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Energy Balanced Broadcasting Through Delayed Intelligence
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02
A Bandwidth-Efficient Broadcasting Protocol for Mobile Multi-hop Ad hoc Networks
ICNICONSMCL '06 Proceedings of the International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.01 |
In a broadcasting task, a source sends a message to all the nodes of a network. There exist methods for flooding a network intelligently and for scheduling node activities. Dominating sets and neighbor elimination based broadcasting is currently the most efficient broadcasting scheme in terms of the number of retransmitted messages to complete a broadcast. It provides basis for defining other broadcasting protocols by changing the definition of the delay (timeout) function used to decide how long a dominating node should wait before making a retransmission. In this article, we propose thirteen such variants. They are all reliable, meaning that all the nodes connected to a source will receive the message, assuming an ideal MAC layer. Eight of them are hexagonal based; four are distance-based, giving priority to the neighbors that are further or nearer from the retransmitting node; and one is using a random timeout. Beyond these variants, we propose three different ways to update the timeout values during a broadcasting process. Our experimental data shows that the updating process of the timeout values has no significant impact compared to the selected timeout function. From the thirteen variants we deliberately proposed some worst-case timeout functions to see its impact in the broadcasting process. We confirm by our experimental data that indeed the selected timeout function has an impact in the broadcasting process. Although our experimental data shows that the new further distance-based scheme outperforms almost all schemes in terms of number of messages to complete a broadcast, it also shows that a random function (the way IEEE 802.11 works) is a very good choice.