TY - JOUR
T1 - Energy-effective offloading scheme in UAV-assisted C-RAN system
AU - Li, Xingquan
AU - Zhang, Chiya
AU - Zhao, Rujun
AU - He, Chunlong
AU - Zheng, Hongxia
AU - Wang, Kezhi
N1 - Funding information: This work was supported by National Natural Science Foundation of China under Grant 62101161 and 61801302, in part by the Shenzhen Basic Research Program under Grant 20200811192821001 and JCYJ20190808122409660, in part by the Guangdong Basic Research Program under Grant 2019A1515110358, 2021A1515012097, 2020ZDZX1037, 2020ZDZX1021, in part by Shenzhen Stabilization Support Grant 20200809153412001, in part by the open research fund of National Mobile Communications Research Laboratory, Southeast University (No. 2021D16 and No. 2022D02).
PY - 2022/7/1
Y1 - 2022/7/1
N2 - In this paper, we aim to minimize the total power of all the Internet of Things devices (IoTDs) by jointly optimizing user association, computation capacity, transmit power, and the location of unmanned aerial vehicles (UAVs) in an UAV-assisted cloud radio access network (C-RAN). In order to solve this non-convex problem, we propose an effective algorithm by solving four subproblems iteratively. For the user association and the computation capacity subproblems, the non-convex constraints are relaxed and the optimal solutions are obtained. For the transmit power control and the location planning subproblems, successive convex approximation (SCA) technique is used to transform the non-convex constraints into convex ones. Moreover, to obtain the suboptimal solutions, slack variables are also introduced to deal with the feasibility-check problems. The simulation results demonstrate that the proposed algorithm can greatly reduce the total power consumption of IoTDs.
AB - In this paper, we aim to minimize the total power of all the Internet of Things devices (IoTDs) by jointly optimizing user association, computation capacity, transmit power, and the location of unmanned aerial vehicles (UAVs) in an UAV-assisted cloud radio access network (C-RAN). In order to solve this non-convex problem, we propose an effective algorithm by solving four subproblems iteratively. For the user association and the computation capacity subproblems, the non-convex constraints are relaxed and the optimal solutions are obtained. For the transmit power control and the location planning subproblems, successive convex approximation (SCA) technique is used to transform the non-convex constraints into convex ones. Moreover, to obtain the suboptimal solutions, slack variables are also introduced to deal with the feasibility-check problems. The simulation results demonstrate that the proposed algorithm can greatly reduce the total power consumption of IoTDs.
KW - C-RAN
KW - location planning
KW - power control
KW - resource allocation
KW - unmanned aerial vehicle (UAV)-assisted communication
KW - user association
UR - http://www.scopus.com/inward/record.url?scp=85133292836&partnerID=8YFLogxK
U2 - 10.1109/JIOT.2021.3126290
DO - 10.1109/JIOT.2021.3126290
M3 - Article
SN - 2327-4662
VL - 9
SP - 10821
EP - 10832
JO - IEEE Internet of Things Journal
JF - IEEE Internet of Things Journal
IS - 13
ER -