DocumentCode :
82267
Title :
Throughput Optimal Multi-Slot Sensing Procedure for a Cognitive Radio
Author :
Umashankar, G. ; Kannu, Arun Pachai
Author_Institution :
Dept. of Electr. Eng., Indian Inst. of Technol. Madras, Chennai, India
Volume :
17
Issue :
12
fYear :
2013
fDate :
Dec-13
Firstpage :
2292
Lastpage :
2295
Abstract :
We consider a cognitive radio system with M primary channels where users´ data transmissions follow a slotted structure. We consider the scenario where the channel availability statistics are correlated across channels as well as across time slots. In each slot, the cognitive user (CU) senses channels one by one until a suitable channel is found for data transmission. CU adapts theCognitive Radio data rate based on the channel´s fading gain. We employ a Markov chain model to capture the channel availability statistics across the slots. We address the problem of finding optimal sensing order/procedure in every slot based on the history of sensed channels (including the previous slots), in order to maximize the total CU throughput over N-slots. Using theory of optimal stopping, we derive recursive expressions for the optimal multi-slot CU throughput and find the optimal multi-slot sensing order/procedure using dynamic programming. We also study few sub-optimal sensing procedures. Using numerical results, we illustrate the gains in exploiting the correlation of channel availability statistics.
Keywords :
Markov processes; cognitive radio; dynamic programming; fading channels; recursive estimation; telecommunication network reliability; CU throughput; Markov chain; channel availability statistics; cognitive radio system; cognitive user; data rate; data transmissions; dynamic programming; fading gain; optimal stopping; primary channels; recursive expressions; suboptimal sensing procedures; throughput optimal multislot sensing procedure; time slots; Availability; Cognitive radio; History; Markov processes; Sensors; Throughput; Vectors; Markov channel; Spectrum sensing order; cognitive radio throughput; dynamic programming; optimal stopping rule;
fLanguage :
English
Journal_Title :
Communications Letters, IEEE
Publisher :
ieee
ISSN :
1089-7798
Type :
jour
DOI :
10.1109/LCOMM.2013.102613.131825
Filename :
6656068
Link To Document :
بازگشت