HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Electronic and Computer Engineering  >
ECE Journal/Magazine Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1783.1/7454
Title: Optimal scheduling of cooperative spectrum sensing in cognitive radio networks
Authors: Zhang, Tengyi
Wu, Yuan
Lang, Ke
Tsang, Danny H. K.
Keywords: Cognitive radio
Cooperative sensing scheduling
Partially observable Markov decision process
Issue Date: Dec-2010
Citation: IEEE systems journal, v. 4, no. 4, December 2010, p. 535-549
Abstract: In Cognitive Radio (CR) networks, secondary users can be coordinated to perform spectrum sensing so as to detect primary user activities more accurately. However, more sensing cooperations for a channel may decrease the transmission time of the secondary users, or lose opportunities for exploiting other channels. In this paper, we study this tradeoff by using the theory of Partially Observable Markov Decision Process (POMDP). This formulation leads to an optimal sensing scheduling policy that determines which secondary users sense which channels with what miss detection probability and false alarm probability. A myopic policy with lower complexity yet comparable performance is also proposed. We further analytically study the properties andthe solution structure for the myopic and the optimal policies under a simplified system model. Theoretical results reveal that under certain conditions, some simple but robust structures of the value function exist, which lead to an easy way to obtain the solution of POMDP. Moreover, the cooperative sensing scheduling problem embedded in our POMDP, which is generally a hard combinatorial problem, can be analyzed in an efficient way. Numerical and simulation results are provided to illustrate that our design can utilize the spectrum more efficiently for cognitive radio users.
Rights: © 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
URI: http://hdl.handle.net/1783.1/7454
Appears in Collections:ECE Journal/Magazine Articles

Files in This Item:

File Description SizeFormat
3_Optimal_Scheduling.pdfpre-published version189KbAdobe PDFView/Open

Find published version via OpenURL Link Resolver

All items in this Repository are protected by copyright, with all rights reserved.