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
Multicast tree construction and flooding in wireless ad hoc networks
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
On the reduction of broadcast redundancy in mobile ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Improving route discovery in on-demand routing protocols using local topology information in MANETs
Proceedings of the ACM international workshop on Performance monitoring, measurement, and evaluation of heterogeneous wireless and wired networks
Hi-index | 0.00 |
Broadcast has been widely used in Mobile Ad Hoc Networks (MANETs) to disseminate information to all reachable nodes. However, the conventional broadcast scheme using simple flooding mechanism suffers from broadcast storm problem characterised by excessive amount of redundant traffic, exaggerated interference/contention between neighbouring nodes, and limited coverage. In this paper, we propose Probabilistic Counter Based Broadcast Protocol (PCBP) to alleviate broadcast storm problem in ad hoc networks. Compared with omni-directional scheme, PCBP uses minimum number of forward nodes to relay the broadcast packet. The proposed scheme is implemented in ns2 and the performances are compared against the conventional broadcast scheme.