Skip to main content
SpringerLink
Log in

The Impact of Storage Capacity Usage and Predictable Contact Schedule on Dynamic Routing for Opportunistic Deep Space Information Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In this paper, the impact of storage capacity usage and predictable contact schedule on dynamic routing is studied for the Opportunistic Deep Space Backbone Layer (OppDSBL) of the Deep Space Information Networks. The hypergraph model is firstly constructed to represent the OppDSBL for the sake of the improvement towards the network connectivity. Also, a polynomial time algorithm of dynamic routing in the OppDSBL is proposed, which realizes joint routing selection, storage capacity usage and predictable contact schedule simultaneously. The proposed algorithm depends on two novel models, i.e., the dynamic storage capacity usage model (DSCUM) and the predictable contact schedule model (PCSM). In the DSCUM, a general infinite-horizon differential game model for dynamic storage capacity usage of joint node is implemented based on two cost functions, which indicates the reduction as well as the consumption of storage capacity. Moreover, an optimization problem is further designed by taking into account the impact of selfish behavior on the dynamic storage capacity usage, and a set of optimal strategies to the noncooperative dynamic storage capacity usage is also obtained. In the PCSM, the predictable contact interruption probability is explicitly quantified to estimate the likelihood of link outage. In addition, the predictable contact schedule metric is further formulated to describe the contact relationship among different isolated islands in hypergraph model. Theoretical analysis and numerical results demonstrate the effectiveness and feasibility of the proposed dynamic routing algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Akyildiz, I. F., Akan, O. B., Chen, C., Fang, J., & Su, W. (2003). InterPlaNetary Internet: State-of-the-art and research challenges. Computer Networks, 43(2), 75–112.

    Article  MATH  Google Scholar 

  2. Zhang, L., Zhou, X., & Guo, J. (2013). Noncooperative dynamic routing with bandwidth constraint in intermittently connected deep space information networks under scheduled contacts. Wireless Personal Communications, 68(4), 1255–1285.

    Article  Google Scholar 

  3. Zhou, X., Zhang, L., Cheng, Z., He, H., Wang, J., & Chen, Y. (2010). Hypernetwork model and architecture for deep space information networks. In Proceedings of the IEEE ICFIT 2010 (pp. 448–452). Changsha, China.

  4. Chen, C., & Chen, Z. (2010). Towards a routing framework in ad hoc space networks. International Journal of Ad Hoc and Ubiquitous Computing, 5(1), 44–55.

    Article  Google Scholar 

  5. Khabbaz, M. J., Assi, C. M., & Fawaz, W. F. (2012). Disruption-tolerant networking: A comprehensive survey on recent developments and persisting challenges. IEEE Communications Surveys & Tutorials, 14(2), 607–640.

    Article  Google Scholar 

  6. Lu, X., Pan, H., & Pietro, L. (2012). High delivery performance opportunistic routing scheme for delay tolerant networks. China Communications, 9(6), 145–153.

    Google Scholar 

  7. Vahdat, A., & Becker, D. (2000). Epidemic routing for partially-connected ad hoc networks, Technical Report CS-2000-06. North Carolina: Duke University.

  8. Ramanathan, R., Hansen, R., Basu, P., Rosales-Hain, R., & Krishnan, R. (2007). Prioritized epidemic routing for opportunistic networks. In Proceedings of the ACM MobiOpp 2007 (pp. 62–66). San Juan, Puerto Rico, USA.

  9. Li, Y., Jiang, Y., Jin, D. Li Su, Zeng, L., & Wu, D. O. (2010). Energy-efficient optimal opportunistic forwarding for delay-tolerant networks. IEEE Transactions on Vehicular Technology, 59(9), 4500–4512.

  10. Lin, Y., Li, B., & Liang, B. (2008). Stochastic analysis of network coding in epidemic routing. IEEE Journal on Selected Areas in Communications, 26(5), 794–808.

    Article  Google Scholar 

  11. Cao, Y., Sun, Z., & Riaz, M. (2012). Reach-and-spread: A historical geographic routing for delay/disruption tolerant networks. IET Networks, 1(3), 163–170.

    Article  Google Scholar 

  12. Harras, K. & Almeroth, K. (2006) Inter-regional messenger scheduling in delay tolerant mobile networks. In Proceedings of the IEEE WoWMoM 2006 (pp. 93–102). Buffalo, NY, USA.

  13. Jones, E. P. C., Li, L., Schmidtke, J. K., & Ward, P. A. S. (2007). Practical routing in delay-tolerant networks. IEEE Transactions on Mobile Computing, 6(8), 943–959.

    Article  Google Scholar 

  14. Burgess, J., Gallagher, B., Jensen, D., & Levine, B. N. (2006) MaxProp: Routing for vehicle-based disruption-tolerant networks. In Proceedings of the IEEE INFOCOM 2006. Barcelona, Spain.

  15. Balasubramanian, A., Levine, B. N., & Venkataramani, A. (2007). DTN routing as a resource allocation problem. ACM SIGCOMM-Computer Communication Review, 37(4), 373–384.

    Article  Google Scholar 

  16. Bisio, I., de Cola, T., & Marchese, M. (2008) Congestion aware routing strategies for DTN-based interplanetary networks. In Proceedings fot the IEEE GLOBECOM 2008. New Orleans, LO, USA.

  17. Mistry, K., Srivastava, S., & Lenin, R. B. (2009). Buffer aware routing in interplanetary ad hoc network. In Proceedings of the COMSNETS 2009 (pp. 410–419). Bangalore, India.

  18. Sidi, M. J. (2000). Spacecraft dynamics and control: A practical engineering approach. Cambridge: Cambridge University Press.

    Google Scholar 

  19. Berge, C. (1989). Hypergraphs. Amsterdam: North-Holland.

    MATH  Google Scholar 

  20. Small, T., & Haas, Z. J., (2005). Resource and performance tradeoffs in delay-tolerant wireless networks. In Proceedings of the ACM SIGCOMM 2005 (pp. 260–267). Philadelphia, Pennsylvania, USA.

  21. Yeung, D. W. K., & Petrosyan, L. A. (2005). Cooperative stochastic differential games. New York: Springer.

    Google Scholar 

  22. Jones, E. P. C., & Ward, P. A. S. (2006). Routing strategies for delay-tolerant networks. ACM SIGCOMM-Computer Communication Review (Online). http://ccng.uwaterloo.ca/~pasward/Publications/dtn-routing-survey.pdf.

Download references

Acknowledgments

The authors gratefully acknowledge the financial support from the Natural Science Foundation of Hebei Province of China under Grant No. F2013402039, the Scientific Research Foundation of the Higher Education Institutions of Hebei Province of China under Grant No. QN20131048, and the National Natural Science Foundation of China (NSFC) under Grants No. 61309033 and No. 61304131.

Author information

Authors and Affiliations

  1. School of Information and Electrical Engineering, Hebei University of Engineering, Handan, 056038, China

    Long Zhang & Wenjing Cao

  2. Institute of Power and Energy Efficiency, China Electric Power Research Institute, Beijing, 100192, China

    Wei Huang

  3. College of Computer and Information Engineering, Henan University of Economics and Law, Zhengzhou, 450002, China

    Xuna Miao

Authors
  1. Long Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xuna Miao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wenjing Cao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Long Zhang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, L., Huang, W., Miao, X. et al. The Impact of Storage Capacity Usage and Predictable Contact Schedule on Dynamic Routing for Opportunistic Deep Space Information Networks. Wireless Pers Commun 77, 1377–1395 (2014). https://doi.org/10.1007/s11277-013-1586-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-013-1586-x

Keywords

Search

Navigation