Recipient Maximization Routing Scheme for Multicast over IEEE 802.16j Relay Networks

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 al...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE International Conference on Communications (2003) s. 1 - 6
Hlavní autor: Wen-Hsing Kuo
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2009
Témata:
Adaptive systems
Algorithm design and analysis
Base stations
Multicast algorithms
Polynomials
Relays
Resource management
Routing
WiMAX
Wireless networks
ISSN:1550-3607
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:1550-3607
DOI:10.1109/ICC.2009.5199396