Practical 3D Geographic Routing for Wireless Sensor Networks

Geographic routing is of interest for sensor networks because a point-to-point primitive is an important building block for data-centric applications. While there is a significant body of work on geographic routing algorithms for Two-Dimensional (2D) networks, geographic routing for practical Three-Dimensional (3D) sensor networks is relatively unexplored. The authors show that existing 2D geographic routing algorithms like CLDP/GPSR and GDSTR perform poorly in practical 3D sensor network deployments and describe GDSTR-3D, a new 3D geographic routing algorithm that uses 2-hop neighbor information in greedy forwarding and 2D convex hulls to aggregate node location information.