arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.00630eess.SP
收藏

基于分布式波束成形的物理层安全性研究

Physical-Layer Security via Distributed Beamforming in the Presence of Adversaries with Unknown Locations

Yagiz Savas, Abolfazl Hashemi, Abraham P. Vinod, Brian M. Sadler, Ufuk Topcu

摘要:

我们研究的问题,安全地与客户端的信息位序列中存在的多个对手在未知的位置在环境中进行通信。我们假设客户端和对手都位于远场区域,并且每个对手的所有可能方向都可以表示为连续的方向间隔。在这样的设置中,我们开发了周期性传输策略,即,联合波束成形增益和人工噪声对的序列,其防止对手通过窃听传输来降低其对信息序列的不确定性。我们制定了一系列的非凸半无限优化问题来合成的传输策略。我们证明了这些非凸问题的半定规划(SDP)松弛在一个有效可验证的充分条件下是精确的。我们近似的SDP松弛,这是受到无限多的约束,通过随机抽样的约束的有限子集,并建立概率与所获得的有限SDPs和半无限SDPs的最佳解决方案相吻合。我们证明了与数值模拟,所提出的周期性策略可以确保通信的安全性,在所有的静态策略不能保证安全的情况下。

英文摘要:

We study the problem of securely communicating a sequence of information bits with a client in the presence of multiple adversaries at unknown locations in the environment. We assume that the client and the adversaries are located in the far-field region, and all possible directions for each adversary can be expressed as a continuous interval of directions. In such a setting, we develop a periodic transmission strategy, i.e., a sequence of joint beamforming gain and artificial noise pairs, that prevents the adversaries from decreasing their uncertainty on the information sequence by eavesdropping on the transmission. We formulate a series of nonconvex semi-infinite optimization problems to synthesize the transmission strategy. We show that the semi-definite program (SDP) relaxations of these nonconvex problems are exact under an efficiently verifiable sufficient condition. We approximate the SDP relaxations, which are subject to infinitely many constraints, by randomly sampling a finite subset of the constraints and establish the probability with which optimal solutions to the obtained finite SDPs and the semi-infinite SDPs coincide. We demonstrate with numerical simulations that the proposed periodic strategy can ensure the security of communication in scenarios in which all stationary strategies fail to guarantee security.

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

↑