分布式认知无线网络中的频谱接入凸规划算法  

Spectrum Access Algorithm Based on Convex Programming in Distributed Cognitive Wireless Networks

作　　者：赵民建[1] 陈杰[1] 李式巨[1] 

机构地区：[1]浙江大学信息与电子工程学系,杭州310027

出　　处：《电子与信息学报》2009年第9期2214-2219,共6页Journal of Electronics & Information Technology

基　　金：国家十一五"863"计划项目(2006AA01Z273)资助课题

摘　　要：针对分布式认知无线网络中所可能存在的多频道隐终端问题,以及分布式协调方法(DCF)在随机冲突下性能下降的问题,该文以最优化网络的效用值为目标,将各个认知节点的接入概率作为求解对象,在分布式认知无线网络中建立了一个通用的凸规划模型。同时,基于凸规划算法,提出了一种分布式的信道接入(DSAC)算法对目标问题进行求解,从而决定认知网络中每个节点以及每条链路的接入概率。仿真结果表明,DSAC算法能够在较少的迭代次数内实现收敛;与普通的DCF方法相比,DSAC算法可以有效地提高网络中同时传输的链路个数,提高了频谱利用率以及网络吞吐量。To overcome the multi-channel hidden terminal well as improve the performance of the network, a general problem in distributed cognitive wireless networks as convex programming model is formulated. The access probability of each cognitive user can be derived from this model. A Distributed Spectrum Access Control （DSAC） algorithm is proposed based on convex optimization. The simulation results show that DSAC can converge during a few intervals, and DSAC can also increase the number of transmission links in the network so as to improve the spectrum efficiency and the network throughput.

关 键 词：认知无线电 分布式无线网络 凸规划 

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