Skip to main content

Two-Stage Task Planning Based on Resource Interchange in Space Information Networks

  • Conference paper
  • First Online:
Communications and Networking (ChinaCom 2020)

Abstract

The high computational complexity and the mismatch between the space-time distribution of tasks and resources raise great challenges on task planning in space information networks (SINs). This paper studies the task planning problem in SINs by exploiting resource interchange to handle the bottleneck resources. First of all, we use time-varying resource graph to capture the dynamic coordination relationship among resources in SIN. Then, we explore resource interchange and derive its quantitative condition. On this basis, an optimization model for task planning based on resource interchange is formulated. Furthermore, we decompose the task planning problem into two stages for global optimization and local adjustment, and develop the algorithms respectively. Finally, simulation results show that compared with existing works the proposed algorithm strikes a better balance between the number of completed tasks and computational complexity.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Yu, Q., Meng, W., Yang, M.: Virtual multi-beamforming for distributed satellite clusters in space information networks. IEEE Wirel. Commun. 23(1), 95–101 (2016)

    Article  Google Scholar 

  2. Jiang, C., Wang, X., Wang, J.: Security in space information networks. IEEE Commun. Mag. 53(8), 82–88 (2015)

    Article  Google Scholar 

  3. Zhang, Z., Jiang, C., Guo, S.: Temporal centrality-balanced traffic management for space satellite networks. IEEE Trans. Veh. Technol. 67(5), 4427–4439 (2018)

    Article  Google Scholar 

  4. Wang, Y., Sheng, M., Zhuang, W.: Multi-resource coordinate scheduling for earth observation in space information networks. IEEE J. Sel. Areas Commun. 36(2), 268–279 (2018)

    Article  Google Scholar 

  5. Deng, B., Jiang, C., Kuang, L.: Two-phase task scheduling in data relay satellite systems. IEEE Trans. Veh. Technol. 67(2), 1782–1793 (2017)

    Article  Google Scholar 

  6. Sheng, M., Zhou, D., Liu, R.: Resource mobility in space information networks: opportunities, challenges, and approaches. IEEE Network 33(1), 128–135 (2019)

    Article  Google Scholar 

  7. Mast, A.W.: Reconfigurable software defined payload architecture that reduces cost and risk for various missions. In: IEEE Aerospace Conference 2011, pp. 1–5 (2011)

    Google Scholar 

  8. Zhu, Y., Liu, R., Sheng, M.: Utilization and analysis of resource mobility in space information networks. J. Commun. Inf. Netw. 4(1), 67–77 (2019)

    Google Scholar 

  9. Liu, R., Zhu, Y., Zhang, Y.: Resource mobility aware hybrid task planning in space information networks. J. Commun. Inf. Netw. 4(4), 107–116 (2019)

    Google Scholar 

  10. Jia, Z., Sheng, M., Li, J.: Joint optimization of VNF deployment and routing in software defined satellite networks. In: IEEE 88th Vehicular Technology Conference (VTC-Fall) 2018, pp. 1–5 (2018)

    Google Scholar 

  11. Zhu, W., Hu, X., Xia, W.: A two-phase genetic annealing method for integrated earth observation satellite scheduling problems. Soft. Comput. 23(1), 181–196 (2019)

    Article  Google Scholar 

  12. Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)

    MATH  Google Scholar 

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

    Article  Google Scholar 

  14. Bertsekas, D.P.: Nonlinear programming. J. Oper. Res. Soc. 48(3), 334–334 (1997)

    Article  MathSciNet  Google Scholar 

  15. Garey, M.R., Johoson, D.S.: Computers and Intractability. W. H. Freeman, New York (2002)

    Google Scholar 

  16. Gibbons, A.: Algorithmic Graph Theory. Cambridge University Press, Cambridge (1985)

    MATH  Google Scholar 

Download references

Acknowledgement

This work is supported by the National Natural Science Foundation of China (61701365, 61801365, 61971327 and 62001347), China Postdoctoral Science Foundation (2018M643581, 2019TQ0241 and 2020M673344), Natural Science Foundation of Shaanxi Province (2019JQ-152, 2020JQ-686), Young Talent fund of University Association for Science and Technology in Shaanxi, China (20200112), Postdoctoral Foundation in Shaanxi Province of China, and the Fundamental Research Funds for the Central Universities.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Weihua Wu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Liu, R., Li, J., Ji, X., Wu, W., Zhou, D., Zhang, Y. (2021). Two-Stage Task Planning Based on Resource Interchange in Space Information Networks. In: Gao, H., Fan, P., Wun, J., Xiaoping, X., Yu, J., Wang, Y. (eds) Communications and Networking. ChinaCom 2020. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 352. Springer, Cham. https://doi.org/10.1007/978-3-030-67720-6_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-67720-6_44

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-67719-0

  • Online ISBN: 978-3-030-67720-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics