Infoscience

Report

# Hierarchical Routing in Dynamic $\alpha$-Doubling Networks

In this paper we formulate the problem of routing over dynamic networks with finite doubling dimension. This is motivated by communication in mobile wireless networks, where the communication graph topology changes over time, but has some geometric properties, motivating the model for finite doubling dimension. Since wireless network bandwidth is precious, we consider communication cost required to set up the routing on such dynamic networks. We show that under appropriate modeling on time-changes of the dynamic network, we can build addressing with small total overhead and maintain routing with constant stretch for dynamic doubling metric networks.

#### Reference

• LICOS-REPORT-2007-004

Record created on 2007-08-31, modified on 2016-08-08