隐蔽的
无线
数学优化
计算机科学
凸优化
带宽(计算)
最优化问题
约束(计算机辅助设计)
凸函数
频道(广播)
传输(电信)
功率(物理)
选择(遗传算法)
正多边形
计算机网络
算法
数学
电信
物理
人工智能
哲学
量子力学
语言学
几何学
作者
Menghan Lin,Wenjie Wang
出处
期刊:IEEE Transactions on Vehicular Technology
[Institute of Electrical and Electronics Engineers]
日期:2023-04-01
卷期号:72 (4): 5350-5355
被引量:1
标识
DOI:10.1109/tvt.2022.3222016
摘要
In this work, we consider the finite blocklength covert wireless communication over the multi-carrier channel, and formulate the optimization problem to maximize the covert transmission rate under a limited power budget. Since the optimization problem is non-convex, we analyze the properties of the objective function and the covertness constraint, and propose a two-step successive-convex-approximation-based (SCA-based) algorithm for achieving a suboptimal solution on subcarriers selection and power allocation. Numerical results are provided to depict the effectiveness of the proposed scheme, and to reveal the benefits of larger bandwidth for covert communication in the finite blocklength regime.
科研通智能强力驱动
Strongly Powered by AbleSci AI