TY - JOUR
T1 - Optimal multi-channel cooperative sensing in cognitive radio networks
AU - Fan, Rongfei
AU - Jiang, Hai
PY - 2010/3
Y1 - 2010/3
N2 - 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.
AB - 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.
KW - Cognitive radio
KW - Spectrum sensing
KW - Throughput maximization
UR - http://www.scopus.com/inward/record.url?scp=77949558904&partnerID=8YFLogxK
U2 - 10.1109/TWC.2010.03.090467
DO - 10.1109/TWC.2010.03.090467
M3 - Article
AN - SCOPUS:77949558904
SN - 1536-1276
VL - 9
SP - 1128
EP - 1138
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 3
M1 - 5427444
ER -