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
Query localization techniques for on-demand routing protocols in ad hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
The performance of query control schemes for the zone routing protocol
IEEE/ACM Transactions on Networking (TON)
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Dynamic probabilistic broadcasting in MANETs
Journal of Parallel and Distributed Computing
On the Performance of Probabilistic Flooding in Mobile Ad Hoc Networks
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Intelligent broadcasting inmobile ad hoc networks: three classes of adaptive protocols
EURASIP Journal on Wireless Communications and Networking
Adjusted probabilistic route discovery in mobile ad hoc networks
Computers and Electrical Engineering
Improving discovery phase of reactive ad hoc routing protocols using Jaccard distance
The Journal of Supercomputing
Routing with a density-based probabilistic algorithm for mobile ad-hoc networks
Journal of High Speed Networks
Hi-index | 0.00 |
Broadcast is a fundamental operation used in Mobile Ad hoc NETworks (MANETs) for many services, such as route discovery and sending information messages. The direct method to perform broadcast is a simple flooding, which can decrease the performance of MANET. Recently, a probabilistic approach to flooding has been proposed as one of most important suggested solutions to solve the broadcast storm problem, which leads to the collision, contention and duplicated messages. This paper presents the Smart Probabilistic Broadcasting (SPB) as a new probabilistic method to improve the performance of existing on-demand routing protocols by reducing the RREQ overhead during the rout discovery operation. The simulation results show that the combination of AODV and a suitable probabilistic rout discovery can reduce the average end-to-end delay as well as overhead, while achieving low normalized routing load, compared to AODV that uses fixed probability and blind flooding. Simulation experiments have been conducted to examine our proposed scheme. The results show that SPB outperforms its counterparts and opens up a promising framework towards optimal probabilistic broadcasting.