Subscribe

Issue No.11 - Nov. (2013 vol.62)

pp: 2308-2321

Minsu Huang , University of North Carolina at Charlotte, Charlotte

Siyuan Chen , University of North Carolina at Charlotte, Charlotte

Ying Zhu , University of North Carolina at Charlotte, Charlotte

Yu Wang , University of North Carolina at Charlotte, Charlotte

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2012.220

ABSTRACT

In delay tolerant networks (DTNs), the lack of continuous connectivity, network partitioning, and long delays make design of network protocols very challenging. Previous DTN research mainly focuses on routing and information propagation. However, with a large number of wireless devices' participation, it becomes crucial regarding how to maintain efficient and dynamic topology of the DTN. In this paper, we study the topology control problem in a predictable DTN, where the time-evolving network topology is known a priori or can be predicted. We first model such time-evolving network as a directed space-time graph that includes both spacial and temporal information. The aim of topology control is to build a sparse structure from the original space-time graph such that 1) the network is still connected over time and supports DTN routing between any two nodes; 2) the total cost of the structure is minimized. We prove that this problem is NP-hard, and propose two greedy-based methods that can significantly reduce the total cost of topology while maintaining the connectivity over time. We also introduce another version of the topology control problem by requiring that the least cost path for any two nodes in this constructed structure is still cost-efficient compared with the one in the original graph. Two greedy-based methods are provided for such a problem. Simulations have been conducted on both random DTN networks and real-world DTN tracing data. Results demonstrate the efficiency of the proposed methods.

INDEX TERMS

Topology, Network topology, Routing, Delay, Protocols, Ad hoc networks, Time domain analysis,space-time graph, Topology control, delay tolerant networks, greedy algorithm, spanner

CITATION

Minsu Huang, Siyuan Chen, Ying Zhu, Yu Wang, "Topology Control for Time-Evolving and Predictable Delay-Tolerant Networks",

*IEEE Transactions on Computers*, vol.62, no. 11, pp. 2308-2321, Nov. 2013, doi:10.1109/TC.2012.220REFERENCES

- [1] Y. Wang, H. Dang, and H. Wu, "A Survey on Analytic Studies of Delay-Tolerant Mobile Sensor Networks: Research Articles,"
Wireless Comm. Mobile Computing, vol. 7, no. 10, pp. 1197-1208, 2007.- [2] P. Juang et al., "Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with Zebranet,"
ACM SIGOPS Operating System Rev., vol. 36, no. 5, pp. 96-107, 2002.- [3] Q. Yuan, I. Cardei, and J. Wu, "Predict and Relay: An Efficient Routing in Disruption-Tolerant Networks,"
Proc. ACM MobiHoc, 2009.- [4] B. Burns, O. Brock, and B.N. Levine, "MV Routing and Capacity Building in Disruption Tolerant Networks,"
Prof. IEEE INFOCOM, 2005.- [5] W. Zhao, M. Ammar, and E. Zegura, "Controlling the Mobility of Multiple Data Transport Ferries in a Delay-Tolerant Network,"
Proc. IEEE INFOCOM, 2005.- [6] A. Vahdat and D. Becker, "Epidemic Routing for Partially Connected Ad Hoc Networks," Technical Report CS-200006, Duke Univ., 2000.
- [7] T. Spyropoulos, K. Psounis, and C.S. Raghavendra, "Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks,"
Proc. ACM SIGCOMM Workshop Delay-Tolerant Networking (WDTN '05), 2005.- [8] A. Lindgren, A. Doria, and O. Schelén, "Probabilistic Routing in Intermittently Connected Networks,"
ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 7, no. 3, pp. 19-20, 2003.- [9] J. Burgess et al., "MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks,"
Proc. IEEE INFOCOM, 2006.- [10] J. Leguay, T. Friedman, and V. Conan, "Evaluating Mobility Pattern Space Routing for DTNs,"
Proc. IEEE INFOCOM, 2006.- [11] P. Hui, J. Crowcroft, and E. Yoneki, "Bubble Rap: Social-Based Forwarding in Delay Tolerant Networks,"
Proc. ACM MobiHoc, 2008.- [12] P. Hui, A. Chaintreau, J. Scott, R. Gass, J. Crowcroft, and C. Diot, "Pocket Switched Networks and Human Mobility in Conference Environments,"
Proc. ACM SIGCOMM Workshop Delay-Tolerant Networking (WDTN '05), 2005.- [13] X. Zhang, J. Kurose, B.N. Levine, D. Towsley, and H. Zhang, "Study of a Bus-Based Disruption-Tolerant Network: Mobility Modeling and Impact on Routing,"
Proc. ACM MobiCom, 2007.- [14] M. Piorkowski, N. Sarafijanovoc-Djukic, and M. Grossglauser, "A Parsimonious Model of Mobile Partitioned Networks with Clustering,"
Proc. First Int'l Conf. Comm. Systems and Networks and Workshops (COMSNETS '09), 2009.- [15] A. Chaintreau, P. Fraigniaud, and E. Lebhar, "Opportunistic Spatial Gossip over Mobile Social Networks,"
Proc. ACM Workshop Online Social Networks (WOSN '08), 2008.- [16] Z.-B. Dong, G.-J. Song, K.-Q. Xie, and J.-Y. Wang, "An Experimental Study of Large-Scale Mobile Social Network,"
Prof. 18th Int'l Conf. World Wide Web (WWW '09), 2009.- [17] X. Hong, M. Gerla, R. Bagrodia, T.J. Kwon, P. Estabrook, and G. Pei, "The Mars Sensor Network: Efficient, Energy Aware Communications,"
Proc. IEEE Military Comm. Conf. Comm. Network-Centric Operations: Creating the Information Force (MILCOM '01), 2001.- [18] NASA, "Disruption Tolerant Networking (DTN)," https://www. spacecomm.nasa.gov/spacecomm/ programs/technologydtn/, 2013.
- [19] S. Burleigh and A. Hooke, "Delay-Tolerant Networking: An Approach to Interplanetary Internet,"
IEEE Comm. Magazine, vol. 41, no. 6, pp. 128-136, June 2003.- [20] C. Caini et al., "Delay- and Disruption-Tolerant Networking (DTN): An Alternative Solution for Future Satellite Networking Applications,"
Proc. IEEE, vol. 99, no. 11, pp. 1980-1997, Nov. 2011.- [21] C. Caini et al., "A DTN Approach to Satellite Communications,"
IEEE J. Selected Areas in Comm., vol. 26, no. 5, pp. 820-827, June 2008.- [22] C. Song, Z. Qu, N. Blumm, and A.-L. Barabasi, "Limits of Predictability in Human Mobility,"
Science, vol. 327, pp. 1018-1021, 2010.- [23] C. Liu and J. Wu, "Routing in a Cyclic Mobispace,"
Proc. ACM MobiHoc, 2008.- [24] B.B. Xuan, A. Ferreira, and A. Jarry, "Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks,"
Int'l J. Foundations of Computer Science, vol. 14, no. 2, pp. 267-285, 2003.- [25] S. Merugu et al., "Routing in Space and Time in Networks with Predictable Mobility," Technical Report GIT-CC-04-07, Georgia Inst. of Tech nology, 2004.
- [26] J. Monteiro, A. Goldman, and A. Ferreira, "Performance Evaluation of Dynamic Networks Using an Evolving Graph Combinatorial Model,"
Proc. IEEE Int'l Conf. Wireless and Mobile Computing, Networking and Comm. (WiMob '06), 2006.- [27] L. Arantes, A. Goldman, and M.V. dos Santos, "Using Evolving Graphs to Evaluate DTN Routing Protocols,"
Proc. Extreme Workshop Comm. (ExtremeCom '09), 2009.- [28] X.-Y. Li, P.-J. Wan, and Y. Wang, "Power Efficient and Sparse Spanner for Wireless Ad Hoc Networks,"
Proc. IEEE 10th Int'l Conf. Computer Comm. Networks (ICCCN '01), 2001.- [29] R. Rajaraman, "Topology Control and Routing in Ad Hoc Networks: A Survey,"
ACM SIGACT News, vol. 33, pp. 60-73, 2002.- [30] R. Wattenhofer et al., "Distributed Topology Control for Wireless Multihop Ad-Hoc Networks,"
Proc. IEEE INFOCOM, 2001.- [31] N. Li, J.C. Hou, and L. Sha, "Design and Analysis of a MST-Based Topology Control Algorithm,"
Proc. IEEE INFOCOM, 2003.- [32] Y. Wang and X.-Y. Li, "Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks,"
Mobile Networks and Applications, vol. 11, no. 2, pp. 161-175, 2006.- [33] F. Alagoz, "Energy Efficiency and Satellite Networking: A Holistic Overview,"
Proc. IEEE, vol. 99, no. 11, pp. 1954-1979, Nov. 2011.- [34] Y. Gu and T. He, "Dynamic Switching-Based Data Forwarding for Low-Duty-Cycle Wireless Sensor Networks,"
IEEE Trans. Mobile Computing, vol. 10, no. 12, pp. 1741-1754, Dec. 2011.- [35] L. Chen et al., "Group-Based Discovery in Low-Duty-Cycle Mobile Sensor Networks,"
Proc. IEEE Ninth Ann. Comm. Soc. Conf. Sensor, Mesh and Ad Hoc Comm. Networks (SECON '12), 2012.- [36] Y. Wang, H. Wu, F. Lin, and N.-F. Tzeng, "Cross-Layer Protocol Design and Optimization for Delay/Fault-Tolerant Mobile Sensor Networks,"
IEEE J. Selected Areas in Comm., vol. 26, no. 5, pp. 809-819, June 2008.- [37] L. Zosin and S. Khuller, "On Directed Steiner Trees,"
Proc. ACM/SIAM 13th Ann. Symp. Discrete Algorithms (SODA '02), 2002.- [38] J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau, "CRAWDAD Data Set Cambridge/Haggle (v. 2006-09-15)," http://crawdad.cs.dartmouth.edu/cambridge haggle, Sept. 2006.
- [39] M. Huang, S. Chen, Y. Zhu, B. Xu, and Y. Wang, "Topology Control for Time-Evolving and Predictable Delay-Tolerant Networks,"
Proc. IEEE Eight Int'l Conf. Mobile Adhoc and Sensor Systems (MASS '11), 2011.- [40] A.D. Amis, R. Prakash, D. Huynh, and T. Vuong, "Max-Min D-Cluster Formation in Wireless Ad Hoc Networks,"
Proc. IEEE INFOCOM, 2000.- [41] C.R. Lin and M. Gerla, "Adaptive Clustering for Mobile Wireless Networks,"
IEEE J. Selected Areas in Comm., vol. 15, no. 7, pp. 1265-1275, Sept. 1997.- [42] Y. Wang, W. Wang, and X.-Y. Li, "Efficient Distributed Low-Cost Backbone Formation for Wireless Networks,"
Proc. ACM MobiHoc, 2005.- [43] R.C. Shah et al., "Data MULEs: Modeling a Three-Tier Architecture for Sparse Sensor Networks,"
Proc. IEEE Int'l Workshop Sensor Network Protocols and Applications (SNPA '03), 2003.- [44] M. Charikar and C. Chekuri, "Approximation Algorithms for Directed Steiner Problems,"
J. Algorithms, vol. 33, no. 1, pp. 73-91, 1999.- [45] B. Chandra, G. Das, G. Narasimhan, and J. Soares, "New Sparseness Results on Graph Spanners,"
Proc. ACM Eighth Ann. Symp. Computational Geometry (SCG '92), 1992.- [46] C. Chekuri, G. Even, A. Gupta, and D. Segev, "Set Connectivity Problems in Undirected Graphs and the Directed Steiner Network Problem,"
Proc. 19th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '08), 2008.- [47] M. Huang, S. Chen, F. Li, and Y. Wang, "Topology Design in Time-Evolving Delay-Tolerant Networks with Unreliable Links,"
Proc. IEEE GlobeCom, 2012. |