Connectivity-aware minimum-delay geographic routing with vehicle tracking in VANETs

2Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a novel geographic routing protocol for vehicular ad-hoc networks (VANETs) that adapts well to continuously changing network status in such networks. On one hand, when the network is sparse, the protocol takes the connectivity of routes into consideration in its route selection logic which maximizes the chance of packet reception. On the other hand, in situations with dense network nodes, the routes with adequate connectivity are recognized and among them the route with minimum delay is selected. Also the proposed protocol includes a mechanism for tracking target vehicles when they move away from their initial locations. Finally, the proposed protocol is compared with other successful state-of-the-art routing protocols for VANETs and its effectiveness is verified via simulations. © 2010 ICST Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering.

Cite

CITATION STYLE

APA

Shafiee, K., & Leung, V. C. M. (2010). Connectivity-aware minimum-delay geographic routing with vehicle tracking in VANETs. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (Vol. 28 LNICST, pp. 256–267). https://doi.org/10.1007/978-3-642-11723-7_17

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