By Topic

Robust Scheduling and Power Control for Vertical Spectrum Sharing in STDMA Wireless 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
$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

4 Author(s)
Phond Phunchongharn ; Department of Electrical and Computer Engineering, University of Manitoba, 75A Chancellor's Circle, Winnipeg, MB R3T 5V6 Canada ; Ekram Hossain ; Long Bao Le ; Sergio Camorlinga

We study the robust transmission scheduling and power control problem for spectrum sharing between secondary and primary users in a spatial reuse time-division multiple access (STDMA) network. The objective is to find a robust minimum-length schedule for secondary users (in terms of time slots) subject to the interference constraints for primary users and the traffic demand of secondary users. We consider the fact that power allocation based on average (or estimated) link gains can be improper since actual link gains can be different from the average link gains. Therefore, transmission of the secondary links may fail and require more time slots. We also consider this demand uncertainty arising from channel gain uncertainty. We propose a column generation-based algorithm to solve the scheduling and power control problem for secondary users. The column generation method breaks the problem down to a restricted master problem and a pricing problem. However, the classical column generation method can have convergence problem due to primal degeneracy. We propose an improved column generation algorithm to stabilize and accelerate the column generation procedure by using the perturbation and exact penalty methods. Furthermore, we propose an efficient heuristic algorithm for the pricing problem based on a greedy algorithm. For the simulation scenario considered in this paper, the proposed stabilized column generation algorithm can obtain the optimal schedules with 18.85% reduction of the number of iterations and 0.29% reduction of the number of time slots. Also, the heuristic algorithm can achieve the optimality with 0.39% of cost penalty but 1.67×10-4 times reduction of runtime.

Published in:

IEEE Transactions on Wireless Communications  (Volume:11 ,  Issue: 5 )