Spatio-Temporal Routing in Episodically Connected Vehicular Networks

Authors

  • Luis R. Gallego Tercero Instituto Politécnico Nacional, Centro de Investigación en Computación
  • Rolando Menchaca Mendez Instituto Politécnico Nacional, Centro de Investigación en Computación
  • Mario E. Rivero Angeles Instituto Politécnico Nacional, Centro de Investigación en Computación

DOI:

https://doi.org/10.13053/cys-24-4-3467

Keywords:

Routing, VANET, DTN, time-stable Geocast, smart city, intelligent transportation system

Abstract

The spatio-temporal routing in episodically connected vehicular networks es a communication pattern where the destination nodes is a set of vehicles that transit the destination region during the specified destination region. The spatio-temporal routing is well suited to support Smart City and Intelligent Transportation Systems applications (i.e. road safety, crowdsensing, entertainment). In this paper, we present Oportunistic Greedy Routing over Street-layout Graph (OGRoSG), a novel spatio-temporal routing protocol for episodically connected vehicular networks. Unlike previous works in the literature, OGRoSG takes advantage of information available in modern navigation systems, such as the streets map and the geographic position. The protocol performs greedy geographic routing, the notion of being closer to the destinationare a is based on the progress towards the destination region on the streets-map graph and the direction of the vehicles. In order to achieve this, the vehicles process the destination region and the street graph to generate a shortest-paths tree with an extended destination regionas root. This extended destination region guarantees that it covers the entire destination region and the paths that interconnect it. We evaluate the performance of the OGRoSG protocol using simulations in NS-3,using mobility traces generated in a map based in the city of Murcia, Spain. Our results show that OGRoSG outperforms a set of Spatio-Temporal variants of the Epidemic, Spray & Wait and Binary Spray & Wait routing protocols in terms of delivery ratio and overhead induced in the network.

Downloads

Published

2020-12-02

Issue

Vol. 24 No. 4 (2020): 24(4)2020

Section

Articles

License 

Hereby I transfer exclusively to the Journal "Computación y 
Sistemas", published by the Computing Research Center (CIC-IPN),
the Copyright of the aforementioned paper. I also accept that these 
rights will not be transferred to any other publication, in any other 
format, language or other existing means of developing.
I certify that the paper has not been previously disclosed or simultaneo
usly submitted to any other publication, and that it does not contain 
material whose publication would violate the Copyright or other 
proprietary rights of any person, company or institution. I certify that 
I have the permission from the institution or company where I work or 
study to publish this work.
The representative author accepts the responsibility for the publication
of this paper on behalf of each and every one of the authors. 
This transfer is subject to the following conditions:
  • The authors retain all ownership rights (such as patent rights) of this work, except for the publishing rights transferred to the CIC, through this document.
  • Authors retain the right to publish the work in whole or in part in any book they are the authors or publishers. They can also make use of this work in conferences, courses, personal web pages, and so on.
  • Authors may include working as part of his thesis, for non-profit distribution only.