CLDP Robust Planarization for Geographic Face Routing - eScholarship

Geographic routing algorithms are attractive for wireless ad hoc networks because they have been shown to scale better than other alternatives they require per-node state independent of network size, dependent only on network density. More recently, geographic routing algorithms have been proposed for use as a routing primitive for static sensor networks, as building blocks for data storage and flexible query processing in sensor networks, and even as a fallback routing mechanism for reduced state routing in the Internet.