TY - GEN
T1 - Price-based spectrum management in cognitive radio networks
AU - Wang, Fan
AU - Krunz, Marwan
AU - Cui, Shuguang
PY - 2007
Y1 - 2007
N2 - A key challenge in operating cognitive radios (CRs) in a self-organizing (ad hoc) network is how to adaptively and efficiently allocate transmission powers and spectrum among CRs according to the surrounding environment. Most previous works address this issue via heuristic approaches or using centralized solutions. In this paper, we present a novel joint power/channel allocation scheme that uses a distributed pricing strategy to improve the network's performance. In this scheme, the spectrum allocation problem is modelled as a non-cooperative game. A price-based iterative water-filling (PIWF) algorithm is proposed, which allows users to converge to the Nash Equilibrium (NE). This PIWF algorithm can be implemented distributively with CRs repeatedly negotiating their best transmission powers and spectrum. Simulation results show that the social optimality of the NE solution is dramatically improved with our price-based strategy. Based on the orders by which CRs take actions, we study sequential and parallel versions of the algorithm. We show that the parallel version converges faster than the sequential version.
AB - A key challenge in operating cognitive radios (CRs) in a self-organizing (ad hoc) network is how to adaptively and efficiently allocate transmission powers and spectrum among CRs according to the surrounding environment. Most previous works address this issue via heuristic approaches or using centralized solutions. In this paper, we present a novel joint power/channel allocation scheme that uses a distributed pricing strategy to improve the network's performance. In this scheme, the spectrum allocation problem is modelled as a non-cooperative game. A price-based iterative water-filling (PIWF) algorithm is proposed, which allows users to converge to the Nash Equilibrium (NE). This PIWF algorithm can be implemented distributively with CRs repeatedly negotiating their best transmission powers and spectrum. Simulation results show that the social optimality of the NE solution is dramatically improved with our price-based strategy. Based on the orders by which CRs take actions, we study sequential and parallel versions of the algorithm. We show that the parallel version converges faster than the sequential version.
UR - http://www.scopus.com/inward/record.url?scp=51349099444&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51349099444&partnerID=8YFLogxK
U2 - 10.1109/CROWNCOM.2007.4549775
DO - 10.1109/CROWNCOM.2007.4549775
M3 - Conference contribution
AN - SCOPUS:51349099444
SN - 1424408156
SN - 9781424408153
T3 - Proceedings of the 2nd International Conference on Cognitive Radio Oriented Wireless Networks and Communications, CrownCom
SP - 70
EP - 78
BT - Proceedings of the 2nd International Conference on Cognitive Radio Oriented Wireless Networks and Communications, CrownCom
T2 - 2nd International Conference on Cognitive Radio Oriented Wireless Networks and Communications, CrownCom
Y2 - 1 August 2007 through 3 August 2007
ER -