Metraipolis › archive › dc_37c0daefa6bc
Trajectory Design and User Scheduling for Pinching-Antenna Systems — arXiv:2611.01324
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01324
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:55:07.859Z
- SHA-256 of the archived text
5b32fa2c231cca240e3cb0623ab03f29f447bd524caa45cfbc4ea8e10304a474- Stable URL of this page
https://metraipolis.com/documento/dc_37c0daefa6bc
How to cite
Trajectory Design and User Scheduling for Pinching-Antenna Systems — arXiv:2611.01324 — arXiv (en), https://arxiv.org/abs/2611.01324 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_37c0daefa6bc (Metraipolis archive dc_37c0daefa6bc, sha256 5b32fa2c231cca240e3cb0623ab03f29f447bd524caa45cfbc4ea8e10304a474)
BibTeX
@misc{dc37c0daefa6bc,
title = {Trajectory Design and User Scheduling for Pinching-Antenna Systems — arXiv:2611.01324},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01324},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_37c0daefa6bc; sha256 5b32fa2c231cca240e3cb0623ab03f29f447bd524caa45cfbc4ea8e10304a474},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01324. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Finite antenna movement speed introduces repositioning delays that can limit the performance gains of pinching-antenna systems. In this paper, a trajectory based scheme is proposed for a time division multiple access (TDMA) based pinching-antenna system, allowing transmission during both movement and stationary operation. A discrete-time model is developed to characterize periodic antenna trajectories and antenna-user service association under practical movement constraints. For a single-waveguide scenario, the expected average achievable rate is derived. The rate loss relative to instantaneous positioning and the rate improvement over a fixed antenna are further analyzed, with an upper bound on the former and a lower bound on the latter established. To improve fairness among users, a minimum average rate maximization problem is formulated through joint trajectory design and user scheduling. To address the coupling between these variables, an alternating optimization (AO) framework is adopted. Specifically, a successive convex approximation (SCA) based algorithm is developed using concave rate lower bounds, while a game based scheduling algorithm employs an ordered user-rate vector as the common utility. The convergence of the SCA objective value and the finite termination and stability of the scheduling algorithm are established. Simulation results demonstrate the gains achieved by the joint design and show that the proposed system can approach instantaneous-positioning performance under finite antenna movement speed. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv eess.SP, nuovi lavori del giorno). Categorie arXiv: Signal Processing (eess.SP). Pagina del lavoro: https://arxiv.org/abs/2611.01324 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-03T11:15:41.208Z dalla pagina https://arxiv.org/list/eess.SP/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).