Joint User Pairing and Resource Allocation in Air-to-Ground Communication-Caching-Charging Integrated Network Based on NOMA

被引:10
作者
Yin, Yue [1 ]
Gui, Guan [1 ]
Liu, Miao [1 ]
Gacanin, Haris [2 ]
Sari, Hikmet [1 ]
Adachi, Fumiyuki [3 ]
机构
[1] Nanjing Univ Posts & Telecommun, Coll Telecommun & Informat Engn, Nanjing 210003, Peoples R China
[2] Rhein Westfal TH Aachen, Inst Commun Technol & Embedded Syst, D-52062 Aachen, Germany
[3] Tohoku Univ, Int Res Inst Disaster Sci IRIDeS, Sendai 9808577, Japan
关键词
Air-to-ground networks; wireless caching networks; wireless power transfer; non-orthogonal multiple access; resource allocation; WIRELESS POWER TRANSFER; THROUGHPUT MAXIMIZATION; OPTIMIZATION; DESIGN;
D O I
10.1109/TVT.2023.3291174
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
To provide seamless wireless coverage, the air-to-ground (A2G) heterogeneous wireless network is considered as one of the most promising solutions. In this article, we develop a novel A2G communication-caching-charging (3C) integrated network based on non-orthogonal multiple access (NOMA). As a significant participant of A2G network, unmanned aerial vehicle (UAV), which harvests energy from the base station (BS) with the aid of wireless power transfer (WPT), is utilized as content server to cache files and serve users. To be specific, we first propose a resource allocation strategy to enhance the quality of service (QoS) of ground users. The goal is to minimize the transmission latency of ground users, which is decomposed into sub-problems, such as user pairing, files' power allocation and users' power allocation. Firstly, we propose a NOMA user pairing algorithm based on K-means to deploy UAVs and pair users. Then, the closed-form solution for files' power allocation with the goal of maximizing the duration for energy harvesting is formulated. Finally, we apply the genetic algorithm (GA) to obtain power allocation factors to increase users' rate and the reminder time of content delivery phase is utilized for energy harvesting. Simulation results validate the advantage of the proposed strategy in reducing user delay than benchmark schemes.
引用
收藏
页码:15819 / 15828
页数:10
相关论文
共 49 条
[11]   Clustering by passing messages between data points [J].
Frey, Brendan J. ;
Dueck, Delbert .
SCIENCE, 2007, 315 (5814) :972-976
[12]   Optimal and Suboptimal Dynamic Cache Update Algorithms for Wireless Cellular Networks [J].
Fu, Yaru ;
Liu, Jianqing ;
Ke, Junming ;
Chui, John Kwok Tai ;
Hung, Kevin King Fai .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2022, 11 (12) :2610-2614
[13]   Energy-Aware Coded Transmission Strategy for Hierarchical Cooperative Caching Networks [J].
Gu, Shushi ;
Yu, Zichao ;
Zhang, Qinyu ;
Huang, Tao .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2023, 12 (01) :178-182
[14]  
Gui G, 2019, IEEE COMMUN LETT, V23, P1267, DOI [10.1109/LCOMM.2019.2916398, 10.1109/lcomm.2019.2916398]
[15]   Online computation offloading and trajectory scheduling for UAV-enabled wireless powered mobile edge computing [J].
Hu, Han ;
Zhou, Xiang ;
Wang, Qun ;
Hu, Rose Qingyang .
CHINA COMMUNICATIONS, 2022, 19 (04) :257-273
[16]   Sum-Rate Maximization for UAV Aided Wireless Power Transfer in Space-Air-Ground Networks [J].
Jia, Huaiqi ;
Wang, Ying ;
Liu, Man ;
Chen, Yuanbin .
IEEE ACCESS, 2020, 8 :216231-216244
[17]  
Kim H, 2020, I C INF COMM TECH CO, P30, DOI [10.1109/ICTC49870.2020.9289287, 10.1109/ictc49870.2020.9289287]
[18]   End-to-End Delay Analysis in mmWave UAV-assisted Wireless Caching Networks [J].
Liao, Kai-Min ;
Chen, Guan-Yi ;
Chen, Yu-Jia ;
Chen, Yung-Fang .
2020 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE WORKSHOPS (WCNCW), 2020,
[19]   Energy-Efficient Activation and Uplink Transmission for Cellular IoT [J].
Liu, Chun-Hung ;
Shen, Yu-Han ;
Lee, Chia-Han .
IEEE INTERNET OF THINGS JOURNAL, 2020, 7 (02) :906-921
[20]   Joint Dynamic Task Offloading and Resource Scheduling for WPT Enabled Space-Air-Ground Power Internet of Things [J].
Liu, Jiayan ;
Zhao, Xiongwen ;
Qin, Peng ;
Geng, Suiyan ;
Meng, Sachula .
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2022, 9 (02) :660-677