[Paper Review] Virtual Coordinate Backtracking for Void Traversal in Geographic Routing

Ke Liu, Nael Abu‐Ghazaleh|ArXiv.org|Nov 15, 2005

Indoor and Outdoor Localization Technologies9 references18 citations

TL;DR

This paper proposes a hybrid geographic and virtual coordinate greedy routing (HGR) protocol that uses virtual coordinate backtracking to overcome voids in geographic routing, significantly improving delivery ratio and path quality. By combining greedy forwarding with a backtracking mechanism in virtual coordinates, HGR achieves 100% reachability and outperforms GPSR and BVR in both void resilience and localization error tolerance.

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 are an alternative solution to geographically based routing protocols that works by overlaying a coordinate system on the sensors relative to well chosen reference points. VC is resilient to localization errors; however, we show that it is vulnerable to different forms of the void problem and have no viable complementary approach to overcome them. Specifically, we show that there are instances when packets reach nodes with no viable next hop nodes 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, it presents a new routing algorithm that uses backtracking to overcome voids to achieve high connectivity in the greedy phase, higher overall path quality and more resilience to localization errors. We show these properties using extensive simulation analysis.

Motivation & Objective

• To identify and analyze vulnerabilities in virtual coordinate systems (VCS) routing, particularly regarding voids and coordinate collisions.
• To demonstrate that VCS is not inherently void-resistant, contrary to prior assumptions, and suffers from three key problems: equal-coordinate zones, disconnected zones, and greedy forwarding failure.
• To design a hybrid routing protocol that leverages the strengths of both geographic and virtual coordinate routing to improve connectivity and resilience.
• To evaluate the performance of the proposed HGR protocol against existing protocols like GPSR and BVR under various network densities and localization error conditions.

Proposed method

• The HGR protocol uses greedy forwarding based on geographic location in the primary phase to ensure high path quality and low overhead.
• When a void is encountered (i.e., no forwardable neighbor in the forwarding set), the protocol switches to a virtual coordinate-based backup routing phase.
• The virtual coordinate-based void traversal employs a dimension-by-dimension backtracking heuristic, where the packet is routed backward toward reference anchors to escape the void.
• Virtual coordinates are computed as hop counts from selected reference points during an initialization phase, enabling location-independent routing.
• The protocol dynamically switches between geographic and virtual coordinate modes based on the presence of voids, ensuring robustness.
• The backtracking mechanism avoids reliance on perimeter routing, which is sensitive to localization errors, by using a deterministic, stateless path recovery strategy.

Experimental results

Research questions

• RQ1 Can virtual coordinate systems truly avoid voids in geographic routing, as previously claimed?
• RQ2 What are the specific failure modes of VCS routing under realistic network conditions, such as equal-distance forwarding sets or coordinate collisions?
• RQ3 How does the performance of VCS-based routing degrade under localization errors compared to geographic routing?
• RQ4 Can a hybrid approach combining greedy geographic forwarding with virtual coordinate backtracking achieve higher reachability and better path quality than existing protocols?
• RQ5 To what extent does backtracking in virtual coordinates improve resilience to localization errors in void traversal?

Key findings

• HGR achieves 100% delivery ratio across all tested network scenarios, significantly outperforming GPSR and BVR in reachability.
• In dense networks, HGR achieves an average path length of 23 hops, compared to 28 hops for GPSR(GG), demonstrating superior path quality.
• Under 20% radio range localization error, HGR maintains full reachability and path quality, while GPSR experiences significant routing failures.
• The hybrid protocol reduces path length by up to 17% compared to GPSR(GG) in high-density deployments, indicating better efficiency.
• The backtracking mechanism effectively resolves virtual coordinate voids and prevents routing loops or dead ends in disconnected zones.
• HGR is highly resilient to localization errors, especially in the void traversal phase, due to the use of virtual coordinates instead of physical location in backup routing.