利用多播和单播通信实现 NOMA-ISAC 的安全波束成形

IF 4.6 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Huifang Zhang;Ming Jin;Qinghua Guo;Junteng Yao
{"title":"利用多播和单播通信实现 NOMA-ISAC 的安全波束成形","authors":"Huifang Zhang;Ming Jin;Qinghua Guo;Junteng Yao","doi":"10.1109/LWC.2024.3454238","DOIUrl":null,"url":null,"abstract":"This letter investigates the issue of secure beamforming for non-orthogonal multiple access (NOMA)-assisted integrated sensing and communication (ISAC), where some targets acquiring group-oriented information from the base station (BS) of the ISAC system are cooperative. To secure the privacy of served users from malicious targets, artificial noise (AN) carrying no information is often transmitted in conventional security schemes. In this letter, we propose to employ multicast signals to convey group-oriented information to cooperative targets, disrupt malicious targets, and simultaneously sense all targets. Meanwhile, unicast signals are transmitted for privacy information of the served users. We formulate a robust secure beamforming problem that deals with imperfect channel state information (CSI) and the uncertainty regarding the angles of malicious targets. To solve this problem, we propose a penalty-based iterative algorithm by transforming the non-convex optimization problem into a convex one with semidefinite relaxation (SDR) and examining the relationship between the trace, the largest eigenvalue and the rank of a positive semidefinite matrix. Numerical results are provided to demonstrate that, with lower computational complexity, the proposed scheme delivers superior performance, compared to state-of-the-art schemes.","PeriodicalId":13343,"journal":{"name":"IEEE Wireless Communications Letters","volume":"13 10","pages":"2927-2931"},"PeriodicalIF":4.6000,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Secure Beamforming for NOMA-ISAC With Multicast and Unicast Communications\",\"authors\":\"Huifang Zhang;Ming Jin;Qinghua Guo;Junteng Yao\",\"doi\":\"10.1109/LWC.2024.3454238\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This letter investigates the issue of secure beamforming for non-orthogonal multiple access (NOMA)-assisted integrated sensing and communication (ISAC), where some targets acquiring group-oriented information from the base station (BS) of the ISAC system are cooperative. To secure the privacy of served users from malicious targets, artificial noise (AN) carrying no information is often transmitted in conventional security schemes. In this letter, we propose to employ multicast signals to convey group-oriented information to cooperative targets, disrupt malicious targets, and simultaneously sense all targets. Meanwhile, unicast signals are transmitted for privacy information of the served users. We formulate a robust secure beamforming problem that deals with imperfect channel state information (CSI) and the uncertainty regarding the angles of malicious targets. To solve this problem, we propose a penalty-based iterative algorithm by transforming the non-convex optimization problem into a convex one with semidefinite relaxation (SDR) and examining the relationship between the trace, the largest eigenvalue and the rank of a positive semidefinite matrix. Numerical results are provided to demonstrate that, with lower computational complexity, the proposed scheme delivers superior performance, compared to state-of-the-art schemes.\",\"PeriodicalId\":13343,\"journal\":{\"name\":\"IEEE Wireless Communications Letters\",\"volume\":\"13 10\",\"pages\":\"2927-2931\"},\"PeriodicalIF\":4.6000,\"publicationDate\":\"2024-09-04\",\"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/10664461/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Wireless Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10664461/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

这封信研究了非正交多址(NOMA)辅助综合传感与通信(ISAC)的安全波束成形问题,在这种情况下,一些从综合传感与通信系统基站(BS)获取面向群组信息的目标是合作的。为了确保被服务用户的隐私不受恶意目标的侵害,传统的安全方案通常会传输不携带任何信息的人工噪音(AN)。在这封信中,我们建议采用组播信号向合作目标传递面向群组的信息,干扰恶意目标,并同时感知所有目标。同时,传输单播信号以获取所服务用户的隐私信息。我们提出了一个稳健的安全波束成形问题,该问题涉及不完善的信道状态信息(CSI)和恶意目标角度的不确定性。为了解决这个问题,我们提出了一种基于惩罚的迭代算法,将非凸优化问题转化为具有半无限松弛(SDR)的凸优化问题,并研究了正半无限矩阵的迹线、最大特征值和秩之间的关系。数值结果表明,与最先进的方案相比,拟议方案的计算复杂度更低,性能更优越。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Secure Beamforming for NOMA-ISAC With Multicast and Unicast Communications
This letter investigates the issue of secure beamforming for non-orthogonal multiple access (NOMA)-assisted integrated sensing and communication (ISAC), where some targets acquiring group-oriented information from the base station (BS) of the ISAC system are cooperative. To secure the privacy of served users from malicious targets, artificial noise (AN) carrying no information is often transmitted in conventional security schemes. In this letter, we propose to employ multicast signals to convey group-oriented information to cooperative targets, disrupt malicious targets, and simultaneously sense all targets. Meanwhile, unicast signals are transmitted for privacy information of the served users. We formulate a robust secure beamforming problem that deals with imperfect channel state information (CSI) and the uncertainty regarding the angles of malicious targets. To solve this problem, we propose a penalty-based iterative algorithm by transforming the non-convex optimization problem into a convex one with semidefinite relaxation (SDR) and examining the relationship between the trace, the largest eigenvalue and the rank of a positive semidefinite matrix. Numerical results are provided to demonstrate that, with lower computational complexity, the proposed scheme delivers superior performance, compared to state-of-the-art schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信