Hierarchical Routing over Dynamic Wireless Networks
Dominique Tschopp, Suhas Diggavi, Matthias Grossglauser

TL;DR
This paper investigates low-overhead routing schemes in dynamic wireless networks, leveraging geometric properties to maintain efficient routes despite frequent topology changes.
Contribution
It introduces a novel approach that uses geometric properties of the network to achieve low-overhead, low-stretch routing in dynamic wireless environments.
Findings
Proposes a geometric-based routing scheme for dynamic networks
Achieves low-overhead route updates with minimal stretch
Demonstrates effectiveness through theoretical analysis
Abstract
Wireless network topologies change over time and maintaining routes requires frequent updates. Updates are costly in terms of consuming throughput available for data transmission, which is precious in wireless networks. In this paper, we ask whether there exist low-overhead schemes that produce low-stretch routes. This is studied by using the underlying geometric properties of the connectivity graph in wireless networks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Ad Hoc Networks · Opportunistic and Delay-Tolerant Networks · Cooperative Communication and Network Coding
