%0 Conference Proceedings %T Discrete Time Analysis of Cognitive Radio Networks with Saturated Source of Secondary Users %+ University of Manitoba [Winnipeg] %+ Universitat Politècnica de València = Universitad Politecnica de Valencia = Polytechnic University of Valencia (UPV) %A Alfa, Attahiru, S. %A Pla, Vicent %A Martinez-Bauset, Jorge %A Casares-Giner, Vicente %Z Part 1: - PE-CRN 2011 Workshop %< avec comité de lecture %( Lecture Notes in Computer Science %B International IFIP TC 6 Workshops PE-CRN, NC-Pro, WCNS, and SUNSET 2011 Held at NETWORKING 2011 (NETWORKING) %C Valencia, Spain %Y Vicente Casares-Giner %Y Pietro Manzoni %Y Ana Pont %I Springer %3 NETWORKING 2011 Workshops %V LNCS-6827 %P 3-12 %8 2011-05-13 %D 2011 %R 10.1007/978-3-642-23041-7_1 %Z Computer Science [cs] %Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers %X The strategy used for sensing in a cognitive radio network affects the white space that secondary users (SUs) perceive and hence their throughput. For example, let the average time interval between consecutive sensing be fixed as τ. There are several possible ways to achieve this mean value. The SU may sense the channel at equal intervals of length τ or sense it at randomly spaced intervals with mean value τ and guided by, for example, geometric distribution, uniform distribution, etc. In the end the strategy selected does affect the available white space and throughput as well as the resources spent on sensing. In this paper we present a discrete time Markov chain model for cognitive radio network and use it to obtain the efficiency of sensing strategies. The system studied is one in which we have a saturated source of secondary users. These assumptions do not in any ways affect our results. %G English %Z TC 6 %2 https://inria.hal.science/hal-01587853/document %2 https://inria.hal.science/hal-01587853/file/978-3-642-23041-7_1_Chapter.pdf %L hal-01587853 %U https://inria.hal.science/hal-01587853 %~ IFIP-LNCS %~ IFIP %~ IFIP-TC %~ IFIP-TC6 %~ IFIP-NETWORKING %~ IFIP-LNCS-6827