Hierarchical Routing over Dynamic Wireless Networks
Networking and Internet Architecture
2009-09-16 v2 Data Structures and Algorithms
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.
Cite
@article{arxiv.0909.2504,
title = {Hierarchical Routing over Dynamic Wireless Networks},
author = {Dominique Tschopp and Suhas Diggavi and Matthias Grossglauser},
journal= {arXiv preprint arXiv:0909.2504},
year = {2009}
}
Comments
29 pages, 19 figures, a shorter version was published in the proceedings of the 2008 ACM Sigmetrics conference