Cooperation vs. multiplexing: multicast scheduling algorithms for ofdma relay networks

Authors:
Karthikeyan Sundaresan;Sampath Rangarajan
Affiliations:
NEC Laboratories America, Princeton, USA;NEC Laboratories America, Princeton, USA
Venue:
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Year:
2010

Citing 7
Cited 0

Tight approximation algorithms for maximum general assignment problems

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Scheduling algorithms for multi-carrier wireless data systems

Proceedings of the 13th annual ACM 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
Cross-layer optimization for OFDM wireless networks-part I: theoretical framework

IEEE Transactions on Wireless Communications
A simple transmit diversity technique for wireless communications

IEEE Journal on Selected Areas in Communications
Transmit power adaptation for multiuser OFDM systems

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the next generation cellular networks making a transition towards smaller cells, two-hop OFDMA relay networks have become a dominant, mandatory component in the 4G standards (WiMAX 802.16j, 3GPP LTE-Adv). While unicast flows have received reasonable attention in two-hop OFDMA relay networks, not much light has been shed on the design of efficient scheduling algorithms for multicast flows, thereby forming the focus of this work. We show that while relay cooperation is critical for improving multicast performance, it must be carefully balanced with the ability to multiplex multicast sessions and hence maximize aggregate multicast flow. To this end, we highlight strategies that carefully group relays for cooperation to achieve this balance. We then solve the multicast scheduling problem under two OFDMA sub-channelization models. We establish the NP-hardness of the scheduling problem even for the simpler model and provide efficient algorithms with approximation guarantees under both models. Evaluation of the proposed solutions reveals the efficiency of the scheduling algorithms as well as the significant benefits obtained from the multicasting strategy.