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
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Dynamic probabilistic broadcasting in MANETs
Journal of Parallel and Distributed Computing
Intelligent broadcasting inmobile ad hoc networks: three classes of adaptive protocols
EURASIP Journal on Wireless Communications and Networking
Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network
IEEE Transactions on Computers
Probabilistic counter-based route discovery for mobile ad hoc networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Realizing and benchmarking broadcast algorithms in wireless mesh networks
Computer Communications
RNBB: a reliable hybrid broadcasting algorithm for ad-hoc networks
WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
Condensation-based routing in mobile ad-hoc networks
Mobile Information Systems - Advances in Network-Based Information Systems
Hi-index | 0.00 |
In mobile ad hoc networks (MANETs), broadcasting plays a fundamental role, diffusing a message from a given source node to all the other nodes in the network. Flooding is the simplest and commonly used mechanism for broadcasting in MANETs, where each node retransmits every uniquely received message exactly once. Despite its simplicity, it however generates redundant rebroadcast messages which results in high contention and collision in the network, a phenomenon referred to as broadcast storm problem. Pure probabilistic approaches have been proposed to mitigate this problem inherent with flooding, where mobile nodes rebroadcast a message with a probability p which can be fixed or computed based on the local density. However, these approaches reduce the number of rebroadcasts at the expense of reachability. On the other hand, counter-based approaches inhibit a node from broadcasting a packet based on the number of copies of the broadcast packet received by the node within a random access delay time. These schemes achieve better throughput and reachability, but suffer from relatively longer delay. In this paper, we propose an efficient broadcasting scheme that combines the advantages of pure probabilistic and counter-based schemes to yield a significant performance improvement. Simulation results reveal that the new scheme achieves superior performance in terms of saved-rebroadcast, reachability and latency.