{"title":"Data-driven resource allocation for ensuring remote data collection timeliness in integrated ground-air-space networks","authors":"Jinsong Gui , Hanjian Liu","doi":"10.1016/j.comnet.2025.111715","DOIUrl":null,"url":null,"abstract":"<div><div>Ensuring remote data collection timeliness without terrestrial network infrastructure support is a huge challenge. The exploration of addressing this challenge with the aid of opportunistic unmanned aerial vehicles (UAVs) and satellites has received extensive attention. In this paper, we address a data-driven resource allocation problem, which aims to ensure data collection timeliness, minimize communication resource waste, and maximize data collection amount under the UAVs’ opportunistic access mode and satellites’ random access mode. However, due to UAVs’ dynamic behaviors, time-varying data collection missions, real-time matching demand between ground nodes and UAVs, and free competition of UAV-satellite access resources, it will be difficult to achieve the above goal if it is considered as a global optimization problem. Thus, we construct three problems in turn that collectively describe the requirements of above goal, and then reformulate the first two problems as the Markov decision process models and take deep reinforcement learning tools to get the corresponding solutions, respectively. Next, the solution to the third problem is approximated by alternately invoking the algorithms of the first two problems. Finally, our simulation results are compared with those of other benchmark schemes from different perspectives, and the effectiveness and superiority of the presented solutions are verified.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"272 ","pages":"Article 111715"},"PeriodicalIF":4.6000,"publicationDate":"2025-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625006814","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
Abstract
Ensuring remote data collection timeliness without terrestrial network infrastructure support is a huge challenge. The exploration of addressing this challenge with the aid of opportunistic unmanned aerial vehicles (UAVs) and satellites has received extensive attention. In this paper, we address a data-driven resource allocation problem, which aims to ensure data collection timeliness, minimize communication resource waste, and maximize data collection amount under the UAVs’ opportunistic access mode and satellites’ random access mode. However, due to UAVs’ dynamic behaviors, time-varying data collection missions, real-time matching demand between ground nodes and UAVs, and free competition of UAV-satellite access resources, it will be difficult to achieve the above goal if it is considered as a global optimization problem. Thus, we construct three problems in turn that collectively describe the requirements of above goal, and then reformulate the first two problems as the Markov decision process models and take deep reinforcement learning tools to get the corresponding solutions, respectively. Next, the solution to the third problem is approximated by alternately invoking the algorithms of the first two problems. Finally, our simulation results are compared with those of other benchmark schemes from different perspectives, and the effectiveness and superiority of the presented solutions are verified.
期刊介绍:
Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.