MEDAL: a moving direction and destination location based routing algorithm for vehicular ad hoc networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

MEDAL: a moving direction and destination location based routing algorithm for vehicular ad hoc networks

(1) , (1) , (2) , (1)
1
2

Abstract

Routing is a critical issue in vehicular ad hoc networks (VANETs). This paper considers the routing issue in both vehicle to vehicle (V2V) and vehicle to infrastructure (V2I) communications in VANETs, and proposes a Moving dirEction and DestinAtion Location based routing (MEDAL) algorithm for supporting V2V and V2I communications. MEDAL takes advantage of both the moving directions of vehicles and the destination location to select a neighbor vehicle as the next hop for forwarding data. Unlike most existing routing algorithms, it only uses a HELLO message to obtain or update routing information without using other control messages, which largely reduces the number of control messages used in routing. Simulation results show that MEDAL can significantly improve the packet delivery ratio of the network as compared with the well-known Ad hoc On-demand Distance Vector Routing (AODV) algorithm.
Fichier principal
Vignette du fichier
1569666211-2.pdf (282.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00781202 , version 1 (12-06-2013)

Identifiers

  • HAL Id : hal-00781202 , version 1

Cite

Xu Wu, Hui Tong, Nathalie Mitton, Jun Zheng. MEDAL: a moving direction and destination location based routing algorithm for vehicular ad hoc networks. IEEE International Conference on Communications (ICC), Jun 2013, Budapest, Hungary. ⟨hal-00781202⟩

Collections

INRIA INRIA2
111 View
292 Download

Share

Gmail Facebook Twitter LinkedIn More