A Geo-Routing Algorithm in Planar Graph for Ad Hoc Wireless Networks

This paper presented a fully distributed algorithm to compute a planar subgraph for geo-routing in ad hoc wireless networks. We considered the idealized unit disk graph model in which nodes are assumed to be connected if and only if nodes are within their transmission range. The main contribution of this work is a fully distributed algorithm to extract the connected, planar graph for routing in the wireless networks. The communication cost of the proposed algorithm is O(d log d) bits, where d is the degree of a node.