Recipient maximization routing scheme for multicast over IEEE 802.16j relay networks

Authors:
Wen-Hsing Kuo
Affiliations:
Department of Electrical Engineering, Yuan-Ze University, Taoyuan, Taiwan
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 4
Cited 3

Constructing minimum-energy broadcast trees in wireless ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks

IEEE Transactions on Mobile Computing

Efficient resource allocation for energy conservation in uplink transmissions of IEEE 802.16j transparent relay networks

Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Energy-efficient uplink resource allocation for IEEE 802.16j transparent-relay networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
LASER: A load-aware spectral-efficient routing metric for path selection in IEEE 802.16j multi-hop relay networks

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the resource allocation problem for multicast over IEEE 802.16j WiMAX networks, which use relay stations to transmit data between the base station and subscriber stations to improve the transmission quality. Our objective is to maximize the total number of recipients by allocating resource among the base station and relay stations subject to the resource budget and the channel quality. We prove that the problem is NP-hard, and design a polynomial-time algorithm to solve it. The algorithm can be integrated with the multicast mechanism defined in the WiMAX standards, and can also be applied to any kind of wireless networks that support adaptive modulation and coding schemes. The performance of the algorithm is evaluated through simulations. We show that the typical routing approach is inefficient, whereas our scheme can always utilize relay stations to achieve a superior performance under different channel qualities and resource budgets.