DocumentCode
3386767
Title
A Nash game algorithm for power allocation jointing sensing time for cognitive networks
Author
Yang, Miao ; An, Jianping ; Wei, Jingchong
Author_Institution
Sch. of Inf. & Electron., Beijing Inst. of Technol., Beijing, China
fYear
2011
fDate
25-28 Sept. 2011
Firstpage
228
Lastpage
233
Abstract
We study the problem of power allocation in cognitive radio networks. A distributed power allocation Joint sensing time Nash game (PASTG) in two Dimension field is proposed. Based on this model, a Utility function is defined for SUs, considering the fairness of the sensing time cost with the power allocation. We prove that the game with this utility function converges to its unique Nash equilibrium. Also we point out the system parameter of time slot T should be jointly designed with the power allocation under the cooperative sensing time constraint. Numerical results are provided to show the performance of PASTG. It is show that the sensing time is influenced by the power allocation. More transmitting power used should contribute more sensing cost in overall system. Along with the number of secondary user increasing, the achievable power balancing SINR are decreased significantly and the cost of the power is increasing sharply.
Keywords
cognitive radio; game theory; Nash game algorithm; cognitive radio networks; cooperative sensing time constraint; dimension field; distributed power allocation joint sensing time; power balancing SINR; secondary user; sensing cost; utility function; Games; Interference; Nash equilibrium; Power control; Resource management; Sensors; Signal to noise ratio; Cognitive radio; game theory; power allocation; sensing time;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication Technology (ICCT), 2011 IEEE 13th International Conference on
Conference_Location
Jinan
Print_ISBN
978-1-61284-306-3
Type
conf
DOI
10.1109/ICCT.2011.6157868
Filename
6157868
Link To Document