Life (and routing) on the Wireless Manifold
The authors present the wireless manifold, a 2-dimensional surface whose geodesic distances accurately capture wireless signal propagation. As a result, the connectivity graph of a wireless network can be viewed as a disk graph on the manifold. A compact representation of the manifold can be reconstructed from a sparse set of signal measurements. The manifold distance suggests a simple routing algorithm that avoids obstacles and naturally handles mobile nodes without explicitly maintaining the connectivity graph. It is more efficient compared to using Euclidean distance as measured by success rate, routing load and failure tolerance. Placing sensors to cover the manifold is more effective than covering the underlying physical space.