Secure and covert communication in unmanned aerial vehicle (UAV) assisted wireless systems is to ensure security of transmission information, while age of information (AoI) quantifies its timeliness. However, existing works have not explored the AoI minimization for secure and covert UAV communications. This paper formulates the AoI minimization as an optimization problem by jointly optimizing UAV transmit power, flight path and low probability of detection constraints. We then propose an efficient iterative algorithm combining block coordinate descent and successive convex approximation to solve the non-convex problem. Simulation results demonstrate that the proposed scheme significantly achieves a superior trade-off between communication secrecy, information freshness, and power allocation in covert UAV networks.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Age of Information Minimization for Secure and Covert UAV Communications

  • Yiwen Zhang,
  • Shikai Shen,
  • Bin Yang,
  • Fei Deng,
  • Yumei She,
  • Kaiguo Qian,
  • Riyu Wang,
  • Kai Yang

摘要

Secure and covert communication in unmanned aerial vehicle (UAV) assisted wireless systems is to ensure security of transmission information, while age of information (AoI) quantifies its timeliness. However, existing works have not explored the AoI minimization for secure and covert UAV communications. This paper formulates the AoI minimization as an optimization problem by jointly optimizing UAV transmit power, flight path and low probability of detection constraints. We then propose an efficient iterative algorithm combining block coordinate descent and successive convex approximation to solve the non-convex problem. Simulation results demonstrate that the proposed scheme significantly achieves a superior trade-off between communication secrecy, information freshness, and power allocation in covert UAV networks.