Towards a throughput-optimal routing algorithm for data collection on satellite networks
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 hav...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2016-07-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147716658608 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832547174977634304 |
|---|---|
| author | Jianzhou Chen Lixiang Liu Xiaohui Hu |
| author_facet | Jianzhou Chen Lixiang Liu Xiaohui Hu |
| author_sort | Jianzhou Chen |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-be7ac3a4094a49b593a97275124fe456 |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2016-07-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-be7ac3a4094a49b593a97275124fe4562025-02-03T06:45:40ZengWileyInternational Journal of Distributed Sensor Networks1550-14772016-07-011210.1177/1550147716658608Towards a throughput-optimal routing algorithm for data collection on satellite networksJianzhou Chen0Lixiang Liu1Xiaohui Hu2University of Chinese Academy of Science, Institute of Software Chinese Academy of Science, Beijing, ChinaInstitute of Software Chinese Academy of Science, Beijing, ChinaInstitute of Software Chinese Academy of Science, Beijing, ChinaTo 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.https://doi.org/10.1177/1550147716658608 |
| spellingShingle | Jianzhou Chen Lixiang Liu Xiaohui Hu Towards a throughput-optimal routing algorithm for data collection on satellite networks International Journal of Distributed Sensor Networks |
| title | Towards a throughput-optimal routing algorithm for data collection on satellite networks |
| title_full | Towards a throughput-optimal routing algorithm for data collection on satellite networks |
| title_fullStr | Towards a throughput-optimal routing algorithm for data collection on satellite networks |
| title_full_unstemmed | Towards a throughput-optimal routing algorithm for data collection on satellite networks |
| title_short | Towards a throughput-optimal routing algorithm for data collection on satellite networks |
| title_sort | towards a throughput optimal routing algorithm for data collection on satellite networks |
| url | https://doi.org/10.1177/1550147716658608 |
| work_keys_str_mv | AT jianzhouchen towardsathroughputoptimalroutingalgorithmfordatacollectiononsatellitenetworks AT lixiangliu towardsathroughputoptimalroutingalgorithmfordatacollectiononsatellitenetworks AT xiaohuihu towardsathroughputoptimalroutingalgorithmfordatacollectiononsatellitenetworks |