IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i24p3293-d705308.html
   My bibliography  Save this article

An Efficient Satellite Resource Cooperative Scheduling Method on Spatial Information Networks

Author

Listed:
  • Huilong Fan

    (School of Computer Science and Engineering, Central South University, Changsha 410075, China
    Network Resource Management and Trust Evaluation Key Laboratory of Hunan, Changsha 410075, China
    Joint Laboratory of Space Information System, Changsha 410075, China)

  • Zhan Yang

    (Network Resource Management and Trust Evaluation Key Laboratory of Hunan, Changsha 410075, China
    Big Data Institute, Central South University, Changsha 410075, China)

  • Shimin Wu

    (School of Computer Science and Engineering, Central South University, Changsha 410075, China
    Network Resource Management and Trust Evaluation Key Laboratory of Hunan, Changsha 410075, China
    Joint Laboratory of Space Information System, Changsha 410075, China)

  • Xi Zhang

    (School of Computer Science and Engineering, Central South University, Changsha 410075, China
    Network Resource Management and Trust Evaluation Key Laboratory of Hunan, Changsha 410075, China
    Joint Laboratory of Space Information System, Changsha 410075, China)

  • Jun Long

    (Network Resource Management and Trust Evaluation Key Laboratory of Hunan, Changsha 410075, China
    Big Data Institute, Central South University, Changsha 410075, China)

  • Limin Liu

    (School of Computer Science and Engineering, Central South University, Changsha 410075, China
    Network Resource Management and Trust Evaluation Key Laboratory of Hunan, Changsha 410075, China
    Joint Laboratory of Space Information System, Changsha 410075, China)

Abstract

To overcome the low timeliness of resource scheduling problems in spatial information networks, we propose a method based on a dynamic reconstruction of resource request queues and the autonomous coordinated scheduling of resources. First, we construct a small satellite network and combine the graph maximum flow theory to solve the link resource planning problem during inter-satellite data transmission. In addition, we design a multi-satellite resource scheduling algorithm with minimal time consumption based on graph theory. The algorithm is based on graph theory to reallocate the resource request queue to satellites with idle processing resources. Finally, we simulate the efficient resource scheduling capability in the spatial information network and empirically compare our approaches against two representative swarm intelligence baseline approaches and show that our approach has significant advantages in terms of performance and time consumption during resource scheduling.

Suggested Citation

  • Huilong Fan & Zhan Yang & Shimin Wu & Xi Zhang & Jun Long & Limin Liu, 2021. "An Efficient Satellite Resource Cooperative Scheduling Method on Spatial Information Networks," Mathematics, MDPI, vol. 9(24), pages 1-23, December.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:24:p:3293-:d:705308
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/24/3293/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/24/3293/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. William J. Wolfe & Stephen E. Sorensen, 2000. "Three Scheduling Algorithms Applied to the Earth Observing Systems Domain," Management Science, INFORMS, vol. 46(1), pages 148-166, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xiuhong Li & Jiale Yang & Huilong Fan, 2023. "Dynamic Network Resource Autonomy Management and Task Scheduling Method," Mathematics, MDPI, vol. 11(5), pages 1-19, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mahalec, Vladimir & Chen, Yingwu & Liu, Xiaolu & He, Renjie & Sun, Kai, 2015. "Reconfiguration of satellite orbit for cooperative observation using variable-size multi-objective differential evolutionAuthor-Name: Chen, Yingguo," European Journal of Operational Research, Elsevier, vol. 242(1), pages 10-20.
    2. Manahov, Viktor & Urquhart, Andrew, 2021. "The efficiency of Bitcoin: A strongly typed genetic programming approach to smart electronic Bitcoin markets," International Review of Financial Analysis, Elsevier, vol. 73(C).
    3. Zhang Ye & Hu Xiaoxuan & Zhu Waiming & Jin Peng, 2018. "Solving the Observing and Downloading Integrated Scheduling Problem of Earth Observation Satellite with a Quantum Genetic Algorithm," Journal of Systems Science and Information, De Gruyter, vol. 6(5), pages 399-420, October.
    4. J-F Cordeau & G Laporte, 2005. "Maximizing the value of an Earth observation satellite orbit," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 962-968, August.
    5. Chen, Xiaoyu & Reinelt, Gerhard & Dai, Guangming & Spitz, Andreas, 2019. "A mixed integer linear programming model for multi-satellite scheduling," European Journal of Operational Research, Elsevier, vol. 275(2), pages 694-707.
    6. Türsel Eliiyi, Deniz & Azizoglu, Meral, 2011. "Heuristics for operational fixed job scheduling problems with working and spread time constraints," International Journal of Production Economics, Elsevier, vol. 132(1), pages 107-121, July.
    7. Bianchessi, Nicola & Cordeau, Jean-Francois & Desrosiers, Jacques & Laporte, Gilbert & Raymond, Vincent, 2007. "A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites," European Journal of Operational Research, Elsevier, vol. 177(2), pages 750-762, March.
    8. Kaiping Luo, 2015. "Space‐Based Infrared Sensor Scheduling with High Uncertainty: Issues and Challenges," Systems Engineering, John Wiley & Sons, vol. 18(1), pages 102-113, January.
    9. Bekki, Özgün BarIs & Azizoglu, Meral, 2008. "Operational fixed interval scheduling problem on uniform parallel machines," International Journal of Production Economics, Elsevier, vol. 112(2), pages 756-768, April.
    10. Orhan Karasakal & Levent Kandiller & Nur Evin Özdemirel, 2011. "A branch and bound algorithm for sector allocation of a naval task group," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(7), pages 655-669, October.
    11. Jie Chun & Wenyuan Yang & Xiaolu Liu & Guohua Wu & Lei He & Lining Xing, 2023. "Deep Reinforcement Learning for the Agile Earth Observation Satellite Scheduling Problem," Mathematics, MDPI, vol. 11(19), pages 1-20, September.
    12. Philippe Monmousseau, 2021. "Scheduling of a Constellation of Satellites: Creating a Mixed-Integer Linear Model," Journal of Optimization Theory and Applications, Springer, vol. 191(2), pages 846-873, December.
    13. Valicka, Christopher G. & Garcia, Deanna & Staid, Andrea & Watson, Jean-Paul & Hackebeil, Gabriel & Rathinam, Sivakumar & Ntaimo, Lewis, 2019. "Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty," European Journal of Operational Research, Elsevier, vol. 275(2), pages 431-445.
    14. Jang, Jinbong & Choi, Jiwoong & Bae, Hee-Jin & Choi, In-Chan, 2013. "Image collection planning for KOrea Multi-Purpose SATellite-2," European Journal of Operational Research, Elsevier, vol. 230(1), pages 190-199.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:24:p:3293-:d:705308. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.