TY - GEN
T1 - Adaptation of topology-based routing protocols for data gathering applications in VANETs
AU - Pacheco-Paramo, Diego
AU - Iannone, Luigi
AU - Kofman, Daniel
AU - Viana, Aline C.
AU - Mermoud, Gregory
AU - Vasseur, Jean Philippe
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2016/1/18
Y1 - 2016/1/18
N2 - The use of VANETs for data gathering applications imply that vehicles are not only able to generate data but also to forward it from others towards an access point (AP). Given the mobility characteristics of vehicles and the difficult propagation conditions of urban scenarios, it is commonly stated that topology-based routing solutions are less efficient than geographic-based routing solutions. However, these statements refer to generic vehicular communications, ignoring specific characteristics of data gathering scenarios. In this work, two existing routing protocols that prior to forwarding data, set a path from each vehicle towards the AP are adapted for data gathering applications. While the existence of a path reduces the number of ineffective retransmissions and the delay, it also increases the overhead, and therefore the presented protocols were adapted to improve the overall performance. Aiming to correctly evaluate the routing protocols, simulations are launched using a realistic trace from the city of Cologne. The results obtained show that it is possible to limit the overhead associated to topology updates, outperforming geographic-based solutions.
AB - The use of VANETs for data gathering applications imply that vehicles are not only able to generate data but also to forward it from others towards an access point (AP). Given the mobility characteristics of vehicles and the difficult propagation conditions of urban scenarios, it is commonly stated that topology-based routing solutions are less efficient than geographic-based routing solutions. However, these statements refer to generic vehicular communications, ignoring specific characteristics of data gathering scenarios. In this work, two existing routing protocols that prior to forwarding data, set a path from each vehicle towards the AP are adapted for data gathering applications. While the existence of a path reduces the number of ineffective retransmissions and the delay, it also increases the overhead, and therefore the presented protocols were adapted to improve the overall performance. Aiming to correctly evaluate the routing protocols, simulations are launched using a realistic trace from the city of Cologne. The results obtained show that it is possible to limit the overhead associated to topology updates, outperforming geographic-based solutions.
KW - Delays
KW - Routing
KW - Routing protocols
KW - Topology
KW - Vehicles
KW - Wireless sensor networks
UR - https://www.scopus.com/pages/publications/84962033030
U2 - 10.1109/VNC.2015.7385578
DO - 10.1109/VNC.2015.7385578
M3 - Conference contribution
AN - SCOPUS:84962033030
T3 - IEEE Vehicular Networking Conference, VNC
SP - 204
EP - 211
BT - 2015 IEEE Vehicular Networking Conference, VNC 2015
A2 - Altintas, Onur
A2 - Kargl, Frank
A2 - Ekici, Eylem
A2 - Sommer, Christoph
A2 - Segata, Michele
PB - IEEE Computer Society
T2 - IEEE Vehicular Networking Conference, VNC 2015
Y2 - 16 December 2015 through 18 December 2015
ER -