TY - GEN
T1 - Real-time secondary spectrum sharing with QoS provisioning
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 quality of service (QoS) issue in secondary spectrum sharing subject to an interference temperature constraint. 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 searching algorithm is introduced to find the optimal subset of links which contains the maximum number of links with both QoS and interference temperature constraints satisfied. We also defined a secondary spectrum sharing potential game. The Nash equilibria of this potential game are reached by distributed sequential play. The efficiency of the Nash equilibria solutions is characterized. Finally, the performances of both the reduced complexity algorithm and the sequential play are examined through simulations.
AB - We study the quality of service (QoS) issue in secondary spectrum sharing subject to an interference temperature constraint. 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 searching algorithm is introduced to find the optimal subset of links which contains the maximum number of links with both QoS and interference temperature constraints satisfied. We also defined a secondary spectrum sharing potential game. The Nash equilibria of this potential game are reached by distributed sequential play. The efficiency of the Nash equilibria solutions is 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=33749060844&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33749060844&partnerID=8YFLogxK
U2 - 10.1109/CCNC.2006.1593100
DO - 10.1109/CCNC.2006.1593100
M3 - Conference contribution
AN - SCOPUS:33749060844
SN - 1424400856
SN - 9781424400850
T3 - 2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006
SP - 630
EP - 634
BT - 2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006
T2 - 2006 3rd IEEE Consumer Communications and Networking Conference, CCNC 2006
Y2 - 8 January 2006 through 10 January 2006
ER -