基于认知无线电的混合网络最优信道分配  

An Optimal Channel Assignment in Hybrid Network Based on Cognitive Radio

作　　者：廖勇[1,2] 杨士中[1] 魏海波[1] 王丹[1] 

机构地区：[1]重庆大学飞行器测控与通信教育部重点实验室,重庆400044 [2]西安电子科技大学综合业务网理论及关键技术国家重点实验室,西安710071

出　　处：《北京邮电大学学报》2013年第6期37-40,共4页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(61101135);西安电子科技大学综合业务网理论及关键技术国家重点实验室开放基金项目(ISN13-11)

摘　　要：在保证主用户服务质量的前提下,将接入点(AP)以认知用户的身份接入到主用户频谱,合理地分享主用户信道资源.将信道分配问题建模为整数线性规划问题,提出一个混合最优信道分配算法(HOCA),该算法基于一种有权连接图的最小生成树,可以快速准确地在主用户和认知AP频谱中为主用户和认知AP分配干扰最小的信道.最后,将HOCA算法和其他2种信道分配算法,次最优机会信道分配和次最优信道分配-2算法进行了数值分析,验证了HOCA在吞吐量性能的有效性.A solution is put forward that makes access point （AP） access into the primary user＇ s channel in the identity of cognitive user under the precondition of guaranteeing primary user＇ s quality of service, so as to share the channel resource of primary user effectively. It models the channel assignment as an in- teger linear programming issue and puts forward a hybrid optimal channel assignment algorithm （HO- CA）. Based on minimum spanning tree algorithm of connected weighted graph, the algorithm can allocate the minimum interfered channel for primary user and cognitive AP fast and efficiently in its own frequency band of primary user and cognitive AP. HOCA algorithm and other two channel assignment algorithms, near-optimal opportunistic channel allocation and near optimal frequency assignment-2 are analyzed. It is testified that HOCA algorithm can effectively improve the throughput of cognitive user.

关 键 词：信道分配 干扰信道 无线局域网 认知无线电 整数线性规划 

分 类 号：TN925[电子电信—通信与信息系统]