By Topic

Distributed Resource Allocation for Cognitive Radio Ad-Hoc Networks with Spectrum-Sharing Constraints

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

2 Author(s)
Duy Trong Ngo ; Dept. of Electr. & Comput. Eng., McGill Univ., Montreal, QC, Canada ; Le-Ngoc, Tho

In cognitive radio settings with highly dynamic primary activities and with small opportunities for secondary access, the requirement to fairly distribute the temporarily available spectral ranges among the unlicensed users turns out to be of particular relevance. The current paper addresses this issue by presenting a new design formulation that aims to optimize the performance of an orthogonal-frequency-division-multiple-access (OFDMA) ad-hoc cognitive radio network, by means of joint subcarrier assignment and power allocation. Besides important constraint on the tolerable interference induced to primary network, to efficiently implement spectrum-sharing fairness, the optimization problem considered here strictly enforces upper and lower bounds on the total amount of temporarily available bandwidth to be granted to individual secondary users. Specifically, the system throughput is maximized via the application of Lagrangian duality theory. More importantly, the dual decomposition framework also gives rise to the realization of distributed solution. As the proposed distributed protocol requires very limited cooperation among the participating network elements, it is especially applicable for the ad-hoc networking environment under investigation, to which any central processing or control is certainly inaccessible. While the computational complexity of the devised algorithm is affordable, its performance in practical scenarios also attains the actual global optimum. The potential of the proposed approach is verified through asymptotic complexity analysis and via numerical examples.

Published in:

Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE

Date of Conference:

6-10 Dec. 2010