Virtual coordinates with backtracking for void traversal in geographic routing

Authors:
Ke Liu;Nael Abu-Ghazaleh
Affiliations:
Computer Science Department, Binghamton University, Binghamton, NY;Computer Science Department, Binghamton University, Binghamton, NY
Venue:
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Year:
2006

Citing 16
Cited 3

Landmarks in graphs

Discrete Applied Mathematics
Routing with guaranteed delivery in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location Systems for Ubiquitous Computing

Computer
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Range-free localization schemes for large scale sensor networks

Proceedings of the 9th annual international conference on Mobile computing and networking
Geographic routing without location information

Proceedings of the 9th annual international conference on Mobile computing and networking
GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information

Proceedings of the 1st international conference on Embedded networked sensor systems
On the effect of localization errors on geographic face routing in sensor networks

Proceedings of the 3rd international symposium on Information processing in sensor networks
Virtual coordinates for ad hoc and sensor networks

Proceedings of the 2004 joint workshop on Foundations of mobile computing
A Scalable Logical Coordinates Framework for Routing in Wireless Sensor Networks

RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Simulation analysis of virtual geographic routing

WSC '04 Proceedings of the 36th conference on Winter simulation
Geographic routing made practical

NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Beacon vector routing: scalable point-to-point routing in wireless sensornets

NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Organizing a global coordinate system from local information on an ad hoc sensor network

IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Geometric routing without geometry

SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity

Aligned virtual coordinates for greedy geometric routing in WSNs

International Journal of Sensor Networks
Exploiting slack time for just-in-time scheduling in wireless sensor networks

Real-Time Systems
Convex Subspace Routing (CSR): Routing via anchor-based convex virtual subspaces in sensor networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Geographical routing protocols have several desirable features for use in ad hoc and sensor networks but are susceptible to voids and localization errors. Virtual coordinate systems which overlay a coordinate system on the nodes offer an alternative that is more resilient to localization errors. However, we show that it is vulnerable to different forms of the void problem where packets reach nodes with no viable next hop in the forwarding set. In addition, it is possible for nodes with the same coordinates to arise at different points in the network in the presence of voids. This paper identifies and analyzes these problems. It also compares several existing routing protocols based on Virtual Coordinate systems. Finally, we propose a routing algorithm that uses geographic routing in the greedy phase and virtual coordinates with backtracking to overcome voids and achieve high connectivity in the greedy phase with higher overall path quality and more resilience to localization errors. We demonstrate these properties using extensive simulation studies.