A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Scalable routing protocol for ad hoc networks
Wireless Networks
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
DTLSR: delay tolerant routing for developing regions
Proceedings of the 2007 workshop on Networked systems for developing regions
An intervehicular communication architecture for safety and entertainment
IEEE Transactions on Intelligent Transportation Systems
Spatial and traffic-aware routing (STAR) for vehicular systems
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
On the impact of a road-side infrastructure for a DTN deployed on a public transportation system
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Social-aware delay tolerant networking for mobile-to-mobile file sharing
International Journal of Communication Systems
| Hi-index | 0.00 |
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.