This paper is published in Volume-3, Issue-2, 2017
Area
Vehicular Networks
Author
Vongpasith Phouthone, Zhu Xiao, Dong Wang, Vincent Havyarimana
Org/Univ
College of Computer Science and Electronic Engineering, Hunan University, Changsha, China
Pub. Date
28 April, 2017
Paper ID
V3I2-1554
Publisher
Keywords
GPSR, Local maximum, Movement direction, Next-hop, VANETs

Citationsacebook

IEEE
Vongpasith Phouthone, Zhu Xiao, Dong Wang, Vincent Havyarimana. Movement Direction Algorithm for Geographic Routing Protocol in Vehicular Networks, International Journal of Advance Research, Ideas and Innovations in Technology, www.IJARIIT.com.

APA
Vongpasith Phouthone, Zhu Xiao, Dong Wang, Vincent Havyarimana (2017). Movement Direction Algorithm for Geographic Routing Protocol in Vehicular Networks. International Journal of Advance Research, Ideas and Innovations in Technology, 3(2) www.IJARIIT.com.

MLA
Vongpasith Phouthone, Zhu Xiao, Dong Wang, Vincent Havyarimana. "Movement Direction Algorithm for Geographic Routing Protocol in Vehicular Networks." International Journal of Advance Research, Ideas and Innovations in Technology 3.2 (2017). www.IJARIIT.com.

Abstract

Vehicular ad hoc networks (VANETs) are a special type of the wireless network in which communication through other intermediate vehicles on the road. Due to the high mobility of vehicles, the design of an efficient routing protocol is one of the key issues, which has been considered a challenging problem to deal with such dynamic network in VANETs. The greedy perimeter stateless routing (GPSR) routing protocol uses the simple greedy forwarding based only on the position information which may fail to find a neighbor closer to the destination than itself. In this paper, we propose a movement direction algorithm under GPSR. It comprehensively takes into account the velocity vector information and underlying link expiration time to recover a local maximum. The simulation outcomes in varying scenarios show that the proposed algorithm enhances the packet delivery and reduces the end-to-end delay, compared to the existing geographic routing algorithms.