By Topic

A message-passing algorithm for spectrum access in cognitive radio relay networks

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
$31 $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

4 Author(s)
Sang Hyun Lee ; Dept. of Electr. & Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA ; Shamaiah, M. ; Vishwanath, S. ; Vikalo, H.

This work addresses the spectrum access problem in cognitive radio relay networks. In our setup, primary users allow secondary users access to the channel (spectrum) as long as they agree to relay primary users' data in addition to their own. We desire to maximize the network usage by determining the best configuration of matching between primary users and secondary users. This problem can be formulated in a form similar to maximum weighted matching. Given this formulation, we develop an algorithm for this problem using affinity propagation that is fully distributed. We test its performance and demonstrate convergence.

Published in:

Signals, Systems and Computers (ASILOMAR), 2011 Conference Record of the Forty Fifth Asilomar Conference on

Date of Conference:

6-9 Nov. 2011