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
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
Ad Hoc Wireless Networks: Protocols and Systems
Ad Hoc Wireless Networks: Protocols and Systems
Dynamic probabilistic broadcasting in MANETs
Journal of Parallel and Distributed Computing
Adjusted probabilistic route discovery in mobile ad hoc networks
Computers and Electrical Engineering
Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
A hybrid probabilistic counter-based broadcast approach protocol for Mobile Ad hoc Networks
International Journal of Ad Hoc and Ubiquitous Computing
Performance evaluation with different mobility models for dynamic probabilistic flooding in MANETs
Mobile Information Systems - Advances in Wireless Networks
Performance evaluation of dynamic probabilistic flooding using local density information in MANETs
NBiS'07 Proceedings of the 1st international conference on Network-based information systems
Stochastic broadcast for VANET
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Probabilistic flooding in stochastic networks: Analysis of global information outreach
Computer Networks: The International Journal of Computer and Telecommunications Networking
Neighborhood-Based Route Discovery Protocols for Mobile Ad Hoc Networks
International Journal of Mobile Computing and Multimedia Communications
Hi-index | 0.00 |
Most existing routing protocols proposed for MANETs use flooding as a broadcast technique for the propagation of network control packets; a particular example of this is the dissemination of route requests (RREQs), which facilitate route discovery. In flooding, each mobile node rebroadcasts received packets, which, in this manner, are propagated network-wide with considerable overhead. This paper improves on the performance of existing routing protocols by reducing the communication overhead incurred during the route discovery process by implementing a new broadcast algorithm called the adjusted probabilistic flooding on the Ad-Hoc on Demand Distance Vector (AODV) protocol. AODV [3] is a well-known and widely studied algorithm which has been shown over the past few years to maintain an overall lower routing overhead compared to traditional proactive schemes, even though it uses flooding to propagate RREQs. Our results, as presented in this paper, reveal that equipping AODV with fixed and adjusted probabilistic flooding, instead, helps reduce the overhead of the route discovery process whilst maintaining comparable performance levels in terms of saved rebroadcasts and reachability as achieved by conventional AODV\@. Moreover, the results indicate that the adjusted probabilistic technique results in better performance compared to the fixed one for both of these metrics