极大网络寿命的认知无线电网络自组网算法  

An Automatic Construction Algorithm of Cognitive Radio Networks Based on Maximal Network Lifetime

作　　者：谭学治[1] 徐贵森[1] 刘鑫[1] 陈海宝[1] 

机构地区：[1]哈尔滨工业大学通信技术研究所,黑龙江哈尔滨150080

出　　处：《华南理工大学学报（自然科学版）》2010年第6期29-34,共6页Journal of South China University of Technology(Natural Science Edition)

基　　金：国家"863"计划项目(2008AA12Z305)

摘　　要：根据认知无线电网络的特点,提出一种将鱼群算法与图论中极小独立支配集相结合的最大化网络寿命的认知无线电网络自组网算法.该算法分为鱼群大小确定阶段和簇头选举阶段,前者以极小的能量完成节点配置和确定受影响的认知用户范围,后者确保以极小的能量进行通信,极大化网络寿命和簇头选举的公平性.仿真结果表明,该算法的整体消息复杂度为O(n),最坏时间复杂度为O(lg(D+n)),性能优于极大权极小独立支配集MWM IDS算法,可应用于认知无线电网络协议的设计中,以延长网络寿命.According to the characteristics of cognitive radio networks,an automatic construction algorithm of cognitive radio networks,which combines the fish-swarm algorithm and the minimal independent dominating set algorithm in graph theory,is proposed based on the maximal network lifetime.The algorithm consists of two phases： one is to determine the swarm size and the other is to select the cluster heads.The former phase configures the parameters of cognitive users and determines the scope of the cognitive users affected by primary users with minimal energy cost,and the latter minimizes the energy cost in the communication and maximizes the network lifetime as well as the fairness of cluster head selection.Simulated results show that the proposed algorithm is of an total information complexity of O（n） and a time complexity of O（lg（D＋n）） in the worst case,and that it is prior to the exi-sting MWMIDS（Maximal-Weight Minimal Independent Dominating Set） algorithm.Thus,it can be applied to the design of cognitive-radio routing protocol for the purpose of prolonging the network lifetime.

关 键 词：认知无线电 鱼群算法 极小独立支配集 极大网络寿命 

分 类 号：TP393.01[自动化与计算机技术—计算机应用技术]