FDA-Aided Covert Communication Against Multiple Wardens

IF 5.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Wireless Communications Letters Pub Date : 2024-08-21 DOI:10.1109/LWC.2024.3447548
Zihao Cheng;Jiangbo Si;Zan Li;Tingting Wang;Lei Guan;Naofal Al-Dhahir
{"title":"FDA-Aided Covert Communication Against Multiple Wardens","authors":"Zihao Cheng;Jiangbo Si;Zan Li;Tingting Wang;Lei Guan;Naofal Al-Dhahir","doi":"10.1109/LWC.2024.3447548","DOIUrl":null,"url":null,"abstract":"The frequency diverse array (FDA) technology plays an important role in covert communication. In this letter, we consider a FDA-aided covert communication system with multiple illegitimate wardens. To maximize the covert rate, we jointly optimize the transmit beamformer and frequency offsets at the array antenna, subject to the covert constraints at different wardens. In particular, we propose to utilize a modification of the block successive upper bound minimization (BSUM) algorithm to solve this optimization problem. Simulation results demonstrate that our proposed FDA scheme can significantly enhance covert performance.","PeriodicalId":13343,"journal":{"name":"IEEE Wireless Communications Letters","volume":"13 12","pages":"3305-3309"},"PeriodicalIF":5.5000,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Wireless Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10643169/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The frequency diverse array (FDA) technology plays an important role in covert communication. In this letter, we consider a FDA-aided covert communication system with multiple illegitimate wardens. To maximize the covert rate, we jointly optimize the transmit beamformer and frequency offsets at the array antenna, subject to the covert constraints at different wardens. In particular, we propose to utilize a modification of the block successive upper bound minimization (BSUM) algorithm to solve this optimization problem. Simulation results demonstrate that our proposed FDA scheme can significantly enhance covert performance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
美国食品和药物管理局(FDA)协助针对多名狱警的秘密通信
分频阵列技术在隐蔽通信中起着重要的作用。在这封信中,我们考虑了一个由多个非法监狱长组成的fda辅助的秘密通信系统。为了最大限度地提高隐蔽率,我们根据不同的隐蔽约束条件,共同优化了阵列天线的发射波束形成器和频率偏移量。特别地,我们建议利用块连续上界最小化(BSUM)算法的修改来解决这个优化问题。仿真结果表明,该方案可以显著提高隐蔽性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Wireless Communications Letters
IEEE Wireless Communications Letters Engineering-Electrical and Electronic Engineering
CiteScore
12.30
自引率
6.30%
发文量
481
期刊介绍: IEEE Wireless Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of wireless communications. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of wireless communication systems.
期刊最新文献
Sensing-Assisted Adaptive Beam Probing with Calibrated Multimodal Priors and Uncertainty-Aware Scheduling Achievable Performance of Covert Communications via Power-Domain Binary Embedding Hybrid Beamforming for Subarray-Level Movable Antenna Enhanced MU-MIMO Communications Closed-Loop Predictive Beamforming for ISAC: An EKF-Integrated Deep Learning Approach Deep Learning-Based Secure Communication for IRS-Aided Terahertz Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1