Scalable Routing in Cyclic Mobile Networks

• Published in: IEEE transactions on parallel and distributed systems Vol. 20; no. 9; pp. 1325 - 1338
• Main Authors: Liu, Cong, Wu, Jie
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.09.2009; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithm design and analysis; Algorithms; Analytical models; Compressing; Computer networks; Contact; Delay; delay-tolerant networks (DTNs); delivery; Disruption tolerant networking; hierarchical routing; Mathematical models; motion cycle; Networks; Partitioning algorithms; Performance analysis; Routing; Routing (telecommunications); Scalability; simulation; Studies; Uncertainty; Wireless sensor networks; Routing protocols; Algorithm/protocol design and analysis
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/TPDS.2008.218

The nonexistence of an end-to-end path poses a challenge in adapting traditional routing algorithms to delay-tolerant networks (DTNs). Previous works have covered centralized routing approaches based on deterministic mobility, ferry-based routing with deterministic or semideterministic mobility, flooding-based approaches for networks with general mobility, and probability-based routing for semideterministic mobility models. Unfortunately, none of these methods can guarantee both scalability and delivery. In this paper, we extend the investigation of scalable deterministic routing in DTNs with repetitive mobility based on our previous works. Instead of routing with global contact knowledge, we propose a routing algorithm that routes on contact information compressed by three combined methods. We address the challenge of efficient information aggregation and compression in the time-space domain while maintaining critical information for efficient routing. Then, we extend it to handle a moderate level of uncertainty in contact prediction. Analytical studies and simulation results show that the performance of our proposed routing algorithm, DTN hierarchical routing (DHR), is comparable to that of the optimal time-space Dijkstra algorithm in terms of delay and hop count. At the same time, the per-node storage overhead is substantially reduced and becomes scalable.