Selecting forwarding neighbors in wireless Ad Hoc networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
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
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
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Network
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Urban multi-hop broadcast protocol for inter-vehicle communication systems
Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
Flooding in wireless ad hoc networks
Computer Communications
| Hi-index | 0.00 |
Vehicular Ad Hoc Networks (VANETs) are emerging as the preferred network design for intelligent transportation systems and are envisioned to be useful in road safety and commercial applications. A significant issue in VANETs is the design of an effective broadcast scheme which can facilitate the fast and reliable dissemination of critical safety messages to neighbouring vehicles in case of an unexpected event, such as a traffic accident. Towards this goal, we propose a novel Speed Adaptive Probabilistic Flooding algorithm (SAPF). Its decision to rebroadcast a message is based on a probability, evaluated using the speed of the vehicle. The algorithm enjoys a number of benefits relative to other approaches: it is simple to implement and does not introduce additional communication burden as it requires local information only, it does not rely on the existence of a positioning system which may not always be available and above all, mitigates the effect of the broadcast storm problem, typical when utilizing blind flooding. Our results indicate that the proposed algorithm outperforms blind flooding, especially in cases of heavy congestion. The SAPF algorithm achieves high reachability and unlike blind flooding, it also maintains low latency as the density of vehicles in the road network increases.