By Topic

Distributed Cognitive Radio Network Management via Algorithms in Probabilistic Graphical Models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yingbin Liang ; Department of Electrical Engineering and Computer Science, Syracuse University, Syracuse, NY 13244, USA ; Lifeng Lai ; John Halloran

In this paper, cognitive radio wireless networks are investigated, in which a number of primary users (PUs) transmit in orthogonal frequency bands, and a number of secondary users (SUs) monitor the transmission status of the PUs and search for transmission opportunities in these frequency bands by collaborative detection. A network management problem is formulated to find the configuration of SUs (assignment of SUs) to detect PUs so that the best overall network performance is achieved. Two performance metrics are considered, both of which characterize the probability of errors for detecting transmission status of all PUs. For both metrics, a graphical representation of the problem is provided, which facilitates to connect the problems under study to the sum-product inference problem studied in probabilistic graphical models. Based on the elimination algorithm that solves the sum-product problem, a message passing algorithm is proposed to solve the problem under study in a computationally efficient manner and in a distributed fashion. The complexity of the algorithm is shown to be significantly lower than that of the exhaustive search approach. Moreover, a clique-tree algorithm is applied to efficiently compute the impacts of each SU's choice on the overall system performance. Finally, simulation results are provided to demonstrate the considerable performance enhancement achieved by implementing an optimal assignment of SUs.

Published in:

IEEE Journal on Selected Areas in Communications  (Volume:29 ,  Issue: 2 )