Resource allocation problems: algorithmic approaches
Resource allocation problems: algorithmic approaches
IEEE Spectrum
Convex Optimization
Optimal selection of channel sensing order in cognitive radio
IEEE Transactions on Wireless Communications
Cognitive Medium Access: Exploration, Exploitation, and Competition
IEEE Transactions on Mobile Computing
Cooperative Spectrum Sensing in Cognitive Radio, Part I: Two User Networks
IEEE Transactions on Wireless Communications
Cooperative Spectrum Sensing in Cognitive Radio, Part II: Multiuser Networks
IEEE Transactions on Wireless Communications
Sensing-Throughput Tradeoff for Cognitive Radio Networks
IEEE Transactions on Wireless Communications
Cognitive radio: brain-empowered wireless communications
IEEE Journal on Selected Areas in Communications
Spectrum sensing: A distributed approach for cognitive terminals
IEEE Journal on Selected Areas in Communications
Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: A POMDP framework
IEEE Journal on Selected Areas in Communications
Stable throughput of secondary user in cognitive relay system
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Throughput-efficient dynamic coalition formation in distributed cognitive radio networks
EURASIP Journal on Wireless Communications and Networking
International Journal of Communication Systems
Joint iterative algorithm for optimal cooperative spectrum sensing in cognitive radio networks
Computer Communications
Optimal non-identical sensing setting for multi channels in cognitive radio networks
Computer Communications
Hi-index | 0.01 |
In this paper, optimal multi-channel cooperative sensing strategies in cognitive radio networks are investigated. A cognitive radio network with multiple potential channels is considered. Secondary users cooperatively sense the channels and send the sensing results to a coordinator, in which energy detection with a soft decision rule is employed to estimate whether there are primary activities in the channels. An optimization problem is formulated, which maximizes the throughput of secondary users while keeping detection probability for each channel above a pre-defined threshold. In particular, two sensing modes are investigated: slotted-time sensing mode and continuous-time sensing mode. With a slotted-time sensing mode, the sensing time of each secondary user consists of a number of minislots, each of which can be used to sense one channel. The initial optimization problem is shown to be a nonconvex mixedinteger problem. A polynomial-complexity algorithm is proposed to solve the problem optimally. With a continuous-time sensing mode, the sensing time of each secondary user for a channel can be any arbitrary continuous value. The initial nonconvex problem is converted into a convex bilevel problem, which can be successfully solved by existing methods. Numerical results are presented to demonstrate the effectiveness of our proposed algorithms.