李亦卿
+
Personal Information
-
Date of Birth:
1993-06-01 -
Date of Employment:
2022-07-12 -
School/Department:
计算机学院 -
Gender:
Female -
Status:
On-the-job -
Teacher College:
School of Computer Science
Other Contact Information:
-
Telephone:
34687a723eac0ff313e12e1c64d548b24049657e0822725911fd49c4d7e0e045de94f690f8c37dd615b2a231b0f4847ecf20bb716285bf38df482aa5aad5ef328382ebb5f545a96834645e2bef6d4615375af90c3672a5cbe989e4ea08ca6fa10b52c9e99cd7662d76d9ca28403b70616f778f610c6355fb53f5f18d0ff33949 -
Email:
7c15073ef83d586dff621380cf9eacbec4b3b23278f2bfd50ced17d3db6f84c91f3d93520204c62d47e6c6d0c0dba138c17dd050e755a10854f78da7035deaeaa558e1bb20387c9f8ae13fb5ab6cfd953aade14f6fb956e05fe35fffece1468e934c71093d919d2da740badbc12e00b398185bd189b79c881b804e8c6804f5d1
Paper Publications
Current position: Home > Scientific Research > Paper Publications
Joint Position and Time Allocation Optimization of UAV Enabled Time Allocation Optimization Networks
- Release time:2022-09-02
- Hits:
DOI number:
10.1109/TCOMM.2019.2896973Journal:
IEEE Transactions on CommunicationsAbstract:
In this paper, we investigate an unmanned aerial vehicle (UAV) enabled wireless powered communication network, where the UAV with constant power supply first charges all users by transmitting wireless energy to all users simultaneously, and after that all users send their own information to the UAV. Our target is the joint optimization of the time allocation as well as the position of the UAV to make the uplink sum achievable rate for all users as large as possible. To solve this non-convex problem, we first derive the analytic optimal solution of the time allocation, which is expressed as the function of UAV position. The original problem, after substituting the derived optimal time allocation, is reformulated as a new optimization problem whose optimization variable is only UAV position. We propose a sequential unconstrained convex minimization-based algorithm to obtain the globally optimal solution. The simulation results demonstrate that the performance of our proposed algorithm matches with that obtained by two-dimensional exhaustive search. To decrease the complexity, a Dinkelbach-based algorithm to obtain the locally optimal solution is also proposed. The simulation results show that the performances of our proposed two algorithms are superior to the schemes without time allocation optimization and/or position optimization.Co-author:
Li Yiqing,秦家银First Author:
jmiaoIndexed by:
Journal paperCorrespondence Author:
张旗Discipline:
EngineeringFirst-Level Discipline:
Information and Communication EngineeringDocument Type:
JPage Number:
3806–3816ISSN No.:
1558-0857Translation or Not:
noDate of Publication:
2019-05-01Included Journals:
SCILinks to published journals:
https://ieeexplore.ieee.org/document/8632980