By Topic

Leveraging Multi-User Diversity, Channel Diversity and Spatial Reuse for Efficient Scheduling in Wireless 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

5 Author(s)
Shen Wan ; Dept. of Electr. Eng. & Comput. Sci., Syracuse Univ., Syracuse, NY, USA ; Jian Tang ; Mumey, B. ; Wolff, R.S.
more authors

Relay stations can be deployed in a wireless network to extend its coverage and improve its capacity. In this paper, we study a scheduling problem in OFDMA-based wireless relay networks with consideration for multi-user diversity, channel diversity and spatial reuse. First, we present a Mixed Integer Linear Programming (MILP) formulation to provide optimum solutions. It has been shown by previous research that performance of a wireless scheduling algorithm is usually related to the interference degree delta, which is the maximum number of links that interfere with a common link but do not interfere with each other. Therefore, we then show that the interference degree delta is at most 4 for any 2-hop relay network and 14 for any general h-hop (h >; 1) relay network. Furthermore, we present a simple greedy algorithm for the scheduling problem and show it has an approximation ratio of 1/(1+δ), which leads to an approximation ratio of 1/5 for the 2-hop case and 1/15} for the general case. In addition, we present three heuristic algorithms, namely, the weighted degree greedy algorithm, the Maximum Weighted Independent Set (MWIS) algorithm and the Linear Programming (LP) rounding algorithm, to solve the scheduling problem. Extensive simulation results have showed that the LP rounding algorithm performs best and always provides close-to-optimum solutions. The performance of the simple greedy algorithm is comparable to that of the other algorithms.

Published in:

Mobile Adhoc and Sensor Systems (MASS), 2011 IEEE 8th International Conference on

Date of Conference:

17-22 Oct. 2011