Skip to main content
SpringerLink
Log in

Noncooperative Dynamic Routing with Bandwidth Constraint in Intermittently Connected Deep Space Information Networks Under Scheduled Contacts

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

The increasing world-wide demands in deep space scientific missions, such as Lunar, Mars and other Planetary Exploration, along with the rapidly growing advances in space communication technologies have triggered the vision of so called future Deep Space Information Networks (DSINs). The coined DSIN paradigm is envisioned to be an integrated high speed self-organizing hypernetwork consisting of the terrestrial ground-based information networks and the outer space-based entities to provide maximum network capacity. In this paper, we address the challenges of dynamic routing with bandwidth constraint over intermittently connected Deep Space Backbone Layer (DSBL) of DSINs under scheduled contacts. Firstly, we build up hypergraph model to represent DSBL aiming to improve network connectivity. Taking into account the continuous and random changes of selfish traffic along backbone links as well as the selfish forwarding of joint nodes, we propose a noncooperative dynamic routing model with bandwidth constraint, in which routing decision is related to the continuous-time resource usage. Our routing model includes two effective sub-models: stochastic differential game based noncooperative forwarding model with bandwidth constraints and contact schedule model. In addition, we provide a polynomial time algorithm to describe the procedure of our routing model. This algorithm covers three sub-algorithms considering three different cases based on hypergraph model, i.e., internal forwarding, cross-IS forwarding, cross-island forwarding. Theoretical analysis and numerical results demonstrate the effectiveness and feasibility of our routing model.

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

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. Geldzahler, B. (2009). Future DSN capabilities, [Online]. Available: http://www.spacepolicyonline.com/pages/images/stories/PSDS%20Sat%202%20Geldzahler-DSN.pdf.

  3. Weber, W. J., Cesarone, R. J., Miller, R. B., & Doms, P. E. (2002). A view of the future of NASA’s deep space network and associated systems. In Proceedings of SpaceOps 2002. Houston, TX, USA, October 2002.

  4. Gajurel, S. (2006). Space communication and dynamic routing solutions. Electrical Engineering and Computer Science, Case Western Reserve University. [Online]. Available: http://vorlon.case.edu/~sxg125/Projects/.

  5. 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, December 2010.

  6. Berge C. (1989) Hypergraphs. North-Holland Publishing, Amsterdam

    MATH  Google Scholar 

  7. 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 

  8. Cerf, V., Burleigh, S., Torgerson, L., Durst, R., Scott, K., Fall, K., et al. (2002). Delay-tolerant network architecture: the evolving Interplanetary Internet. Internet-Draft, IPN Research Group. [Online]. Available: http://www.ipnsig.org/reports/draft-irtf-ipnrg-arch-01.txt.

  9. Fall, K. (2003). A delay-tolerant network architecture for challenged internets. In Proceedings of the ACM SIGCOMM 2003 (pp. 27–34). Karlsruhe, Germany, August 2003.

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

  11. 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, June 2007.

  12. Jain, S., Fall, K., & Patra, R. (2004). Routing in a delay tolerant network. In Proc. ACM SIGCOMM 2004 (pp. 145–158). Portland, OR, USA, February 2004.

  13. 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 

  14. Tan, K., Zhang, Q., & Zhu, W. W. (2003). Shortest path routing in partially connected ad hoc networks. In Proceedings of the IEEE GLOBECOM 2003 (pp. 1038–1042). San Francisco, USA, August 2003.

  15. 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, June 2006.

  16. 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 

  17. 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, April 2006.

  18. 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 

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

  20. 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, January 2009.

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

    Google Scholar 

  22. Lin, L., Wang, A., Zhou, X., & Miao, X. (2010). Noncooperative differential game based efficiency-aware traffic assignment for multipath routing in CRAHN. Wireless Personal Communications, [Online]. Available: http://www.springerlink.com/content/l3264163407320u7/.

  23. Shannon, C. E. (1948). A mathematical theory of communication. The Bell System Technical Journal, 27, 379–423, 623–656

    Google Scholar 

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

    Google Scholar 

  25. Zwillinger D. (1997) Handbook of differential equations (3rd ed.). Academic Press, Amsterdam

    Google Scholar 

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

Download references

Author information

Authors and Affiliations

  1. Department of Communication Engineering, School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, 100083, China

    Long Zhang, Xianwei Zhou & Jiwen Guo

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

    Long Zhang

Authors
  1. Long Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xianwei Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiwen Guo
    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., Zhou, X. & Guo, J. Noncooperative Dynamic Routing with Bandwidth Constraint in Intermittently Connected Deep Space Information Networks Under Scheduled Contacts. Wireless Pers Commun 68, 1255–1285 (2013). https://doi.org/10.1007/s11277-012-0507-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-012-0507-8

Keywords

Search

Navigation