Sum-rate maximization for UAV-enabled two-way relay systems

In this paper, an Unmanned Aerial Vehicle (UAV)-enabled two-way relay system with Physical-layer Network Coding (PNC) protocol is considered. A rotary-wing UAV is applied as a mobile relay to assist two ground terminals for information interaction. Our goal is to maximize the sum-rate of the two-way...

Full description

Saved in:
Bibliographic Details
Published in:Digital communications and networks Vol. 8; no. 6; pp. 1105 - 1114
Main Authors: Lu, Keju, Wu, Fahui, Xiao, Lin, Liang, Yipeng, Yang, Dingcheng
Format: Journal Article
Language:English
Published: Elsevier B.V 01.12.2022
Information Engineering School,Nanchang University,Nanchang,330031,China
KeAi Communications Co., Ltd
Subjects:
Time slot pairing
Trajectory design
Two-way relay
UAV communication
UAV communication
Time slot pairing
Two-way relay
Trajectory design
ISSN:2352-8648, 2352-8648
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, an Unmanned Aerial Vehicle (UAV)-enabled two-way relay system with Physical-layer Network Coding (PNC) protocol is considered. A rotary-wing UAV is applied as a mobile relay to assist two ground terminals for information interaction. Our goal is to maximize the sum-rate of the two-way relay system subject to mobility constraints, propulsion power consumption constraints, and transmit power constraints. The formulated problem is not easy to solve directly because it is a mixed integer non-convex optimization problem. Therefore, we decompose it into three sub-problems, and use the mutation arithmetic of the Genetic Algorithm (GA) and Successive Convex Approximation (SCA) to dispose. Besides, a high-efficiency iterative algorithm is proposed to obtain a locally optimal solution by jointly optimizing the time slot pairing, the transmit power allocation, and the UAV trajectory design. Numerical results demonstrate that the proposed design achieves significant gains over the benchmark designs.
ISSN:2352-8648
2352-8648
DOI:10.1016/j.dcan.2022.03.012