Resource allocation in 802.16j multi-hop relay systems with the user resource fairness constraint

Authors:
Hui Zeng;Chenxi Zhu
Affiliations:
Fujitsu Laboratories of America, College Park, MD;Fujitsu Laboratories of America, College Park, MD
Venue:
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Year:
2009

Citing 0
Cited 2

A Novel Scheduling Algorithm for Low and High Mobility Users in Multi-hop WiMAX Network

Wireless Personal Communications: An International Journal
Multi-Hop WiMAX Networks: A New Opportunistic Algorithm Using AMC and PUSC Mode for Different Mobility Users

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

IEEE 802.16j multi-hop relay task standard defines two mutually exclusive options: transparent relay systems (T-RS) and non-transparent relay systems (NT-RS). In this work, we compare the two relay systems in term of system capacity under user resource fairness constraint. We jointly study the effect of resource allocation and user association rule for maximizing the system capacity, where the user association rule determines the access station for each user. Different system configurations are compared, including: Single-Input Single-Output or Multi-Input Multi-Output in the relay links between base stations and relay stations, and different number of relay stations in a sector. Simulation results show that the highest capacity is achieved by the NT-RS with 3 relay stations per sector in distributed scheduling mode. Two simple user association rules, Highest Modulation-and-Coding-Scheme (MCS) scheme and Highest Modified Effective-Spectrum-Efficiency (ESE) scheme, are compared along with the optimal rules that maximize system capacity. It is demonstrated that Highest (Mod) ESE scheme achieves system capacity close to the optimal rules'.