基于用户需求和历史信息的动态频谱分配算法  

Demand and Historical Information Based Algorithm in Dynamic Spectrum Allocation

作　　者：夏龄[1] 冯文江[2] 

机构地区：[1]四川民族学院网络信息中心,康定626001 [2]重庆大学通信工程学院,重庆400044

出　　处：《科学技术与工程》2013年第13期3738-3743,共6页Science Technology and Engineering

基　　金：国家自然科学基金(60872038);四川省教育厅科研基金(10ZC025)资助

摘　　要：针对认知无线电系统中动态频谱分配算法开展研究,以干扰图模型为基础,提出一种改进的基于业务需求和历史信息的动态频谱分配算法。为利于快速收敛,算法采用最大独立集为分配起点,允许将信道同时分配给多个用户,联合功率控制机制最小化认知用户间的干扰,引入信道优先级和用户优先级表征历史信息和业务需求,优先分配高质量的信道给高优先级用户集以保证公平性。最后通过仿真分析进行了算法的有效性验证。Dynamic spectrum allocation algorithm is a key way to improve spectrum efficiency in cognitive radio networks. Due to defects of existing dynamic spectrum allocation algorithms, built on the basis of interference graph, an improved dynamic spectrum allocation algorithm is proposed based on the demand and historical informa- tion. For the purpose of fast convergence, the algorithm assigns the maximum independent set as a begins, and al- low muhiple users at the same time to be assigned to a particular channel with no interference between each other, and joint power control mechanism to minimize interference between users. In addition, allocation take user de- mand and historical information into account, introducing channel priority and user priority to assign channel of high quality to users of high priority so as to enable fairness. Simulation results in the end confirm the verification of the algorithm.

关 键 词：认知无线电 动态频谱分配 干扰图 功率控制 最大独立集 

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