The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Dynamic probabilistic broadcasting in MANETs
Journal of Parallel and Distributed Computing
IEEE/ACM Transactions on Networking (TON)
Parametric probabilistic routing in sensor networks
Mobile Networks and Applications
Improving Probabilistic Route Discovery in Mobile Ad Hoc Networks
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
coverage-based dynamically adjusted probabilistic forwarding for wireless mobile ad hoc networks
Proceedings of the 1st ACM international workshop on Heterogeneous sensor and actor networks
Modeling the performance of flooding in wireless multi-hop Ad hoc networks
Computer Communications
| Hi-index | 0.00 |
In mobile ad hoc networks MANETs, broadcasting is widely used in route discovery and other network services. The most widely used broadcasting algorithm is simple flooding, which aggravates a high number of redundant packet retransmissions, causing contention and collisions. Proper use of dynamic probabilistic algorithm significantly reduces the number of retransmissions, which reduces the chance of contention and collisions. In current dynamic probabilistic algorithm, the retransmission probability pt is formulated as a linear/non-linear function of a single variable, the number of first-hop neighbors k. However, such algorithm is suffers in the presence of noise due to increasing packet-loss. In this paper, the authors propose a new dynamic probabilistic algorithm in which pt is determined locally by the retransmitting nodes considering both k and the noise-level. This algorithm is referred to as the dynamic noise-dependent probabilistic DNDP algorithm. The performance of the DNDP algorithm is evaluated through simulations using the MANET simulator MANSim. The simulation results show that the DNDP algorithm presents higher network reachability than the dynamic probabilistic algorithm at a reasonable increase in the number of retransmissions for a wide range of noise-level. The effects of nodes densities and nodes speeds on the performance of the DNDP algorithm are also investigated.