Abstract
In this paper, we propose several channel allocation schemes via the Game theoretical approaches for the distributed CR networks. Distinguished from the literature, more important factors are taken into account when designing the potential games for the interweave and underlay CR networks, i.e. the queueing delay, complete inter-system interference and protection of primary users (PUs). Particularly, in the underlay CR networks, a PU can be protected by adaptively adjusting the cost for secondary users (SUs) to share a subchannel with him. Consequently, SUs and PUs can achieve higher end-to-end throughput and maintain the desired signal-to-noise-and-interference ratio, respectively. Moreover, for proving the convergence of the proposed schemes, the associated potential functions are also defined. Via the simulation results, the proposed schemes are proved to be capable of effectively reducing the queuing delay at the cost of the slightly decreased throughput.
| Original language | English |
|---|---|
| Title of host publication | 2012 Conference Handbook - Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2012 |
| Publication status | Published - 2012 |
| Event | 2012 4th Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2012 - Hollywood, CA, United States Duration: 2012 Dec 3 → 2012 Dec 6 |
Other
| Other | 2012 4th Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2012 |
|---|---|
| Country | United States |
| City | Hollywood, CA |
| Period | 12-12-03 → 12-12-06 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Information Systems
Cite this
}
Game theoretic channel allocation for the delay-sensitive cognitive radio networks. / Chang, Chih-Wen; Yang, Yun Li.
2012 Conference Handbook - Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2012. 2012. 6411934.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Game theoretic channel allocation for the delay-sensitive cognitive radio networks
AU - Chang, Chih-Wen
AU - Yang, Yun Li
PY - 2012
Y1 - 2012
N2 - In this paper, we propose several channel allocation schemes via the Game theoretical approaches for the distributed CR networks. Distinguished from the literature, more important factors are taken into account when designing the potential games for the interweave and underlay CR networks, i.e. the queueing delay, complete inter-system interference and protection of primary users (PUs). Particularly, in the underlay CR networks, a PU can be protected by adaptively adjusting the cost for secondary users (SUs) to share a subchannel with him. Consequently, SUs and PUs can achieve higher end-to-end throughput and maintain the desired signal-to-noise-and-interference ratio, respectively. Moreover, for proving the convergence of the proposed schemes, the associated potential functions are also defined. Via the simulation results, the proposed schemes are proved to be capable of effectively reducing the queuing delay at the cost of the slightly decreased throughput.
AB - In this paper, we propose several channel allocation schemes via the Game theoretical approaches for the distributed CR networks. Distinguished from the literature, more important factors are taken into account when designing the potential games for the interweave and underlay CR networks, i.e. the queueing delay, complete inter-system interference and protection of primary users (PUs). Particularly, in the underlay CR networks, a PU can be protected by adaptively adjusting the cost for secondary users (SUs) to share a subchannel with him. Consequently, SUs and PUs can achieve higher end-to-end throughput and maintain the desired signal-to-noise-and-interference ratio, respectively. Moreover, for proving the convergence of the proposed schemes, the associated potential functions are also defined. Via the simulation results, the proposed schemes are proved to be capable of effectively reducing the queuing delay at the cost of the slightly decreased throughput.
UR - http://www.scopus.com/inward/record.url?scp=84874427583&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84874427583&partnerID=8YFLogxK
M3 - Conference contribution
SN - 9780615700502
BT - 2012 Conference Handbook - Asia-Pacific Signal and Information Processing Association Annual Summit and Conference, APSIPA ASC 2012
ER -