Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings
Routing packets is a central function of multi-hop wireless networks. Traditionally, there have been two paradigms for routing, either based on the geographical coordinates of the nodes (geographic routing), or based on the connectivity graph (topology-based routing). The former implicitly assumes that geometry determines connectivity, whereas the latter does not exploit this inherent geometry of wireless networks, and assumes a general graph instead. In this paper, the authors explore ideas that attempt to bridge these two paradigms. They do so by investigating routing techniques based on metric embeddings of the connectivity graph.