Skip to main content
SpringerLink
Log in

Enhanced time-expanded graph for space information network modeling

  • Research Paper
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

Space information networks (SINs) are responsible for communications, information processing, and earth observation. Traditional time-expanded graphs (TEG) cannot represent the observation, energy, and transceiver resources. Therefore, we propose the enhanced time-expanded graph (ETEG) to jointly model the resource elements of SINs. First, we utilize snapshot graphs to characterize the time-varying properties of the resources. Next, we introduce virtual links and nodes to enhance the TEG, which transforms the transceiver and observation resource constraints into normal capacity and flow conservation ones and simplifies the energy constraints. Then, the maximum flow algorithm is modified to optimally schedule the data flow in SIN. With the ETEG-based maximum flow algorithm, the resources can be jointly optimally scheduled. Finally, the simulation results demonstrate the efficiency and effectiveness of our ETEG.

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.

Similar content being viewed by others

References

  1. Sheng M, Zhou D, Liu R Z, et al. Resource mobility in space information networks: opportunities, challenges, and approaches. IEEE Netw, 2019, 33: 128–135

    Article  Google Scholar 

  2. Du J, Jiang C X, Guo Q, et al. Cooperative earth observation through complex space information networks. IEEE Wirel Commun, 2016, 23: 136–144

    Article  Google Scholar 

  3. Zhang T, Li J D, Li H Y, et al. Application of time-varying graph theory over the space information networks. IEEE Netw, 2020, 34: 179–185

    Article  Google Scholar 

  4. Jiang C X, Wang X X, Wang J, et al. Security in space information networks. IEEE Commun Mag, 2015, 53: 82–88

    Article  Google Scholar 

  5. Fortz B, Rexford J, Thorup M. Traffic engineering with traditional IP routing protocols. IEEE Commun Mag, 2002, 40: 118–124

    Article  Google Scholar 

  6. Guerin R A, Orda A, Williams D. QoS routing mechanisms and OSPF extensions. In: Proceedings of IEEE Global Telecommunications Conference, Phoenix, 1997. 1903–1908

  7. Liu R Z, Sheng M, Lui K S, et al. An analytical framework for resource-limited small satellite networks. IEEE Commun Lett, 2016, 20: 388–391

    Article  Google Scholar 

  8. Zhou D, Sheng M, Wang X J, et al. Mission aware contact plan design in resource-limited small satellite networks. IEEE Trans Commun, 2017, 65: 2451–2466

    Article  Google Scholar 

  9. Wang Y, Sheng M, Zhuang W H, et al. Multi-resource coordinate scheduling for earth observation in space information networks. IEEE J Sel Areas Commun, 2018, 36: 268–279

    Article  Google Scholar 

  10. Huang J H, Su Y X, Huang L, et al. An optimized snapshot division strategy for satellite network in GNSS. IEEE Commun Lett, 2016, 20: 2406–2409

    Article  Google Scholar 

  11. Shi K Y, Zhang X S, Zhang S, et al. Time-expanded graph based energy-efficient delay-bounded multicast over satellite networks. IEEE Trans Veh Technol, 2020, 69: 10380–10384

    Article  Google Scholar 

  12. Wang P, Zhang X S, Zhang S, et al. Time-expanded graph-based resource allocation over the satellite networks. IEEE Wirel Commun Lett, 2019, 8: 360–363

    Article  Google Scholar 

  13. Jiang C X, Zhu X M. Reinforcement learning based capacity management in multi-layer satellite networks. IEEE Trans Wirel Commun, 2020, 19: 4685–4699

    Article  Google Scholar 

  14. George B, Shekhar S. Time-aggregated graphs for modeling spatio-temporal networks. In: Proceedings of Time-Aggregated Graphs for Modeling Spatio-Temporal Networks, 2006. 85–99

  15. Li H Y, Zhang T, Zhang Y K, et al. A maximum flow algorithm based on storage time aggregated graph for delay-tolerant networks. Ad Hoc Netw, 2017, 59: 63–70

    Article  Google Scholar 

  16. Zhang T, Li H Y, Zhang S, et al. STAG-based QoS support routing strategy for multiple missions over the satellite networks. IEEE Trans Commun, 2019, 67: 6912–6924

    Article  Google Scholar 

  17. Zhang T, Li H Y, Li J D, et al. A dynamic combined flow algorithm for the two-commodity max-flow problem over delay-tolerant networks. IEEE Trans Wirel Commun, 2018, 17: 7879–7893

    Article  Google Scholar 

  18. Zhang Z Q, Jiang C X, Guo S, et al. Temporal centrality-balanced traffic management for space satellite networks. IEEE Trans Veh Technol, 2018, 67: 4427–4439

    Article  Google Scholar 

  19. Goldberg A V, Tarjan R E. Efficient maximum flow algorithms. Commun ACM, 2014, 57: 82–89

    Article  Google Scholar 

  20. Li P Y, Li J D, Li H Y, et al. Graph based task scheduling algorithm for earth observation satellites. In: Proceedings of IEEE Global Communications Conference, Abu Dhabi, 2018

  21. Ravindra K A, Thomas L M, James B O, Network flows — theory, algorithms and applications. J Oper Res Soc, 1993, 45: 791–796

    Google Scholar 

  22. Chen X J, Wan J X. Development status and proposals for multi-beam antennas of communication satellites. Space Elect Technol, 2016, 2: 54–60

    Google Scholar 

  23. Ren J Q, Zhou H G, Zhou N, et al. Application of phased array anttena and fixed multibeam antennna in communications satellite systems. Space Int, 2015, 11: 55–60

    Google Scholar 

  24. Ford L R J, Fulkerson D R. Constructing maximal dynamic flows from static flows. Oper Res, 1958, 6: 419–433

    Article  MathSciNet  MATH  Google Scholar 

  25. Yang Y, Xu M W, Wang D, et al. Towards energy-efficient routing in satellite networks. IEEE J Sel Areas Commun, 2016, 34: 3869–3886

    Article  Google Scholar 

  26. Tian Y R, Lu X C, Huang F J. Design and performance analysis of inter-satellite link in multilayer satellite network (in Chinese). J Time Freq, 2010, 33: 140–145

    Google Scholar 

  27. Diamond S, Boyd S. CVXPY: a python-embedded modeling language for convex optimization. J of Machi Lear Res, 2016, 17: 1–5

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by National Natural Science Foundation of China (Grant No. 61871456).

Author information

Authors and Affiliations

  1. State Key Laboratory of Integrated Service Networks, Xidian University, Xi’an, 710071, China

    Jiandong Li, Peng Wang, Hongyan Li & Keyi Shi

Authors
  1. Jiandong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hongyan Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Keyi Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peng Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, J., Wang, P., Li, H. et al. Enhanced time-expanded graph for space information network modeling. Sci. China Inf. Sci. 65, 192301 (2022). https://doi.org/10.1007/s11432-020-3202-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-020-3202-2

Keywords

Search

Navigation