arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.06396cs.ITmath.DSmath.ITmath.OC
收藏

安全UAV通信的鲁棒轨迹和发射功率设计

Robust Trajectory and Transmit Power Design for Secure UAV Communications

Miao Cui, Guangchi Zhang, Qingqing Wu, Derrick Wing Kwan Ng

摘要:

无人机(Unmanned Aerial Vehicles,UAV)具有机动性强、易于部署等优点,有望在未来无线通信领域得到广泛应用。然而,空地视距无线信道的广播特性给无人机-地面通信的信息安全带来了新的挑战。本文解决了这样的挑战,在物理层利用无人机的机动性,通过其轨迹设计。我们考虑一个无人机地面通信系统与多个潜在的窃听者在地面上,窃听者的位置信息是不完善的。我们制定了一个优化问题,最大限度地提高平均最坏情况下的保密率的系统,通过联合设计的鲁棒轨迹和发射功率的无人机在给定的飞行时间。优化问题的非凸性和窃听者位置信息的不完全性使得该问题很难得到最优解。我们提出了一个迭代次优算法,有效地解决这个问题,通过应用块坐标下降法,S-过程,和连续凸优化方法。仿真结果表明,与其他两种没有鲁棒性设计的基准算法相比,该算法可以显著提高平均最坏情况下的保密率。

英文摘要:

Unmanned aerial vehicles (UAVs) are anticipated to be widely deployed in future wireless communications, due to their advantages of high mobility and easy deployment. However, the broadcast nature of air-to-ground line-of-sight wireless chan- nels brings a new challenge to the information security of UAV- ground communication. This paper tackles such a challenge in the physical layer by exploiting the mobility of UAV via its trajectory design. We consider a UAV-ground communication system with multiple potential eavesdroppers on the ground, where the information on the locations of the eavesdroppers is imperfect. We formulate an optimization problem which maximizes the average worst-case secrecy rate of the system by jointly designing the robust trajectory and transmit power of the UAV over a given flight duration. The non-convexity of the optimization problem and the imperfect location information of the eavesdroppers make the problem difficult to be solved optimally. We propose an iterative suboptimal algorithm to solve this problem efficiently by applying the block coordinate descent method, S-procedure, and successive convex optimization method. Simulation results show that the proposed algorithm can improve the average worst-case secrecy rate significantly, as compared to two other benchmark algorithms without robust design.

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

↑