On the Delay and Data Rate Performance of Throughput-Efficient Multi-Channel Access Algorithms in Cognitive Radio Networks

Published

July 8, 2013

Author(s)

Kamran Sayrafian, Luca Zappaterra, Hyeong-Ah Choi, Jari Iinatti

Abstract

Cognitive Radio Networks (CRNs) are designed to increase spectrum utilization by allowing unlicensed secondary users (SUs) to operate over existing wireless channels where primary users (PUs) have license to transmit. An SU searches for channels not currently occupied by PUs, it estimates their link quality and it aggregates the resources found available for transmission, by means of multi-channel access. Typically, optimal stopping algorithms decide when to interrupt the exploration phase and start exploiting the channels for transmission, with the goal of throughput maximization. In this paper we recognize the importance of evaluating the performance of throughput-efficient multi-channel access algorithms in terms of delay and data rate, which constitute fundamental traffic requirements for mobile applications. Through extensive simulations, we have derived guidelines for supporting SUs with stringent traffic requirements of delay, delay jitter and guaranteed data rate in the current multi-channel algorithms under multiple CRN scenarios. The encouraging results of the conducted performance evaluation motivate our interest in further researching multi-channel access algorithms for the optimization of application-specific requirements.

Conference Dates

July 8-10, 2013

Conference Location

Washington DC, DC

Conference Title

8th International Conference on Cognitive Radio Oriented Wireless Networks

Pub Type

Conferences

Download Paper

Local Download

Citation

Sayrafian, K. , Zappaterra, L. , Choi, H. and Iinatti, J. (2013), On the Delay and Data Rate Performance of Throughput-Efficient Multi-Channel Access Algorithms in Cognitive Radio Networks, 8th International Conference on Cognitive Radio Oriented Wireless Networks , Washington DC, DC, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=913813 (Accessed October 15, 2025)