Linlin Xu , Qi Zhu , Wenchao Xia , Jun Zhang , Gan Zheng , Hongbo Zhu
{"title":"Sum rate maximization in UAV-assisted data harvesting network supported by CF-mMIMO system exploiting statistical CSI","authors":"Linlin Xu , Qi Zhu , Wenchao Xia , Jun Zhang , Gan Zheng , Hongbo Zhu","doi":"10.1016/j.dcan.2024.06.009","DOIUrl":null,"url":null,"abstract":"<div><div>Unmanned Aerial Vehicles (UAVs) have been considered to have great potential in supporting reliable and timely data harvesting for Sensor Nodes (SNs) from an Internet of Things (IoT) perspective. However, due to physical limitations, UAVs are unable to further process the harvested data and have to rely on terrestrial servers, thus extra spectrum resource is needed to convey the harvested data. To avoid the cost of extra servers and spectrum resources, in this paper, we consider a UAV-based data harvesting network supported by a Cell-Free massive Multiple-Input-Multiple-Output (CF-mMIMO) system, where a UAV is used to collect and transmit data from SNs to the central processing unit of CF-mMIMO system for processing. In order to avoid using additional spectrum resources, the entire bandwidth is shared among radio access networks and wireless fronthaul links. Moreover, considering the limited capacity of the fronthaul links, the compress-and-forward scheme is adopted. In this work, in order to maximize the ergodically achievable sum rate of SNs, the power allocation of ground access points, the compression of fronthaul links, and also the bandwidth fraction between radio access networks and wireless fronthaul links are jointly optimized. To avoid the high overhead introduced by computing ergodically achievable rates, we introduce an approximate problem, using the large-dimensional random matrix theory, which relies only on statistical channel state information. We solve the nontrivial problem in three steps and propose an algorithm based on weighted minimum mean square error and Dinkelbach's methods to find solutions. Finally, simulation results show that the proposed algorithm converges quickly and outperforms the baseline algorithms.</div></div>","PeriodicalId":48631,"journal":{"name":"Digital Communications and Networks","volume":"11 4","pages":"Pages 1280-1292"},"PeriodicalIF":7.5000,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Digital Communications and Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2352864824000762","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
Unmanned Aerial Vehicles (UAVs) have been considered to have great potential in supporting reliable and timely data harvesting for Sensor Nodes (SNs) from an Internet of Things (IoT) perspective. However, due to physical limitations, UAVs are unable to further process the harvested data and have to rely on terrestrial servers, thus extra spectrum resource is needed to convey the harvested data. To avoid the cost of extra servers and spectrum resources, in this paper, we consider a UAV-based data harvesting network supported by a Cell-Free massive Multiple-Input-Multiple-Output (CF-mMIMO) system, where a UAV is used to collect and transmit data from SNs to the central processing unit of CF-mMIMO system for processing. In order to avoid using additional spectrum resources, the entire bandwidth is shared among radio access networks and wireless fronthaul links. Moreover, considering the limited capacity of the fronthaul links, the compress-and-forward scheme is adopted. In this work, in order to maximize the ergodically achievable sum rate of SNs, the power allocation of ground access points, the compression of fronthaul links, and also the bandwidth fraction between radio access networks and wireless fronthaul links are jointly optimized. To avoid the high overhead introduced by computing ergodically achievable rates, we introduce an approximate problem, using the large-dimensional random matrix theory, which relies only on statistical channel state information. We solve the nontrivial problem in three steps and propose an algorithm based on weighted minimum mean square error and Dinkelbach's methods to find solutions. Finally, simulation results show that the proposed algorithm converges quickly and outperforms the baseline algorithms.
期刊介绍:
Digital Communications and Networks is a prestigious journal that emphasizes on communication systems and networks. We publish only top-notch original articles and authoritative reviews, which undergo rigorous peer-review. We are proud to announce that all our articles are fully Open Access and can be accessed on ScienceDirect. Our journal is recognized and indexed by eminent databases such as the Science Citation Index Expanded (SCIE) and Scopus.
In addition to regular articles, we may also consider exceptional conference papers that have been significantly expanded. Furthermore, we periodically release special issues that focus on specific aspects of the field.
In conclusion, Digital Communications and Networks is a leading journal that guarantees exceptional quality and accessibility for researchers and scholars in the field of communication systems and networks.