Geographic routing with constant stretch in large scale sensor networks with holes

Geographic routing is well suited for large scale sensor networks deployments, because the per node state it maintains is independent of the network size. However, due to the “local minimum” caused by holes/obstacles, the path stretch of geographic routing can grow as O(c
²
), where c is the length of the optimal path. Recently, VIGOR, a geographic routing protocol based on the visibility graph, shows that a constant path stretch can be achieved. This, however, is possible with increased overhead. To address this issue, we propose GOAL (Geometric Routing using Abstracted Holes), a routing protocol that provably achieves a constant path stretch, with lower message, space and computational overhead. We develop a novel distributed convex hull construction (DCC) algorithm that compactly describes holes. This compact representation of a hole is leveraged by nodes to make locally optimal routing decisions. Our theoretical analysis proves the constant stretch property and average stretch of GOAL. Through extensive simulations and a hardware implementation, we demonstrate the effectiveness of GOAL and its feasibility for large-scale sensor networks. In our network settings, GOAL reduces the energy consumption by up to 32%, routing table size by an order of magnitude, when compared with VIGOR.