Introduction to algorithms
Parity-based loss recovery for reliable multicast transmission
IEEE/ACM Transactions on Networking (TON)
RMDP: an FEC-based reliable multicast protocol for wireless environments
ACM SIGMOBILE Mobile Computing and Communications Review
Evaluating the Utility of FEC with Reliable Multicast
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Optimal partitioning of multicast receivers
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
A cross-layer design framework for robust IPTV services over IEEE 802.16 networks
IEEE Journal on Selected Areas in Communications - Special issue on broadband access networks: Architectures and protocols
Optimizing Joint Erasure- and Error-Correction Coding for Wireless Packet Transmissions
IEEE Transactions on Wireless Communications - Part 2
IPTV over WiMAX: Key Success Factors, Challenges, and Solutions [Advances in Mobile Multimedia]
IEEE Communications Magazine
Cooperative Coded Video Multicast for IPTV Services under EPON-WiMAX Integration
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In this paper, we define and address a new problem that arises when a base station in a broadband wireless network wishes to multicast information to a large group of nodes and to guarantee some level of reliability using Application-layer forward error correction (FEC) codes. Every data block to be multicast is translated into a sequence of K + n packets, from which every receiver must receive at least K in order to correctly decode the block. The new problem is to determine which PHY-layer modulation and coding scheme (MCS) the base station should use for each packet. We present several variants of this problem, which differ in the number of automatic repeat request (ARQ) rounds during which the delivery of a data block must be completed. Most of these variants are shown to be NP-hard. However, we present optimal solutions for practical instances, where the number of MCSs is small, and efficient approximations and heuristics for the general case of each variant.