河南大学计算机与信息工程学院,河南,开封,475004
网络出版:2020-01-25,
纸质出版:2020
移动端阅览
胡振涛, 金勇, 武国栋, 等. 无线携能保密网络下的中继协作波束形成算法[J]. 电子学报, 2020,48(1):124-130.
Cooperative Beamforming Algorithm of Relay in SWPIT Secrecy Networks[J]. Acta Electronica Sinica, 2020, 48(1): 124-130.
胡振涛, 金勇, 武国栋, 等. 无线携能保密网络下的中继协作波束形成算法[J]. 电子学报, 2020,48(1):124-130. DOI: 10.3969/j.issn.0372-2112.2020.01.015.
Cooperative Beamforming Algorithm of Relay in SWPIT Secrecy Networks[J]. Acta Electronica Sinica, 2020, 48(1): 124-130. DOI: 10.3969/j.issn.0372-2112.2020.01.015.
本文研究了无线携能通信网络中的多窃听者场景下,基于无线能量收集放大转发中继的协作机密信息安全传输问题.提出了两种低复杂度的零空间波束形成方案.分别利用接收者或窃听者方位先验信息,将待优化的目标矢量投射到接收者或窃听者信道的零空间.与原协作波束形成方法相比,由于降低了待优化目标矢量的空间自由度,本文方法运算复杂度较低.特别的,由于第二种方法目标函数中将窃听者的交互信息迫零,将原始拟凸优化问题转化为凸问题求解,进一步降低了运算量.实验研究验证了本文方法的合理性.
We research on cooperative information security transmitting using energy harvest amplify-and-forward relay in the wireless information and power transfer network with multiple eavesdroppers. Two low-complexity methods using zero-space beaforming technique are proposed. Using the prior location information of receiver or eavesdroppers
our methods project the target vector to the zero space of receiver or eavesdroppers. Computational complexity of the method is lower than that of classical method since space freedom of the target vector is reduced. Furthermore
second method induces the eavesdropper's mutual information of objective function to be zero
the original quasi-convex problem is transformed into a convex form. Thus
computational complexity of the method is apparently reduced compared with that of classical method. Result of experiment verify validity of our proposed methods.
0
浏览量
170
下载量
2
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621