By Topic

Virtual Vertex Routing (VVR) for Course-Based Vehicular Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hojin Lee ; Sch. of Comput. Sci. & Eng., Seoul Nat. Univ. ; Youndo Lee ; Taekyoung Kwon ; Yanghee Choi

In vehicular ad hoc networks (VANETs), geographic routing protocols appear to be a fascinating option since they have generally low delay and small routing overhead and GPS devices are becoming affordable. However, we reveal that geographic routing protocols suffer from routing holes when nodes are distributed only on lines such as cars on roads, trains on rails, and ships on courses. To tackle this problem, we propose a novel geographic routing protocol, virtual vertex routing (VVR), which uses the information of the lines. Using graph formulation, we introduce a new concept, the proximity of a vertex (or a virtual vertex). An intermediate node in this proximity performs routing toward the destination by Floyd algorithm. For routing holes, we propose two countermeasures: greedy routing (VVR-GR) and face routing (VVR-FR). The latter can guarantee the packet delivery. Extensive simulations are performed to show that VVR outperforms GPSR and AODV.

Published in:

2007 IEEE Wireless Communications and Networking Conference

Date of Conference:

11-15 March 2007