首页> 外文期刊>IEEE Transactions on Communications >Low-Complexity Joint Power Allocation and Trajectory Design for UAV-Enabled Secure Communications With Power Splitting
【24h】

Low-Complexity Joint Power Allocation and Trajectory Design for UAV-Enabled Secure Communications With Power Splitting

机译:低复杂性关节功率分配和轨迹设计,可实现无人机的安全通信

获取原文
获取原文并翻译 | 示例
           

摘要

An unmanned aerial vehicle (UAV)-aided secure communication system is conceived and investigated, where the UAV transmits legitimate information to a ground user in the presence of an eavesdropper (Eve). To guarantee the security, the UAV employs a power splitting approach, where its transmit power can be divided into two parts for transmitting confidential messages and artificial noise (AN), respectively. We aim to maximize the average secrecy rate by jointly optimizing the UAV's trajectory, the transmit power levels and the corresponding power splitting ratios allocated to different time slots during the whole flight time, subject to both the maximum UAV speed constraint, the total mobility energy constraint, the total transmit power constraint, and other related constraints. To efficiently tackle this non-convex optimization problem, we propose an iterative algorithm by blending the benefits of the block coordinate descent (BCD) method, the concave-convex procedure (CCCP) and the alternating direction method of multipliers (ADMM). Specially, we show that the proposed algorithm exhibits very low computational complexity and each of its updating steps can be formulated in a nearly closed form. Besides, it can be easily extended to the case of three-dimensional (3D) trajectory design. Our simulation results validate the efficiency of the proposed algorithm.
机译:构思和研究了一种无人驾驶飞行器(UAV)的安全通信系统,其中UAV在窃听器(夏娃)的情况下将合法信息发送到地面用户。为了保证安全性,UAV采用功率分割方法,其中发射功率可分为两个部分,用于分别传输机密消息和人工噪声(AN)。我们的目标是通过共同优化UAV的轨迹,传输功率电平和在整个飞行时间内分配给不同时隙的相应功率分割比来最大限度地提高平均保密率,而是通过最大无人机速度约束,总移动性能量约束,总发射功率约束和其他相关约束。为了有效地解决该非凸优化问题,我们通过混合块坐标下降(BCD)方法的益处,凹凸过程(CCCP)和乘法器(ADMM)的交替方向方法来提出迭代算法。特别是,我们表明所提出的算法表现出非常低的计算复杂性,并且其每个更新步骤可以以几乎封闭的形式配制。此外,它可以很容易地扩展到三维(3D)轨迹设计的情况。我们的仿真结果验证了所提出的算法的效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号