一种基于认知无线电系统的公平信道分配算法  

Fair channel allocation algorithm for cognitive radio system

作　　者：裴廷睿[1] 赵智[1] 曹江莲[1] 李靖[1] 

机构地区：[1]湘潭大学信息工程学院,湖南湘潭411105

出　　处：《计算机应用研究》2011年第3期1055-1058,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(61070180);湖南省高校创新平台开放基金资助项目(09K039)

摘　　要：由于在认知无线电网络中主用户与认知用户共存,如何在不对主用户造成干扰的前提下,对认知用户进行合理的资源分配显得尤为重要。以纳什协调解为优化目标,并考虑功率约束,提出一种公平信道分配算法。在仿真中,对以吞吐量最大化为目标的Maximal-Rate策略和考虑公平的Max-Min策略进行了对比,仿真结果表明,本算法有着与Maximal-Rate策略相当的吞吐量和比Max-Min策略更高的数据速率,因此本算法在效率和公平上作了很好的折中。Because of the consistence of primary user（PU） and secondary cognitive user（SU）,it is important that how to allocate resource reasonably without causing adverse interference to primary user.This paper proposeded a fair channel allocation scheme that aimed to lead to Nash bargaining solution,while considering the power constrains.In the simulation,it compared this scheme with the Maximal-Rate scheme and Max-Min scheme,which considered the overall throughput and fairness solely.The simulation results show that this scheme not only provides fair channel allocation among cognitive users,but also has a comparable overall throughput and higher rates than Max-Min scheme.Therefore,this scheme is a good tradeoff between efficiency and fairness.

关 键 词：认知无线电 子信道分配 纳什协调解 公平性 

分 类 号：TN92[电子电信—通信与信息系统] TP393[电子电信—信息与通信工程]