Void Traversal for Guaranteed Delivery in Geometric Routing

TL;DR

This paper introduces a void traversal algorithm that enables guaranteed delivery in arbitrary geometric graphs, overcoming limitations of existing planar graph-based routing algorithms like GFG in wireless networks.

Contribution

The paper presents a novel void traversal algorithm that extends geometric routing to arbitrary graphs, improving delivery guarantees and routing efficiency.

Findings

The proposed algorithm guarantees message delivery in arbitrary geometric graphs.

Performance comparison shows improvements over GFG in certain network scenarios.

The method reduces the need for conservative link length selection.

Abstract

Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorithms run on planar graphs only. To efficiently construct a planar graph, they require a unit-disk graph. To make the topology unit-disk, the maximum link length in the network has to be selected conservatively. In practical setting this leads to the designs where the node density is rather high. Moreover, the network diameter of a planar subgraph is greater than the original graph, which leads to longer routes. To remedy this problem, we propose a void traversal algorithm that works on arbitrary geometric graphs. We describe how to use this algorithm for geometric routing with guaranteed delivery and compare its performance with GFG.