The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
RAPID: Reliable Probabilistic Dissemination in Wireless Ad-Hoc Networks
SRDS '07 Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems
PAMPA in the wild: a real-life evaluation of a lightweight ad-hoc broadcasting family
Proceedings of the 7th International Workshop on Middleware Tools, Services and Run-Time Support for Sensor Networks
| Hi-index | 0.00 |
Broadcast algorithms are a fundamental building block of a number of ad-hoc protocols and mobile applications. Broadcast primitives in ad-hoc wireless networks should ideally be lightweight and use passive data to determine whether to retransmit a message. They must also deliver messages with a high probability while tolerating adverse network conditions. This paper looks at the particular problem of heterogeneous topologies, in which some regions of an ad-hoc network are critical to the propagation of messages. Traditional broadcast protocols do not perform well in these topologies, while others require complex data structures, some form of training or convergence, or some active route discovery and maintenance. To alleviate these limitations, this paper explores three new lightweight mechanisms that use passive retransmission data to try to recognise a node's importance within a wireless network. By combining these three mechanisms, we construct a family of protocols based on the previously published PAMPA algorithm. Our preliminary evaluation shows that one of these variants is particularly promising, presenting higher delivery ratios in adverse conditions for a small communication overhead.