Distributed algorithm for collaborative detection in cognitive radio networks

Authors:
Yingbin Liang;Lifeng Lai;John Halloran
Affiliations:
Department of Electrical Engineering, University of Hawaii, Honolulu, HI;Department of Systems Engineering, University of Arkansas at Little Rock, Little Rock, AR;Department of Electrical Engineering, University of Hawaii, Honolulu, HI
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 4
Cited 0

Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning

Probabilistic Graphical Models: Principles and Techniques - Adaptive Computation and Machine Learning
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
Spatiotemporal Sensing in Cognitive Radio Networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A cognitive radio wireless network is investigated, in which a number of primary users (PUs) transmit in orthogonal frequency bands. There are also a number of secondary users (SUs) in the network, which monitor transmission opportunities in these frequency bands by collaboratively detecting whether each PU is transmitting. Each SU can participate in detecting only one PU's transmission at a time although it may locate in multiple PUs' detection ranges. A network management issue is studied, which addresses the best assignment of SUs to detecting PUs so that the overall probability of detection error is minimized. A distributed implementation of the elimination algorithm is proposed to efficiently find the best assignment by drawing connection between the current problem and the inference problem in the context of probabilistic graphic models. The graphic representation of the problem is also discussed.