.png){kind=icon}
.png){kind=icon}
Return
Movable Antenna Array for Improving AAV Relaying Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/LWC.2025.3614489.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recently, movable antenna (MA) has become a prominent research topic in wireless communications due to the flexible mechanical movement. In this letter, a MA-assisted autonomous aerial vehicle (AAV) relaying framework is proposed, where the AAV relay delivers the information from a source node (SN) to multiple destination nodes (DNs). The goal is to maximize the total throughput of DNs, by jointly optimizing beamforming, time slot allocation, antenna position, and AAV trajectory. To solve the highly complex non-convex problem, we propose an efficient penalty-based alternating optimization algorithm. Specifically, the successive convex approximation technique is adopted to deal with the non-convex constraints, and the penalized method is exploited to handle the rank-one constraints. Numerical results demonstrate that the MA outperforms the conventional fixed-position antenna (FPA), and the proposed algorithm significantly enhances network throughput compared to other benchmark schemes.
Keywords:
Beamforming
movable antenna
trajectory design
AAV relay
Journal
I
IF:
5.5
Papers:
682
Citations:
0