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
Revisiting the TTL-based controlled flooding search: optimality and randomization
Proceedings of the 10th annual international conference on Mobile computing and networking
IEEE/ACM Transactions on Networking (TON)
Flooding strategy for target discovery in wireless networks
Wireless Networks
Context-aware broadcasting approaches in mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Enhanced blocking expanding ring search in mobile ad hoc networks
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Multi-hop Routing for Wireless Network in Underground Mines
APWCS '10 Proceedings of the 2010 Asia-Pacific Conference on Wearable Computing Systems
On Optimising Route Discovery for Multi-interface and Power-Aware Nodes in Heterogeneous MANETs
ICWMC '10 Proceedings of the 2010 6th International Conference on Wireless and Mobile Communications
Survey Paper: Routing protocols in ad hoc networks: A survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Broadcast is a communication primitive building block widely used in mobile ad-hoc networks (MANETs) for the exchange of control packets and resource location for upper level services such as routing and management protocols. Flooding is the most simple broadcast algorithm, but it wastes a lot of energy and bandwidth, as flooding leads to many redundant radio transmissions. An optimization to flooding is to contain it, once the resource has been found. In this paper, we compare the impact on the latency and power consumption of four competing approaches for flooding containment. The results show that stopping ongoing broadcasts can achieve promising performance increases over other flooding base techniques, when applied in large scale MANETs with scarce power resources. In addition, results show that both network topology and the number of copies of the resource influence differently the performance of each searching approach.