TY - GEN
T1 - Optimal medium access protocols for cognitive radio networks
AU - Lai, Lifeng
AU - El Gamal, Hesham
AU - Jiang, Hai
AU - Vincent Poor, H.
N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2008
Y1 - 2008
N2 - This paper focuses on the design of medium access control protocols for cognitive radio networks. The scenario in which a single cognitive user wishes to opportunistically exploit the availability of empty frequency bands within parts of the radio spectrum having multiple bands is first considered. In this scenario, the availability probability of each channel is unknown a priori to the cognitive user. Hence efficient medium access strategies must strike a balance between exploring (learning) the availability probability of the channels and exploiting the knowledge of the availability probability identified thus far. For this scenario, an optimal medium access strategy is derived and its underlying recursive structure is illustrated via examples. To avoid the prohibitive computational complexity of this optimal strategy, a low complexity asymptotically optimal strategy is developed. Next, the multi-cognitive user scenario is considered and low complexity medium access protocols, which strike an optimal balance between exploration and exploitation in such competitive environments, are developed.
AB - This paper focuses on the design of medium access control protocols for cognitive radio networks. The scenario in which a single cognitive user wishes to opportunistically exploit the availability of empty frequency bands within parts of the radio spectrum having multiple bands is first considered. In this scenario, the availability probability of each channel is unknown a priori to the cognitive user. Hence efficient medium access strategies must strike a balance between exploring (learning) the availability probability of the channels and exploiting the knowledge of the availability probability identified thus far. For this scenario, an optimal medium access strategy is derived and its underlying recursive structure is illustrated via examples. To avoid the prohibitive computational complexity of this optimal strategy, a low complexity asymptotically optimal strategy is developed. Next, the multi-cognitive user scenario is considered and low complexity medium access protocols, which strike an optimal balance between exploration and exploitation in such competitive environments, are developed.
UR - http://www.scopus.com/inward/record.url?scp=51949103213&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51949103213&partnerID=8YFLogxK
U2 - 10.1109/WIOPT.2008.4586086
DO - 10.1109/WIOPT.2008.4586086
M3 - Conference contribution
AN - SCOPUS:51949103213
SN - 9789639799189
T3 - Proceedings of the 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2008
SP - 328
EP - 334
BT - Proceedings of the 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2008
T2 - 6th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, Wiopt 2008
Y2 - 1 April 2008 through 3 April 2008
ER -