The specific features of inter-vehicular communications are allowing the deployment of a broad gamut of possible applications including traffic control, road safety and in-car entertainment. At the basis of all this lies the improvement of VANET-based transmission techniques that are becoming technologically mature. Within this context, in this paper we provide an experimental comparison between two of the most effectual algorithms whose aim is that of quickly broadcasting messages throughout a given platoon of vehicles. The most prominent characteristic of both the algorithms under investigation is that they were designed for wireless vehicle-to-vehicle (V2V) communications, with in mind only realistic transmission conditions (that is, asymmetric and variable vehicles' transmission ranges). Even if both algorithms were conceived based on the idea to span application messages as far as possible, while minimizing the number of relaying vehicles, our extensive analysis demonstrates that one of the two outperforms the other.

A Simulative Evaluation of V2V Algorithms for Road Safety and In-Car Entertainment

AMOROSO, ALESSANDRO;MARFIA, GUSTAVO;ROCCETTI, MARCO;
2011

Abstract

The specific features of inter-vehicular communications are allowing the deployment of a broad gamut of possible applications including traffic control, road safety and in-car entertainment. At the basis of all this lies the improvement of VANET-based transmission techniques that are becoming technologically mature. Within this context, in this paper we provide an experimental comparison between two of the most effectual algorithms whose aim is that of quickly broadcasting messages throughout a given platoon of vehicles. The most prominent characteristic of both the algorithms under investigation is that they were designed for wireless vehicle-to-vehicle (V2V) communications, with in mind only realistic transmission conditions (that is, asymmetric and variable vehicles' transmission ranges). Even if both algorithms were conceived based on the idea to span application messages as far as possible, while minimizing the number of relaying vehicles, our extensive analysis demonstrates that one of the two outperforms the other.
Proceedings of 20th IEEE International Conference on Computer Communications and Networks (ICCCN 2011) - 7th IEEE Workshop on Networking Issues in Multimedia Entertainment (NIME 2011)
1
5
A. Amoroso; G. Marfia; M. Roccetti; Claudio E. Palazzi
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11585/102351
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 0
social impact