In this last two years an increasing number of scientists has devoted his attention to Vehicular Ad hoc NETworks (VANETs) as a special case of the more generic Mobile Ad hoc NETworks (MANETs). A public transportation network used as a VANET backbone may be a viable solution - under certain circumstances - also thanks to its almost-complete area coverage and the pre-scheduled repetitive paths. The aim of this paper is to compare performances of distance vector (DV) routing strategies when applied to a VANET moving as for a real city topology. Our two main contributions are: firstly, to compare results with similar - more canonical - experiments using a grid, and secondly, to outline differences between various DV metrics. By means of simulations we demonstrate that, in the considered network scenario, a distance vector-based routing algorithm can perform well and more complex - and resources hungry - protocols are no longer strictly needed. Moreover, simulations based on a grid topology reproduce the behavior of a real city in a limited way.

Distance vector routing for public transportation vehicular networks: Performance evaluation on a real topology / S. Gaito, D. Maggiorini, E. Pagani, G.P. Rossi - In: Proceedings 2nd IFIP Wireless Days ConferencePiscataway, NJ, Usa : IEEE Computer Society, 2009. - ISBN 9781424456604. - pp. 1-5 (( Intervento presentato al 2nd. convegno IFIP Wireless Days COnference tenutosi a Paris (France) nel 2009 [10.1109/WD.2009.5449652].

Distance vector routing for public transportation vehicular networks: Performance evaluation on a real topology

S. Gaito
Primo
;
D. Maggiorini
Secondo
;
E. Pagani
Penultimo
;
G.P. Rossi
Ultimo
2009

Abstract

In this last two years an increasing number of scientists has devoted his attention to Vehicular Ad hoc NETworks (VANETs) as a special case of the more generic Mobile Ad hoc NETworks (MANETs). A public transportation network used as a VANET backbone may be a viable solution - under certain circumstances - also thanks to its almost-complete area coverage and the pre-scheduled repetitive paths. The aim of this paper is to compare performances of distance vector (DV) routing strategies when applied to a VANET moving as for a real city topology. Our two main contributions are: firstly, to compare results with similar - more canonical - experiments using a grid, and secondly, to outline differences between various DV metrics. By means of simulations we demonstrate that, in the considered network scenario, a distance vector-based routing algorithm can perform well and more complex - and resources hungry - protocols are no longer strictly needed. Moreover, simulations based on a grid topology reproduce the behavior of a real city in a limited way.
Ad hoc networks; Delay tolerant networks; Distance vector; Routing protocols; Vehicular networks
Settore INF/01 - Informatica
2009
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5449652
Book Part (author)
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

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: https://hdl.handle.net/2434/142439
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 10
  • ???jsp.display-item.citation.isi??? ND
social impact