Literature Database Entry


Victor Sandonis, Ignacio Soto, Maria Calderon and Manuel Urueña, "Vehicle to Internet communications using the ETSI ITS GeoNetworking protocol," Transactions on Emerging Telecommunications Technologies, vol. 27 (3), October 2014.


Vehicular ad hoc networks allow the exchange of information between vehicles to improve road safety. In addition, vehicles can be connected to the Internet through gateways placed alongside the roads, which allow drivers to use common Internet services and architecture, new applications specifically oriented to them. The European Telecommunications Standards Institute Technical Committee Intelligent Transport System has standardised the and the communication protocols for an Intelligent Transport System, considering both safety applications and Internet, communications with the Internet. The GeoNetworking (GN) protocol has been designed to forward packets inside the vehicular ad hoc network taking safety requirements as the main concern. This paper analyses the GN protocol focusing on the provision of Internet connectivity to vehicles. The main contributions of this work are the identification of sources of performance losses when using the GN protocol in communications with the and protocol, the proposal of different mechanisms to improve its performance in this type of communications. The evaluation of the GN and the proposed improvements is conducted by means of extensive simulations.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


Victor Sandonis
Ignacio Soto
Maria Calderon
Manuel Urueña

BibTeX reference

    author = {Sandonis, Victor and Soto, Ignacio and Calderon, Maria and Urue{\~{n}}a, Manuel},
    doi = {10.1002/ett.2895},
    issn = {2161-3915},
    journal = {Transactions on Emerging Telecommunications Technologies},
    month = {10},
    number = {3},
    publisher = {John Wiley \& Sons},
    title = {{Vehicle to Internet communications using the ETSI ITS GeoNetworking protocol}},
    volume = {27},
    year = {2014},

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.