TY - GEN
T1 - Medium access in cognitive radio networks
T2 - 2008 42nd Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2008
AU - Lai, Lifeng
AU - Jiang, Hai
AU - Poor, H. Vincent
PY - 2008/12/1
Y1 - 2008/12/1
N2 - This paper considers the design of medium access control protocols for cognitive radio networks in a highly dynamic environment. In the scenario under consideration, multiple cognitive users seek to opportunistically exploit the availability of empty frequency bands within parts of the radio spectrum having multiple bands. The availability of each channel is modelled as a Markov chain. The scenario in which the parameters of the Markov chain of each channel is known is first considered. An optimal symmetric strategy that maximizes the total throughput of the cognitive users is developed. Next, the situation in which the parameters of each channel are unknown a priori is considered. This problem is modelled as a competitive multiuser bandit problem, a non-trivial extension of the classical bandit problem. Low complexity medium access protocols, which strike an optimal balance between exploration and exploitation in such competitive environments, are developed. The operating points of these low complexity protocols are shown to converge to those of the scenario in which the parameters are known.
AB - This paper considers the design of medium access control protocols for cognitive radio networks in a highly dynamic environment. In the scenario under consideration, multiple cognitive users seek to opportunistically exploit the availability of empty frequency bands within parts of the radio spectrum having multiple bands. The availability of each channel is modelled as a Markov chain. The scenario in which the parameters of the Markov chain of each channel is known is first considered. An optimal symmetric strategy that maximizes the total throughput of the cognitive users is developed. Next, the situation in which the parameters of each channel are unknown a priori is considered. This problem is modelled as a competitive multiuser bandit problem, a non-trivial extension of the classical bandit problem. Low complexity medium access protocols, which strike an optimal balance between exploration and exploitation in such competitive environments, are developed. The operating points of these low complexity protocols are shown to converge to those of the scenario in which the parameters are known.
UR - http://www.scopus.com/inward/record.url?scp=70349656809&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349656809&partnerID=8YFLogxK
U2 - 10.1109/ACSSC.2008.5074370
DO - 10.1109/ACSSC.2008.5074370
M3 - Conference contribution
AN - SCOPUS:70349656809
SN - 9781424429417
T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers
SP - 98
EP - 102
BT - 2008 42nd Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2008
Y2 - 26 October 2008 through 29 October 2008
ER -