Trajectory Design for Fairness Enhancement in Movable Antennas-Aided Communications
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918461299490816 |
|---|---|
| author | Hu, Guojie Wu, Qingqing Zhu, Lipeng Xu, Kui Li, Guoxin Zheng, Tong-Xing |
| author_facet | Hu, Guojie Wu, Qingqing Zhu, Lipeng Xu, Kui Li, Guoxin Zheng, Tong-Xing |
| contents | Through adaptive antenna repositioning, the movable antenna (MA) technology enables on-demand reconfiguration of wireless channels, thereby creating an additional spatial degree of freedom in improving communication performance. This paper investigates a multiuser uplink communication system aided by MAs, where a base station (BS) equipped with multiple MAs serves multiple single-antenna users. Specifically, given that an optimized array geometry cannot guarantee rate fairness, we focus on designing antenna trajectory at the BS to maximize the minimum achievable rate among all users over a finite time period. The resulting optimization problem is fundamentally challenging to solve due to the continuous-time nature. To address it, we first examine an ideal case with infinitely fast MA movement and demonstrate that the relaxed problem can be optimally solved via the Lagrangian dual method. The obtained trajectory solution reveals that the BS should employ a finite set of MA deployment patterns, each allocated an optimal time duration. Building on this, we then study the general case with limited MA movement speed and propose a heuristic trajectory design inspired by the optimal patterns identified in the ideal scenario. Several insights are also gained by examining the simplified special case. Finally, numerical results are provided to validate the effectiveness of the proposed designs compared to competitive benchmarks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_20364 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Trajectory Design for Fairness Enhancement in Movable Antennas-Aided Communications Hu, Guojie Wu, Qingqing Zhu, Lipeng Xu, Kui Li, Guoxin Zheng, Tong-Xing Information Theory Through adaptive antenna repositioning, the movable antenna (MA) technology enables on-demand reconfiguration of wireless channels, thereby creating an additional spatial degree of freedom in improving communication performance. This paper investigates a multiuser uplink communication system aided by MAs, where a base station (BS) equipped with multiple MAs serves multiple single-antenna users. Specifically, given that an optimized array geometry cannot guarantee rate fairness, we focus on designing antenna trajectory at the BS to maximize the minimum achievable rate among all users over a finite time period. The resulting optimization problem is fundamentally challenging to solve due to the continuous-time nature. To address it, we first examine an ideal case with infinitely fast MA movement and demonstrate that the relaxed problem can be optimally solved via the Lagrangian dual method. The obtained trajectory solution reveals that the BS should employ a finite set of MA deployment patterns, each allocated an optimal time duration. Building on this, we then study the general case with limited MA movement speed and propose a heuristic trajectory design inspired by the optimal patterns identified in the ideal scenario. Several insights are also gained by examining the simplified special case. Finally, numerical results are provided to validate the effectiveness of the proposed designs compared to competitive benchmarks. |
| title | Trajectory Design for Fairness Enhancement in Movable Antennas-Aided Communications |
| topic | Information Theory |
| url | https://arxiv.org/abs/2604.20364 |