TY - JOUR
T1 - Opportunistic spectrum access in cognitive radio networks
T2 - Global optimization using local interaction games
AU - Xu, Yuhua
AU - Wang, Jinlong
AU - Wu, Qihui
AU - Anpalagan, Alagan
AU - Yao, Yu Dong
PY - 2012/4
Y1 - 2012/4
N2 - We investigate the problem of achieving global optimization for distributed channel selections in cognitive radio networks (CRNs), using game theoretic solutions. To cope with the lack of centralized control and local influences, we propose two special cases of local interaction game to study this problem. The first is local altruistic game, in which each user considers the payoffs of itself as well as its neighbors rather than considering itself only. The second is local congestion game, in which each user minimizes the number of competing neighbors. It is shown that with the proposed games, global optimization is achieved with local information. Specifically, the local altruistic game maximizes the network throughput and the local congestion game minimizes the network collision level. Also, the concurrent spatial adaptive play (C-SAP), which is an extension of the existing spatial adaptive play (SAP), is proposed to achieve the global optimum both autonomously as well as rapidly.
AB - We investigate the problem of achieving global optimization for distributed channel selections in cognitive radio networks (CRNs), using game theoretic solutions. To cope with the lack of centralized control and local influences, we propose two special cases of local interaction game to study this problem. The first is local altruistic game, in which each user considers the payoffs of itself as well as its neighbors rather than considering itself only. The second is local congestion game, in which each user minimizes the number of competing neighbors. It is shown that with the proposed games, global optimization is achieved with local information. Specifically, the local altruistic game maximizes the network throughput and the local congestion game minimizes the network collision level. Also, the concurrent spatial adaptive play (C-SAP), which is an extension of the existing spatial adaptive play (SAP), is proposed to achieve the global optimum both autonomously as well as rapidly.
KW - Cognitive radio networks (CRNs)
KW - local altruistic game
KW - local congestion game
KW - local interaction game
KW - spatial adaptive play (SAP)
UR - http://www.scopus.com/inward/record.url?scp=84863337935&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84863337935&partnerID=8YFLogxK
U2 - 10.1109/JSTSP.2011.2176916
DO - 10.1109/JSTSP.2011.2176916
M3 - Article
AN - SCOPUS:84863337935
SN - 1932-4553
VL - 6
SP - 180
EP - 194
JO - IEEE Journal on Selected Topics in Signal Processing
JF - IEEE Journal on Selected Topics in Signal Processing
IS - 2
M1 - 6086561
ER -