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

Towards a throughput-optimal routing algorithm for data collection on satellite networks

Author

Listed:
  • Jianzhou Chen
  • Lixiang Liu
  • Xiaohui Hu

Abstract

To perform Earth observation, more and more satellites are equipped with high-resolution sensors like hyperspectral imagers, which generate data at tens of Gbps. Researchers aim to maximize the volume of data available for use on the ground in near-real time. To achieve this goal, many solutions have recently been proposed to perform data collection through satellite networks. Most of these solutions have so far been focusing on either source rate control and load balancing, or heuristic routing. However, optimizing routing together with resources allocation is critical for improving delivery performance. In this paper, we challenge the fact that transmission paths have to be built under high link variability with limited resources, and develop a throughput-optimal solution based on the utility maximization framework. For delay performance, we embed a distance factor into the objective of the framework and derive a geographic-location-aware backpressure algorithm. Further, we exploit transmission opportunities missed by backpressure-type algorithms to accelerate data transfer. The simulation results show that our algorithms are able to deliver large volumes of data in time, and scale well in all scenarios tested.

Suggested Citation

  • Jianzhou Chen & Lixiang Liu & Xiaohui Hu, 2016. "Towards a throughput-optimal routing algorithm for data collection on satellite networks," International Journal of Distributed Sensor Networks, , vol. 12(7), pages 15501477166, July.
    • Handle: RePEc:sae:intdis:v:12:y:2016:i:7:p:1550147716658608
    DOI: 10.1177/1550147716658608
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147716658608
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147716658608?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:12:y:2016:i:7:p:1550147716658608. 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.