干扰避免的认知无线电图着色频谱分配算法  

A Graph-Coloring Spectrum Allocation Algorithm for Cognitive Radios based on Interference Avoidance

作　　者：章坚武[1] 赵琪[1] 邹婧媛[1] 

机构地区：[1]杭州电子科技大学通信工程学院,杭州310018

出　　处：《科技通报》2010年第2期240-244,共5页Bulletin of Science and Technology

基　　金：浙江省自然科学基金人才项目资助(No.R105473)

摘　　要：对传统的认知无线电图着色频谱分配算法进行了改进。在分配过程中动态更新干扰矩阵,使更多节点共享同一频段而不相互干扰,以此提高频谱利用率,对授权用户的干扰也可通过发射功率门限的设置来避免。在此基础上算法以最大化认知网络吞吐量为优化目标,仿真结果表明,采用新算法后,在无干扰条件下的网络吞吐量和信道传输速率都明显高于同类算法。The traditional graph-coloring spectrum allocation algorithm for cognitive radios is improved. The interference matrix is updated during the process of channel allocation to make the nodes share the same channel without interfering with each other. This can improve the utilization rate of the spectrum. The interference to authorized users can also be avoided according to setting the transmission power threshold properly. The optimization goal of the algorithm is to maximize the network throughput. Simulation results showed that the throughput and data rate of proposed scheme are much higher than that of the similar schemes on condition that there is no interference.

关 键 词：认知无线电 干扰避免 吞吐量 算法 

分 类 号：TN277[电子电信—物理电子学]