Boxiang He;Fanggang Wang;Zihan Chen;Guangyang Zhang;Tony Q. S. Quek
{"title":"Secure Over-the-Air Computation for Wireless Sensor Network","authors":"Boxiang He;Fanggang Wang;Zihan Chen;Guangyang Zhang;Tony Q. S. Quek","doi":"10.1109/LCOMM.2024.3461793","DOIUrl":null,"url":null,"abstract":"Over-the-air computation (AirComp) has been shown to provide a significantly higher efficiency than the traditional separating communication and computation tasks in the large-scale wireless sensor network. However, the presence of the malicious active eavesdropper in the network poses a severe security threat, as the eavesdropper can not only intercept aggregated information but also interfere with legitimate transmissions. To address the issue, we first derive the closed-form expressions that characterize both the approximation level and the security level of AirComp in the presence of active eavesdropping. Then, we jointly design the power allocation, the sensor selection, the artificial noise, and the receiver filter to minimize the approximation level subject to the required security level and the power budget constraint. Finally, the penalty dual decomposition scheme is proposed to solve the approximation level minimization problem, which is NP-hard due to the integer-programming nature and coupling properties of the optimization variables. Numerical results show that our scheme significantly outperforms the existing method.","PeriodicalId":13197,"journal":{"name":"IEEE Communications Letters","volume":"28 11","pages":"2503-2507"},"PeriodicalIF":3.7000,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10681103/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
Over-the-air computation (AirComp) has been shown to provide a significantly higher efficiency than the traditional separating communication and computation tasks in the large-scale wireless sensor network. However, the presence of the malicious active eavesdropper in the network poses a severe security threat, as the eavesdropper can not only intercept aggregated information but also interfere with legitimate transmissions. To address the issue, we first derive the closed-form expressions that characterize both the approximation level and the security level of AirComp in the presence of active eavesdropping. Then, we jointly design the power allocation, the sensor selection, the artificial noise, and the receiver filter to minimize the approximation level subject to the required security level and the power budget constraint. Finally, the penalty dual decomposition scheme is proposed to solve the approximation level minimization problem, which is NP-hard due to the integer-programming nature and coupling properties of the optimization variables. Numerical results show that our scheme significantly outperforms the existing method.
期刊介绍:
The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. 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 communication systems.