CAJ | 학술논문

考虑到异构双向中继网络中存在窃听者的安全资源分配问题，为了提高中继安全性，该文研究了受限于子信道分配和功率约束的用户安全保密度问题模型，与传统的保密容量模型相比，安全保密度模型更侧重于反映用户本身的安全程度。基于此保密度模型，该文进一步考虑了不同用户的安全服务质量(Quality of Service, QoS)需求和网络公平性，联合优化功率分配、子信道分配、子载波配对，并分别通过约束型粒子群、二进制约束型粒子群优化算法和经典的匈牙利算法找到最优解，实现资源的最优分配，提高网络中合法用户的保密度。仿真结果验证了所提算法的有效性。
고필도이구쌍향중계망락중존재절은자적안전자원분배문제，위료제고중계안전성，해문연구료수한우자신도분배화공솔약속적용호안전보밀도문제모형，여전통적보밀용량모형상비，안전보밀도모형경측중우반영용호본신적안전정도。기우차보밀도모형，해문진일보고필료불동용호적안전복무질량(Quality of Service, QoS)수구화망락공평성，연합우화공솔분배、자신도분배、자재파배대，병분별통과약속형입자군、이진제약속형입자군우화산법화경전적흉아리산법조도최우해，실현자원적최우분배，제고망락중합법용호적보밀도。방진결과험증료소제산법적유효성。
Considering the security resource allocation problem in the two-way relay networks exiting an eavesdropper, to improve the security of the relay, a security secrecy ratio scheme under the constraint of subchannel allocation and power is studied in this paper. Compared to the traditional secrecy capacity scheme, the security secrecy ratio scheme pays more attention to reflecting the user’s own security extent. Based on the proposed scheme, security Quality of Service (QoS) requirement for different users and the network fairness are further considered. Besides, power allocation, subchannel allocation and subchannel pairing are joint considered. Then, the optimal solution is obtained through Constraint Particle Swarm Optimization (CPSO) algorithm, Binary CPSO (B_CPSO) algorithm and Classic Hungarian Algorithm (CHA), respectively. Finally, the network resources are allocated in an optimal manner and the secrecy ratio for legitimate users is improved. Simulations results show the effectiveness of the proposed algorithm.