An important technique for discovering routes between two nodes in an ad-hoc network involves applying the face routing algorithm on a planar spanner of the network. Face routing guarantees message delivery in networks that contains large holes, where greedy algorithms fail. Existing techniques for constructing a suitable planar subgraph involve local tests that eliminate crossings between existing links by deleting some links. They do not test whether the deleted links actually create some crossings and some of the links are deleted needlessly. As a result, some of the routes found in face routing will have an unnecessarily large number of hops from source to destination. We consider a new local test for preprocessing a wireless network that produces a planar subgraph. The test is relatively simple, requires low overhead and does not eliminate existing links unless it is needed to eliminate a crossing, thus reducing overhead associated with multiple hops.

School of Computer Science

Boone, P. (Paul), Chavez, E. (Edgar), Gleitzky, L. (Lev), Kranakis, E, Opatrny, J. (Jaroslav), Salazar, G. (Gelasio), & Urrutia, J. (Jorge). (2004). Morelia test: Improving the efficiency of the Gabriel test and face routing in ad-hoc networks.