Secure Beamforming for Integrated Sensing, NOMA Communication, and Over-the-Air Computation Networks

IF 8 1区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS
Changjie Hu;Quanzhong Li;Qi Zhang;Qiang Li
{"title":"Secure Beamforming for Integrated Sensing, NOMA Communication, and Over-the-Air Computation Networks","authors":"Changjie Hu;Quanzhong Li;Qi Zhang;Qiang Li","doi":"10.1109/TIFS.2025.3614008","DOIUrl":null,"url":null,"abstract":"With the rapid evolution of wireless technologies, the deep integration of sensing, communication and computation has heralded a novel and promising paradigm. In this paper, we propose a secure beamforming design framework for integrated sensing, non-orthogonal multiple access (NOMA) communication and over-the-air computation (AirComp) networks, which can provide multi-functional intelligent services for communication-intensive, computation-intensive, delay-sensitive and security-sensitive applications. In the considered network, each dual-functional intelligent device engages in NOMA information transmission and AirComp. Meanwhile, the triple-functional base station conducts target sensing, NOMA signal decoding and data aggregation simultaneously. Our aim is to maximize the sum secrecy rate (SSR) of NOAM devices while ensuring that the quality of service requirements for both sensing and AirComp are met within the transmit power constraints imposed on all nodes. The formulated optimization problem involves coupled variables and logarithmic determinant, thus it is highly non-convex. To solve it, we propose an efficient matrix-extended generalized Lagrangian dual transformation based algorithm with penalty method, which can obtain the Karush-Kuhn-Tucker (KKT) solution to the original problem with low-complexity and convergence guarantee. Additionally, the well-known successive convex approximation based algorithm is also employed to address the formulated SSR maximization problem. However, its computational complexity significantly exceeds that of our proposed algorithm. Finally, extensive experiments demonstrate the performance improvement of our proposal compared with the benchmark approaches.","PeriodicalId":13492,"journal":{"name":"IEEE Transactions on Information Forensics and Security","volume":"20 ","pages":"10315-10331"},"PeriodicalIF":8.0000,"publicationDate":"2025-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Forensics and Security","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11177592/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

With the rapid evolution of wireless technologies, the deep integration of sensing, communication and computation has heralded a novel and promising paradigm. In this paper, we propose a secure beamforming design framework for integrated sensing, non-orthogonal multiple access (NOMA) communication and over-the-air computation (AirComp) networks, which can provide multi-functional intelligent services for communication-intensive, computation-intensive, delay-sensitive and security-sensitive applications. In the considered network, each dual-functional intelligent device engages in NOMA information transmission and AirComp. Meanwhile, the triple-functional base station conducts target sensing, NOMA signal decoding and data aggregation simultaneously. Our aim is to maximize the sum secrecy rate (SSR) of NOAM devices while ensuring that the quality of service requirements for both sensing and AirComp are met within the transmit power constraints imposed on all nodes. The formulated optimization problem involves coupled variables and logarithmic determinant, thus it is highly non-convex. To solve it, we propose an efficient matrix-extended generalized Lagrangian dual transformation based algorithm with penalty method, which can obtain the Karush-Kuhn-Tucker (KKT) solution to the original problem with low-complexity and convergence guarantee. Additionally, the well-known successive convex approximation based algorithm is also employed to address the formulated SSR maximization problem. However, its computational complexity significantly exceeds that of our proposed algorithm. Finally, extensive experiments demonstrate the performance improvement of our proposal compared with the benchmark approaches.
用于集成传感、NOMA通信和空中计算网络的安全波束形成
随着无线技术的快速发展,传感、通信和计算的深度融合预示着一种新的、有前途的模式。本文提出了一种用于集成传感、非正交多址(NOMA)通信和空中计算(AirComp)网络的安全波束形成设计框架,可为通信密集型、计算密集型、延迟敏感和安全敏感的应用提供多功能智能服务。在考虑的网络中,每个双功能智能设备都进行NOMA信息传输和AirComp。同时,三功能基站同时进行目标感知、NOMA信号解码和数据聚合。我们的目标是最大限度地提高NOAM设备的总保密率(SSR),同时确保在对所有节点施加的发射功率限制内满足传感和AirComp的服务质量要求。公式优化问题涉及到耦合变量和对数行列式,因此是高度非凸的。为了解决这一问题,我们提出了一种基于矩阵扩展广义拉格朗日对偶变换的罚法算法,该算法可以获得原问题的低复杂度和收敛性保证的kush - kuhn - tucker (KKT)解。此外,还采用了著名的基于连续凸逼近的算法来解决所制定的SSR最大化问题。然而,其计算复杂度明显超过我们提出的算法。最后,大量的实验表明,与基准方法相比,我们的提议性能有所提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Information Forensics and Security
IEEE Transactions on Information Forensics and Security 工程技术-工程:电子与电气
CiteScore
14.40
自引率
7.40%
发文量
234
审稿时长
6.5 months
期刊介绍: The IEEE Transactions on Information Forensics and Security covers the sciences, technologies, and applications relating to information forensics, information security, biometrics, surveillance and systems applications that incorporate these features
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信