干扰环境下基于图着色理论的动态频谱分配算法  

Dynamic Spectrum Allocation Algorithm based on Graph Coloring Theory in the Presence of Jamming

作　　者：李胜男[1,2] 李永贵 牛英滔 闫岩[1] 

机构地区：[1]解放军理工大学通信工程学院,江苏南京210007 [2]南京电讯技术研究所,江苏南京210007

出　　处：《通信技术》2017年第2期255-261,共7页Communications Technology

基　　金：国家自然科学基金(No.61401505);江苏省自然科学基金(No.BK20151450)~~

摘　　要：针对目前无线通信系统抗干扰能力不强、资源利用率较低等问题,首先根据不同的业务优先级,建立了一种具有分层架构的动态频谱分配模型。然后,基于图着色理论,提出了一种动态业务需求条件下的频谱分配算法。该算法既能保证优先级高的通信链路优先分配信道,也能保证系统具有一定的均衡性。仿真结果表明,与固定频谱分配算法和传统动态频谱分配算法相比,该算法能够有效提升系统的抗干扰能力、均衡性和满意度,并可获得更高的吞吐量。In order to cope with the low anti-jamming performance and inefficient spectrum utilization in current wireless communication, a dynamic spectrum allocation model based on different traffic priorities is established, which holds a hierarchical framework. Based on graph coloring theory, a spectrum allocation algorithm under the condition of dynamic traffic demand is proposed. The proposed algorithm can guarantee the preferential channel allocation of the links with high priority, which ensuring certain proportionality of the system. The simulation results indicate that the proposed algorithm, as compared with the fixed spectrum allocation and the traditional dynamic spectrum allocation, has much better anti-jamming performance, proportionality and satisfaction, and could even acquire higher throughput.

关 键 词：抗干扰 动态频谱分配 图着色理论 动态业务需求 

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