基于多节点分组协作干扰的无线物理层安全传输
HuiMing WANG, Hao DENG, Wenjie Wang
Abstract
Open-access reader
HuiMing WANG, Hao DENG, Wenjie Wang
Abstract
Open-access reader
In this paper, we propose a novel scheme of grouping cooperative jamming (CJ) for secure communication. During the data transmission, the source broadcasts its information signal, all the helpers simultaneously transmit common artificial noise (AN) to interfere the eavesdropper for tradition CJ. In our scheme, all the helpers are divided to different groups which transmit independent artificial noises to the potential eavesdropper. The zero-forcing beamfomer is selected to cancel the AN out at the destination. The tradition CJ scheme can not completely consume the total power budget, while the grouping scheme is based on the instantaneously channel gain which can make best of the total power per group. The simulations show that our propose scheme based on minimum distance achieves the highest secrecy rate and the power actual consumed approaches to the total power budget. Additionally, we propose a fixed grouping scheme based on the second-order statistics of the channel gain which can be easily implemented. Furthermore, we consider the case that the eavesdropper has knowledge of the artificial noise. The tradition CJ does not work in such case, while our scheme works well even only one group keeps its AN secret. The analytical results and simulations show our scheme achieves better performance than the tradition CJ.
OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we propose a novel scheme of grouping cooperative jamming (CJ) for secure communication. During the data transmission, the source broadcasts its information signal, all the helpers simultaneously transmit common artificial noise (AN) to interfere the eavesdropper for tradition CJ. In our scheme, all the helpers are divided to different groups which transmit independent artificial noises to the potential eavesdropper. The zero-forcing beamfomer is selected to cancel the AN out at the destination. The tradition CJ scheme can not completely consume the total power budget, while the grouping scheme is based on the instantaneously channel gain which can make best of the total power per group. The simulations show that our propose scheme based on minimum distance achieves the highest secrecy rate and the power actual consumed approaches to the total power budget. Additionally, we propose a fixed grouping scheme based on the second-order statistics of the channel gain which can be easily implemented. Furthermore, we consider the case that the eavesdropper has knowledge of the artificial noise. The tradition CJ does not work in such case, while our scheme works well even only one group keeps its AN secret. The analytical results and simulations show our scheme achieves better performance than the tradition CJ.
Key concepts: Computer science