Hierarchical routing over dynamic wireless networks

Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of consuming throughput available for data transmission, which is a precious resource in wireless networks. In this paper, we ask the question whether there exist low-overhead schemes for dynamic wireless networks, that could produce routes that are within a small constant factor (stretch) of the optimal route-length. This is studied by using the underlying geometric properties of the connectivity graph in wireless networks. For a class of models for mobile wireless network that fulfill some mild conditions on the connectivity and on mobility over the time of interest, we can design distributed routing algorithm that maintains the routes over a changing topology. This scheme needs only node identities and therefore integrates location service along with routing, therefore accounting for the complete overhead. We...

• Type: Journal
• Year: 2008
• Where: SIGMETRICS
• Authors: Dominique Tschopp, Suhas N. Diggavi, Matthias Grossglauser
• Keywords: Dynamic Wireless Networks, Hardware, Mobile Wireless Network, SIGMETRICS 2008, Wireless Networks