TY - GEN
T1 - Stable multiuser channel allocations in opportunistic spectrum access
AU - Huang, Li
AU - Zhu, Guangxi
AU - Du, Xiaojiang
AU - Bian, Kaigui
PY - 2013
Y1 - 2013
N2 - We consider the distributed channel allocation problem in an asymmetrical opportunistic spectrum access (OSA) system where each secondary user possibly has different channel reward even in the same channel due to geographic dispersion. We formulate this problem as a Gale-Shapley stable theorem using game theory to optimize the sum reward of all secondary users. It is challenging to achieve the stable matching of user-channel pairs without centralized control and prior knowledge of channel availability statistics. In this paper, we present a novel decentralized order-optimal learning Gale-Shapley scheme (OLGS) in which secondary users learn from their local history data and individually adjust their behaviors in a time-varying OSA system. The proposed scheme eliminates collisions among secondary users by a one-to-one user-channel matching policy. It also achieves stable spectral allocations using learning method without assuming known channel parameters and independent of information exchange among secondary users. Simulation results show that the system regret of the OLGS solution grows with time at the logarithmic order with low complexity.
AB - We consider the distributed channel allocation problem in an asymmetrical opportunistic spectrum access (OSA) system where each secondary user possibly has different channel reward even in the same channel due to geographic dispersion. We formulate this problem as a Gale-Shapley stable theorem using game theory to optimize the sum reward of all secondary users. It is challenging to achieve the stable matching of user-channel pairs without centralized control and prior knowledge of channel availability statistics. In this paper, we present a novel decentralized order-optimal learning Gale-Shapley scheme (OLGS) in which secondary users learn from their local history data and individually adjust their behaviors in a time-varying OSA system. The proposed scheme eliminates collisions among secondary users by a one-to-one user-channel matching policy. It also achieves stable spectral allocations using learning method without assuming known channel parameters and independent of information exchange among secondary users. Simulation results show that the system regret of the OLGS solution grows with time at the logarithmic order with low complexity.
UR - http://www.scopus.com/inward/record.url?scp=84881578231&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84881578231&partnerID=8YFLogxK
U2 - 10.1109/WCNC.2013.6554822
DO - 10.1109/WCNC.2013.6554822
M3 - Conference contribution
AN - SCOPUS:84881578231
SN - 9781467359399
T3 - IEEE Wireless Communications and Networking Conference, WCNC
SP - 1715
EP - 1720
BT - 2013 IEEE Wireless Communications and Networking Conference, WCNC 2013
T2 - 2013 IEEE Wireless Communications and Networking Conference, WCNC 2013
Y2 - 7 April 2013 through 10 April 2013
ER -