TY - GEN
T1 - Priority based dynamic spectrum access with QoS and interference temperature constraints
AU - Xing, Yiping
AU - Mathur, Chetan N.
AU - Haleem, M. A.
AU - Chandramouli, R.
AU - Subbalakshmi, K. P.
PY - 2006
Y1 - 2006
N2 - We study the problem of dynamic spectrum access by secondary users with minimum signal to interference noise ratio (quality of service (QoS)) and interference temperature constraints. A non-linear optimization problem with the objective to maximize the total transmitting rate of the secondary users is formulated. The non-linear optimization is solved efficiently using geometric programming techniques. When not all the secondary links can be supported with their QoS requirement, a reduced complexity search algorithm is introduced to find the optimal subset of allowable links. Secondary users may belong to different priority classes. Accessing opportunities should be proportional to priorities. Therefore, we defined a secondary spectrum sharing potential game which takes these priority classes into consideration. The Nash equilibria of this potential game are reached by distributed sequential play. The efficiency of the Nash equilibria solutions are characterized. Finally, the performances of both the reduced complexity algorithm and the sequential play are examined through simulations.
AB - We study the problem of dynamic spectrum access by secondary users with minimum signal to interference noise ratio (quality of service (QoS)) and interference temperature constraints. A non-linear optimization problem with the objective to maximize the total transmitting rate of the secondary users is formulated. The non-linear optimization is solved efficiently using geometric programming techniques. When not all the secondary links can be supported with their QoS requirement, a reduced complexity search algorithm is introduced to find the optimal subset of allowable links. Secondary users may belong to different priority classes. Accessing opportunities should be proportional to priorities. Therefore, we defined a secondary spectrum sharing potential game which takes these priority classes into consideration. The Nash equilibria of this potential game are reached by distributed sequential play. The efficiency of the Nash equilibria solutions are characterized. Finally, the performances of both the reduced complexity algorithm and the sequential play are examined through simulations.
UR - http://www.scopus.com/inward/record.url?scp=34547532742&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34547532742&partnerID=8YFLogxK
U2 - 10.1109/ICC.2006.255334
DO - 10.1109/ICC.2006.255334
M3 - Conference contribution
AN - SCOPUS:34547532742
SN - 1424403553
SN - 9781424403554
T3 - IEEE International Conference on Communications
SP - 4420
EP - 4425
BT - 2006 IEEE International Conference on Communications, ICC 2006
T2 - 2006 IEEE International Conference on Communications, ICC 2006
Y2 - 11 July 2006 through 15 July 2006
ER -