Efficient and adaptive resource scheduling in IEEE 802.16j transparent relay networks

Authors:
Hui-Tang Lin;Ying-You Lin;Chung-Jui Sun
Affiliations:
Department of Electrical Engineering, National Cheng Kung University, Taiwan, ROC and Institute of Computer and Communication Engineering, National Cheng Kung University, Taiwan, ROC;Institute of Computer and Communication Engineering, National Cheng Kung University, Taiwan, ROC;Institute of Computer and Communication Engineering, National Cheng Kung University, Taiwan, ROC
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2013

Citing 14
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Routing in multi-radio, multi-hop wireless mesh networks

Proceedings of the 10th annual international conference on Mobile computing and networking
On exploiting diversity and spatial reuse in relay-enabled wireless networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
WiMAX relay networks: opportunistic scheduling to exploit multiuser diversity and frequency selectivity

Proceedings of the 14th ACM international conference on Mobile computing and networking
The future of WiMAX: multihop relaying with IEEE 802.16j

IEEE Communications Magazine
Load based relay selection algorithm for fairness in relay based OFDMA cellular systems

WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Relay technologies for WiMAX and LTE-advanced mobile systems

IEEE Communications Magazine
Fairness-aware radio resource management in downlink OFDMA cellular relay networks

IEEE Transactions on Wireless Communications
Approximation Algorithms for a Link Scheduling Problem in Wireless Relay Networks with QoS Guarantee

IEEE Transactions on Mobile Computing
Energy-efficient uplink resource allocation for IEEE 802.16j transparent-relay networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
On energy efficiency and optimum resource allocation of relay transmissions in the low-power regime

IEEE Transactions on Wireless Communications
Gaussian Orthogonal Relay Channels: Optimal Resource Allocation and Capacity

IEEE Transactions on Information Theory
Utility-based resource allocation and scheduling in OFDM-based wireless broadband networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

Relaying is regarded as a promising technique for enhancing the system throughput and coverage of emerging broadband wireless access networks. While next generation broadband wireless standardization bodies (e.g., LTE-advanced and IEEE 802.16j) have specified the support of relays in general terms, the problem of allocating network resources in an efficient and effective manner remains a challenging issue. In this study, the utility-based resource scheduling optimization problem for IEEE 802.16j transparent relay networks is formulated mathematically and proven to be NP-hard. Two efficient heuristic algorithms, namely Relay Resource Scheduling (RRS) and Adaptive Relay Resource Scheduling (ARRS), are proposed to resolve the resource scheduling problem. RRS maximizes the system utility in networks containing direct and relay mobile stations by exploiting the benefits of optional transmissions. ARRS enhances upon the performance of RRS by adaptively determining the split ratio between the access zone and the transparent zone in the downlink subframe. The computational complexities of both algorithms are shown to be polynomial and proportional to the number of links and subchannels in the network. The simulation results show that the proposed algorithms achieve significantly better throughput and fairness performance than existing schemes such as Partial Proportional Fairness (PPF) and GenArgMAX.