DocumentCode :
2201918
Title :
Performance of round robin policies for dynamic multichannel access
Author :
Wang, Changmian ; Krishnamachari, Bhaskar ; Zhao, Qing ; Øien, Geir E.
Author_Institution :
Norwegian Univ. of Sci. & Technol., Trondheim, Norway
fYear :
2010
fDate :
Jan. 31 2010-Feb. 5 2010
Firstpage :
1
Lastpage :
7
Abstract :
We consider two simple round-robin sensing policies for dynamic multi-channel access in cognitive radio networks-one in which channel switching takes place when the primary user is sensed to be present, and one in which a channel switching takes place when the primary user is sensed to be absent. Prior work has shown that these policies are each optimal under certain conditions when the primary user occupancy on each channel can be described as an independent two-state Markov chain. In this work, we consider a very general case where the primary user occupancy on each channel is an arbitrary stationary and ergodic two-state process, and derive bounds on their performance. The bounds provide insights into conditions under which these extremely simple policies perform well.
Keywords :
Markov processes; cognitive radio; multi-access systems; telecommunication switching; wireless channels; Markov chain; channel switching; cognitive radio network; dynamic multichannel access; ergodic two-state process; performance bound; round-robin sensing policy; stationary two-state process; Cognitive radio; Radio frequency; Radiofrequency identification; Round robin; Switches; Throughput; Wireless communication;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory and Applications Workshop (ITA), 2010
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4244-7012-9
Electronic_ISBN :
978-1-4244-7014-3
Type :
conf
DOI :
10.1109/ITA.2010.5454116
Filename :
5454116
Link To Document :
بازگشت