IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v17y2021i7p15501477211033764.html
   My bibliography  Save this article

BeiDou satellites cross-regional communication path assignment model and resource management

Author

Listed:
  • Sheng Liu
  • Di Wu
  • Lanyong Zhang

Abstract

Time division inter-satellite communication and ranging link assignment of BeiDou satellites have made important progress; however, there is still the unsolved issue of integrated communication between ground gateway, aircraft, or even ship, and the BeiDou satellites. Therefore, in this study, we develop a path assignment model based on the idea of clustering and Markov chain. The optimal path is determined by the objective function based on the maximum transition probability. The transition probability takes into account the communication environment, congestion status, aircraft mobility, and reduces the complexity of path assignment by hiding the topology in the region. At the same time, due to the limited resources of onboard computing, storage and bandwidth, we also design a resource management strategy based on task urgency, aimed at minimizing the unreasonable allocation index, to enable the readjustment of link application resources. Finally, the performance of the model and the strategy in average link handover times, link reliability, resource allocation fairness, and network quality of service is determined by simulation.

Suggested Citation

  • Sheng Liu & Di Wu & Lanyong Zhang, 2021. "BeiDou satellites cross-regional communication path assignment model and resource management," International Journal of Distributed Sensor Networks, , vol. 17(7), pages 15501477211, July.
  • Handle: RePEc:sae:intdis:v:17:y:2021:i:7:p:15501477211033764
    DOI: 10.1177/15501477211033764
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/15501477211033764
    Download Restriction: no

    File URL: https://libkey.io/10.1177/15501477211033764?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:sae:intdis:v:17:y:2021:i:7:p:15501477211033764. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: SAGE Publications (email available below). General contact details of provider: .

    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.