This Article 
 Bibliographic References 
 Add to: 
Scalable Routing in Cyclic Mobile Networks
September 2009 (vol. 20 no. 9)
pp. 1325-1338
Cong Liu, Florida Atlantic University, Boca Raton
Jie Wu, Florida Atlantic University, Boca Raton
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.

[1] U. Acer, S. Kalyanaraman, and A. Abouzeid, “Weak State Routing for Large Scale Dynamic Networks,” Proc. ACM MobiCom, 2007.
[2] V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst, K. Scott, K. Fall, and H. Weiss, Delay-Tolerant Network Architecture, Internet Draft: draft-irrf-dtnrg-arch.txt, DTN Research Group, 2006.
[3] B. Chen and R. Morris, “L+: Scalable Landmark Routing and Address Lookup for Multi-Hop Wireless Network,” Technical Report 837, Mass. Inst. of Technology LCS, Mar. 2002.
[4] A. Ephremides, J.E. Wieselthier, and D.J. Baker, “A Design Concept for Reliable Mobile Radio Networks with Frequency Hoping Signaling,” Proc. IEEE '87, vol. 75, no. 1, pp. 56-73, Jan. 1987.
[5] J. Eriksson, M. Faloutsos, and S. Krishnamurthy, “Scalable AdHoc Routing: The Case for Dynamic Addressing,” Proc. IEEE INFOCOM, 2004.
[6] J. Ghosh, S.J. Philip, and C. Qiao, “Sociological Orbit Aware Location Approximation and Routing (SOLAR) in MANET,” Proc. ACM MobiHoc, 2005.
[7] J. Haas, J.Y. Halpern, and L. Li, “Gossip-Based Ad Hoc Routing,” Proc. IEEE INFOCOM, 2002.
[8] P. Hui, J. Crowcroft, and E. Yoneki, “Bubble Rap: Social-Based Forwarding in Delay Tolerant Networks,” Proc. ACM MobiHoc, 2008.
[9] S. Jain, K. Fall, and R. Patra, “Routing in a Delay Tolerant Network,” Proc. ACM SIGCOMM, 2004.
[10] J. Leguay, T. Friedman, and V. Conan, “DTN Routing in a Mobility Pattern Space,” Proc. ACM SIGCOMM Workshop Delay-Tolerant Networking, 2005.
[11] A. Lindgren, A. Doria, and O. Schelen, “Probabilistic Routing in Intermittently Connected Networks,” Lecture Notes on Computer Science, vol. 3126, pp.239-254, Aug. 2004.
[12] C. Liu and J. Wu, “Scalable Routing in Delay Tolerant Networks,” Proc. ACM MobiHoc, 2007.
[13] S. Merugu, M. Ammar, and E. Zegura, “Routing in Space and Time in Network with Predictable Mobility,” Technical Report GIT-CC-04-07, College of Computing, Georgia Tech, 2004.
[14] G. Pei, M. Gerla, X. Hong, and C. Chiang, “A Wireless Hierarchical Routing Protocol with Group Mobility,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), 1999.
[15] R. Ramanathan, P. Basu, and R. Krishnan, “Towards a Formalism for Routing in Challenged Networks,” Proc. ACM MobiCom Workshop Challenged Networks (CHANTS), 2007.
[16] R. Ramanathan and M. Steenstrup, “Hierarchically Organized, Multihop Mobile Wireless Networks for Quality of Service Support,” Mobile Networks and Applications, vol. 3, no. 1, pp.101-119, 1998.
[17] P. Sinha, R. Sivakumar, and V. Bharghavan, “Enhancing Ad Hoc Routing with Dynamic Virtual Infrastructures,” Proc. IEEE INFOCOM, 2001.
[18] M.M.B. Tariq, M. Ammar, and E. Zegura, “Message Ferry Route Design for Sparse Ad Hoc Networks with Mobile Nodes,” Proc. ACM MobiHoc, 2005.
[19] A. Vahdat and D. Becker, “Epidemic Routing for Partially-Connected Ad Hoc Networks,” technical report, Duke Univ., 2000.
[20] J. Wu, S. Yang, and F. Dai, “Logarithmic Store-Carry-Forward Routing in Mobile Ad Hoc Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 6, June 2007.
[21] X. Zhang, J.F. Kurose, B. Levine, D. Towsley, and H. Zhang, “Study of a Bus-Based Disruption Tolerant Network: Mobility Modeling and Impact on Routing,” Towards a Formalism for Routing in Challenged Networks, 2007.
[22] W. Zhao, M. Ammar, and E. Zegura, “A Message Ferrying Approach for Data Delivery in Sparse Mobile Ad Hoc Networks,” Proc. ACM MobiHoc, 2004.

Index Terms:
Contact, delay-tolerant networks (DTNs), delivery, hierarchical routing, motion cycle, scalability, simulation.
Cong Liu, Jie Wu, "Scalable Routing in Cyclic Mobile Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 9, pp. 1325-1338, Sept. 2009, doi:10.1109/TPDS.2008.218
Usage of this product signifies your acceptance of the Terms of Use.