检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]College of Communication Engineering, Jilin University, Changchun 130012, China
出 处:《Chinese Journal of Electronics》2013年第2期353-358,共6页电子学报(英文版)
基 金:This work is supported by the National Nature Science Foundation of China (No.61171079).
摘 要:To maximize the average rate in a long- term scope while guarantee primary user's QoS demand is a new key issue in cognitive radio systems. A dynamic programming based power control algorithm with the con- sideration of primary user's QoS by a rate loss constraint criterion is proposed in this paper. In the proposed al- gorithm, the occupancy for each subcarrier by primary users is modeled as a discrete-time Markov chain. And the concept of rate loss constraint is defined which is used to guarantee primary user's desired rate. Then the dy- namic programming framework with rate loss constraint of this problem is formulated, which is a function of the primary user occupancy state, the system channel gains and the remaining power budgets for the cognitive radio transmitters. At last, we give a solution for the problem. Simulation results show that the proposed algorithm can obtain a maximum average data rate over a finite time horizon and effectively guarantee primary users' QoS.
关 键 词:Cognitive radio Power control Dynamic programming Rate loss constraint.
分 类 号:TN929.533[电子电信—通信与信息系统] TN915[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222