Performance analysis of CSMA and BTMA protocols in multihop networks: (I). Single channel case
Information Sciences—Informatics and Computer Science: An International Journal
Efficient flooding with Passive Clustering (PC) in ad hoc networks
ACM SIGCOMM Computer Communication Review
Flooding in wireless ad hoc networks
Computer Communications
Constant-Width Zones Broadcast Algorithm in Mobile Ad-Hoc Networks
NBiS '08 Proceedings of the 2nd international conference on Network-Based Information Systems
DibA: An Adaptive Broadcasting Scheme in Mobile Ad Hoc Networks
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
A probability-based adaptive scheme for broadcasting in MANETs
Mobility '09 Proceedings of the 6th International Conference on Mobile Technology, Application & Systems
An upper bound on the performance of non-repetitive flooding over CSMA in wireless ad-hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Formal verification and simulation for performance analysis for probabilistic broadcast protocols
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Performance improvements for network-wide broadcast with instantaneous network information
Journal of Network and Computer Applications
A Novel Dynamic Noise-Dependent Probabilistic Algorithm for Route Discovery in MANETs
International Journal of Business Data Communications and Networking
Hi-index | 0.24 |
One feature common to most existing routing protocols for wireless mobile ad hoc networks, or MANETs, is the need to flood control messages network-wide during the route acquisition and maintenance process. Flooding of control messages may result in redundant broadcasts and cause serious contention and collision problems in MANETs. In this paper, we develop an analytical model to study the performance of plain- and probabilistic flooding in terms of its reliability and reachability in delivering packets. Reliability is a measure of the total number of packets received by network nodes whereas reachability refers to the total number of unique nodes reached by the flooding process. We also provide simulation results to validate the model.