TY - GEN
T1 - Multi-channel selection maximizing throughput for delay-constrained multi-application secondary users in dynamic cognitive radio networks
AU - Zappaterra, Luca
AU - Choi, Hyeong Ah
AU - Cheng, Xiuzhen
AU - Znati, Taieb
PY - 2014
Y1 - 2014
N2 - In dynamic cognitive radio networks (CRNs) secondary users (SUs) sense the spectrum bands to find temporal absence of primary users (PUs) and immediately transmit on the identified spectrum holes. SUs sequentially sense the channels, stopping when the available resources are expected to provide the best throughput performance. Following, the selected channels are exploited using multi-channel transmission. In this paper, the multi-channel selection problem for SUs supporting multiple applications generating traffic with different latency requirements is formulated in a CRN with both heterogeneous PU-traffic and channel conditions. We have proposed an optimal solution overcoming the expensive computations and storage requirements typical of optimal stopping problems. Our efficient algorithm only requires linear-time and quadratic-space complexities in the online decision phase, aided by statistical decision values efficiently pre-computed offline. Extensive evaluations validate our solution as a significant improvement over the application of existing solutions, all based on the well-known backward induction technique or its approximations, characterized by either intractable algorithmic complexities or approximate results.
AB - In dynamic cognitive radio networks (CRNs) secondary users (SUs) sense the spectrum bands to find temporal absence of primary users (PUs) and immediately transmit on the identified spectrum holes. SUs sequentially sense the channels, stopping when the available resources are expected to provide the best throughput performance. Following, the selected channels are exploited using multi-channel transmission. In this paper, the multi-channel selection problem for SUs supporting multiple applications generating traffic with different latency requirements is formulated in a CRN with both heterogeneous PU-traffic and channel conditions. We have proposed an optimal solution overcoming the expensive computations and storage requirements typical of optimal stopping problems. Our efficient algorithm only requires linear-time and quadratic-space complexities in the online decision phase, aided by statistical decision values efficiently pre-computed offline. Extensive evaluations validate our solution as a significant improvement over the application of existing solutions, all based on the well-known backward induction technique or its approximations, characterized by either intractable algorithmic complexities or approximate results.
UR - http://www.scopus.com/inward/record.url?scp=84905054475&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84905054475&partnerID=8YFLogxK
U2 - 10.4108/icst.crowncom.2014.255406
DO - 10.4108/icst.crowncom.2014.255406
M3 - Conference contribution
AN - SCOPUS:84905054475
SN - 9781631900037
T3 - Proceedings of the 2014 9th International Conference on Cognitive Radio Oriented Wireless Networks and Communications, CROWNCOM 2014
SP - 366
EP - 371
BT - Proceedings of the 2014 9th International Conference on Cognitive Radio Oriented Wireless Networks and Communications, CROWNCOM 2014
PB - IEEE Computer Society
T2 - 9th International Conference on Cognitive Radio Oriented Wireless Networks, CROWNCOM 2014
Y2 - 2 June 2014 through 4 June 2014
ER -