基于势场竞标的认知无线网络信道竞争算法  

Channel selection algorithm in cognitive radio networks based on potential bidding

作　　者：廖作斌[1] 刘检华[2] 

机构地区：[1]泉州师范学院数学与计算机科学学院,福建泉州362000 [2]北京理工大学机械与车辆学院数字化制造研究所,北京100083

出　　处：《计算机应用研究》2015年第10期3104-3107,3118,共5页Application Research of Computers

基　　金：国家自然科学基金资助项目(61170121)

摘　　要：对于认知无线网络的信道竞争问题而言,主用户和次级用户都存在功率约束,而传统的信道选择算法并没有同时考虑这两种约束。在主用户干扰功率和次级用户总功率的共同约束下,提出了一种基于势场竞标理论的信道竞争算法。该算法首先将信道选择问题建模为一个非合作竞标,并将认知无线网络的速率作为竞标的共同效用;然后证明了该竞标是一种具有至少一个纯粹策略纳什均衡势场竞标,且保证能最大化认知无线网络速率的纯粹策略纳什均衡就在其中;最后使用迭代信道选择过程达到最优策略。仿真结果表明,相对于传统算法,该算法能够达到更高的速率。For the channel selection problem in cognitive radio networks,there are constraints both in primary receivers and secondary users,while no traditional channel selection algorithm considers these constraints simultaneously. Under the co-constraint of both interference power of primary receivers and total available power of secondary users,this paper proposed a channel selection algorithm based on the potential bidding theory. The algorithm firstly modeled the channel selection problem as a non-cooperative bidding problem where the rate of the cognitive radio network was used as the common utility. Then it proved that this bidding was a potential bidding which had at least one pure strategy Nash equilibrium（ NE）,with the one maximizing the rate of the cognitive radio network guaranteed to be among them. Finally it achieved the optimal strategy through an iterative channel selection process. Simulation results show that compared to traditional algorithms,the proposed algorithm has higher convergence rate and lower complexity.

关 键 词：认知无线网络 信道竞争 功率约束 势场竞标 纳什均衡 

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