Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Joint Link Scheduling, Beamforming and Power Control for Maximizing the Sum-Rate of Cognitive Wireless Mesh 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

2 Author(s)
Islam, M.H. ; Ecole de Technol. Super. (ETS), Montreal, QC, Canada ; Dziong, Z.

We consider a time division multiple access (TDMA) based cognitive wireless mesh network (CWMN), where pairs of mesh nodes communicate with each other by sharing a spectrum that is licensed to a primary network with multiple primary users (PUs) who have exclusive right to occupy the spectrum. All the mesh nodes are equipped with multiple antennas capable of beamforming. For such a system, we investigate joint link scheduling, beamforming and power control with the objective of maximizing the sum-rate of CWMN under the minimum data rate requirement constraint of each mesh link (mesh node pair), total transmit power constraint of CWMN in a time slot, and maximum allowable interference constraint of each primary user (PU). The sum-rate maximization subject to the above mentioned constraints gives rise to a non-convex mixed integer nonlinear programming (MINLP) problem which is practically intractable. In order to find an efficient solution of the MINLP, we employ an extended duality based algorithm that uses multiple penalty multipliers to remove the duality gap of the non-convex MINLP problem. Simulation results show that the extended duality based solution performs very close to the optimal solution obtained by exhaustive search algorithm.

Published in:

Vehicular Technology Conference (VTC Spring), 2011 IEEE 73rd

Date of Conference:

15-18 May 2011