A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
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
Broadcast reception rates and effects of priority access in 802.11-based vehicular ad-hoc networks
Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
Efficient coordination and transmission of data for cooperative vehicular safety applications
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
Latency and player actions in online games
Communications of the ACM - Entertainment networking
Analysis of multi-hop emergency message propagation in vehicular ad hoc networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Interactivity-loss avoidance in event delivery synchronization for mirrored game architectures
IEEE Transactions on Multimedia
A preliminary evaluation of backup servers for longer gaming sessions in MANETs
Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques
An intervehicular communication architecture for safety and entertainment
IEEE Transactions on Intelligent Transportation Systems
Stimulating cooperation in multi-hop wireless networks using cheating detection system
INFOCOM'10 Proceedings of the 29th conference on Information communications
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Hi-index | 0.00 |
We present a distributed algorithm to fast multi-hop message propagation for ad hoc vehicular networks (VANET). Our protocol obtains optimal performances in challenging scenarios which are likely in real situations, but that have been not extensively studied in the literature as they are complex to be tackled. In particular, the Farther Relay and Oracle for VANET (FROV) deals with asymmetric communications and varying transmission ranges. Even in this case, FROV broadcast any application message with the minimal number of hops. Moreover, FROV is both scalable with respect to the number of participating vehicles, and tolerant to faults and changes of membership of the platoon, vehicles that leave or join it. At the current state of development, our protocol is optimal in the case of unidimensional roads and we are studying its extension to a web of urban roads. This paper presents the preliminary results of simulations carried out to verify the main characteristics of FROV.