How Do You Quickly Choreograph Inter-Vehicular Communications? A Fast Vehicle-to-Vehicle Multi-Hop Broadcast Algorithm, Explained
- 1 January 2007
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2007 4th IEEE Consumer Communications and Networking Conference
- p. 960-964
- https://doi.org/10.1109/ccnc.2007.194
Abstract
As the technology available on cars is increasing, a wide range of applications, from safety to entertainment, are becoming factually accessible to passengers. Many of these applications involves a one-to-many transmission model where a single car broadcasts a message that has to be forwarded, even with multiple hops, in a very short time to all the other cars located within a range of few kilometers from the source. Since the high mobility and density of a car network scenario, specific solutions need to be devised to choreograph a fast-delivery multi- hop broadcast. To this aim, we developed a practical and efficient technique that allows cars to estimate their communication range with the help of a very limited message exchange and exploit this information to reduce the number of transmissions, as well as the hops to be traversed, and hence the time, required by a broadcasted message to reach all the cars following the sender within a certain distance.Keywords
This publication has 5 references indexed in Scilit:
- Interactivity-loss avoidance in event delivery synchronization for mirrored game architecturesIEEE Transactions on Multimedia, 2006
- Vehicle-to-vehicle wireless communication protocols for enhancing highway traffic safetyIEEE Communications Magazine, 2006
- Co-operative Downloading in Vehicular Ad-Hoc Wireless NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A vehicle-to-vehicle communication protocol for cooperative collision warningPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- On the impact of delay on real-time multiplayer gamesPublished by Association for Computing Machinery (ACM) ,2002