Link reliability based greedy perimeter stateless routing for vehicular Ad Hoc networks

32Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We propose an enhancement for the well-known greedy perimeter stateless routing (GPSR) protocol for vehicular ad hoc networks (VANETs), which exploits information about link reliability when one-hop vehicles are chosen for forwarding a data packet. In the proposed modified routing scheme, a tagged vehicle will select its one-hop forwarding vehicle based on reliability of the corresponding communication link. We define link reliability as the probability that a direct link among a pair of neighbour vehicles will remain alive for a finite time interval. We present a model for computing link reliability and use this model for the design of reliability based GPSR. The proposed protocol ensures that links with reliability factor greater than a given threshold alone are selected, when constructing a route from source to destination. The modified routing scheme shows significant improvement over the conventional GPSR protocol in terms of packet delivery ratio and throughput. We provide simulation results to justify the claim.

Cite

CITATION STYLE

APA

Shelly, S., & Babu, A. V. (2015). Link reliability based greedy perimeter stateless routing for vehicular Ad Hoc networks. International Journal of Vehicular Technology, 2015. https://doi.org/10.1155/2015/921414

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free