@article{TDGj09,
 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 near-optimal routes. We show that random geometric graphs and variants have a nice property that they
are doubling metric spaces, with high probability. This enables us to design hierarchical routing schemes with provable performance that account for the user mobility and scale well with network size.},
 author = {D. Tschopp and S N. Diggavi and M. Grossglauser},
 file = {:papers:tdgrouting09.pdf},
 journal = {Random Structures and Algorithms},
 label = {tdg_j09},
 month = {July},
 note = {},
 pages = {},
 tags = {journal,WiNet,CSalgo,DynamWiNet,MetricEmb,WiNetRouting},
 title = {Hierarchical Routing over Dynamic Wireless Networks},
 type = {2},
 url_arxiv = {http://arxiv.org/abs/0909.2504},
 volume = {},
 year = {2014}
}

{"_id":"jMKBpnWerRQSNpS8a","bibbaseid":"tschopp-diggavi-grossglauser-hierarchicalroutingoverdynamicwirelessnetworks-2014","author_short":["Tschopp, D.","Diggavi, S N.","Grossglauser, M."],"bibdata":{"bibtype":"article","type":"2","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 near-optimal routes. We show that random geometric graphs and variants have a nice property that they are doubling metric spaces, with high probability. This enables us to design hierarchical routing schemes with provable performance that account for the user mobility and scale well with network size.","author":[{"firstnames":["D."],"propositions":[],"lastnames":["Tschopp"],"suffixes":[]},{"firstnames":["S","N."],"propositions":[],"lastnames":["Diggavi"],"suffixes":[]},{"firstnames":["M."],"propositions":[],"lastnames":["Grossglauser"],"suffixes":[]}],"file":":papers:tdgrouting09.pdf","journal":"Random Structures and Algorithms","label":"tdg_j09","month":"July","note":"","pages":"","tags":"journal,WiNet,CSalgo,DynamWiNet,MetricEmb,WiNetRouting","title":"Hierarchical Routing over Dynamic Wireless Networks","url_arxiv":"http://arxiv.org/abs/0909.2504","volume":"","year":"2014","bibtex":"@article{TDGj09,\n abstract = {Wireless network topologies change over time and maintaining routes requires frequent updates. Updates are\ncostly in terms of consuming throughput available for data transmission, which is precious in wireless networks.\nIn this paper, we ask whether there exist low-overhead schemes that produce near-optimal routes. We show that random geometric graphs and variants have a nice property that they\nare doubling metric spaces, with high probability. This enables us to design hierarchical routing schemes with provable performance that account for the user mobility and scale well with network size.},\n author = {D. Tschopp and S N. Diggavi and M. Grossglauser},\n file = {:papers:tdgrouting09.pdf},\n journal = {Random Structures and Algorithms},\n label = {tdg_j09},\n month = {July},\n note = {},\n pages = {},\n tags = {journal,WiNet,CSalgo,DynamWiNet,MetricEmb,WiNetRouting},\n title = {Hierarchical Routing over Dynamic Wireless Networks},\n type = {2},\n url_arxiv = {http://arxiv.org/abs/0909.2504},\n volume = {},\n year = {2014}\n}\n\n","author_short":["Tschopp, D.","Diggavi, S N.","Grossglauser, M."],"key":"TDGj09","id":"TDGj09","bibbaseid":"tschopp-diggavi-grossglauser-hierarchicalroutingoverdynamicwirelessnetworks-2014","role":"author","urls":{" arxiv":"http://arxiv.org/abs/0909.2504"},"metadata":{"authorlinks":{}},"downloads":2,"html":""},"bibtype":"article","biburl":"https://bibbase.org/network/files/e2kjGxYgtBo8SWSbC","dataSources":["xJuTMZ3nEiMJi5Y9f","hicKnsKYNEFXC4CgH","jxCYzXXYRqw2fiEXQ","wCByFFrQMyRwfzrJ6","yuqM5ah4HMsTyDrMa","YaM87hGQiepg5qijZ","n9wmfkt5w8CPqCepg","soj2cS6PgG8NPmWGr","FaDBDiyFAJY5pL28h","ycfdiwWPzC2rE6H77"],"keywords":[],"search_terms":["hierarchical","routing","over","dynamic","wireless","networks","tschopp","diggavi","grossglauser"],"title":"Hierarchical Routing over Dynamic Wireless Networks","year":2014,"downloads":2}