Hierarchical routing over dynamic wireless networks

DOI10.1002/rsa.20589zbMath1327.05305OpenAlexW2140317092MaRDI QIDQ3460515

Dominique Tschopp, Matthias Grossglauser, Suhas N. Diggavi

Publication date: 7 January 2016

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20589

zbMATH Keywords

competitive analysiswireless networksmobilitygeometric random graphsdistributed routing algorithms

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Bypassing the embedding
• The capacity of wireless networks
• Optimal-stretch name-independent compact routing in doubling metrics

This page was built for publication: Hierarchical routing over dynamic wireless networks