arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.08322eess.SPcs.ITmath.IT
收藏

基于离散采样的物理层安全可移动天线位置优化

Movable-Antenna Position Optimization for Physical-Layer Security via Discrete Sampling

Weidong Mei, Xin Wei, Yijie Liu, Boyu Ning, Zhi Chen

备注：
This paper is accepted by IEEE Globecom 2024. arXiv admin note: substantial text overlap with arXiv:2403.16886
阅读 PDF
arXiv 页面 ↗HTML 原文 ↗

AI总结：

针对MA增强MISO安全通信系统的保密速率最大化问题，提出将连续位置优化转化为离散采样点选择问题，进一步转化为图论递归路径选择问题，设计了最优部分枚举算法和低复杂度次优顺序更新算法，性能优于传统方案。

摘要：

流体天线（Fluid antennas, FAs）和移动天线（mobile antennas, MAs）是无线通信领域的创新技术，能够通过在给定空间区域内动态调整发射/接收天线位置主动改善信道条件。本文研究了一种MA增强的多输入单输出（multiple-input single-output, MISO）安全通信系统，旨在通过联合优化多个MA的位置实现保密速率最大化。与现有工作中连续搜索最优MA位置的思路不同，本文提出将发射区域离散化为多个采样点，从而将连续的天线位置优化问题转化为离散采样点选择问题。然而，该点选择问题具有组合特性，难以求得最优解。为应对这一挑战，本文巧妙地将该组合问题转化为图论中的递归路径选择问题，并提出一种部分枚举算法，无需高复杂度的穷举搜索即可得到最优解。为进一步降低复杂度，本文还提出了一种线性时间顺序更新算法，可得到高质量的次优解。数值结果表明，与传统的FPA及其他基线方案相比，本文提出的算法可实现显著更高的保密速率。

英文摘要：

Fluid antennas (FAs) and mobile antennas (MAs) are innovative technologies in wireless communications that are able to proactively improve channel conditions by dynamically adjusting the transmit/receive antenna positions within a given spatial region. In this paper, we investigate an MA-enhanced multiple-input single-output (MISO) secure communication system, aiming to maximize the secrecy rate by jointly optimizing the positions of multiple MAs. Instead of continuously searching for the optimal MA positions as in prior works, we propose to discretize the transmit region into multiple sampling points, thereby converting the continuous antenna position optimization into a discrete sampling point selection problem. However, this point selection problem is combinatory and thus difficult to be optimally solved. To tackle this challenge, we ingeniously transform this combinatory problem into a recursive path selection problem in graph theory and propose a partial enumeration algorithm to obtain its optimal solution without the need for high-complexity exhaustive search. To further reduce the complexity, a linear-time sequential update algorithm is also proposed to obtain a high-quality suboptimal solution. Numerical results show that our proposed algorithms yield much higher secrecy rates as compared to the conventional FPA and other baseline schemes.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

↑