基于保密度的OFDMA中继网络资源分配研究  

Research on the Resource Allocation of OFDMA Relay Network Based on Secrecy Ratio

作　　者：赵君[1] 郑伟[1] 温向明[1] 张海君[2] 路兆铭[1] 景文鹏[1] 

机构地区：[1]北京邮电大学信息与通信工程学院,北京100876 [2]北京化工大学信息科学与技术学院,北京100029

出　　处：《电子与信息学报》2014年第12期2816-2821,共6页Journal of Electronics & Information Technology

基　　金：国家863计划项目(2014AA01A701);国家自然科学基金(61271179;61101109);科技部重大专项(2011ZX03003-002-01);北京市教委共建科研项目资助课题

摘　　要：考虑到异构双向中继网络中存在窃听者的安全资源分配问题,为了提高中继安全性,该文研究了受限于子信道分配和功率约束的用户安全保密度问题模型,与传统的保密容量模型相比,安全保密度模型更侧重于反映用户本身的安全程度。基于此保密度模型,该文进一步考虑了不同用户的安全服务质量(Quality of Service,Qo S)需求和网络公平性,联合优化功率分配、子信道分配、子载波配对,并分别通过约束型粒子群、二进制约束型粒子群优化算法和经典的匈牙利算法找到最优解,实现资源的最优分配,提高网络中合法用户的保密度。仿真结果验证了所提算法的有效性。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 orooosed algorithm.

关 键 词：无线通信 双向中继 安全服务质量 公平性 保密度 

分 类 号：TN929.53[电子电信—通信与信息系统]