Opportunistic Finite Horizon Multicasting of Erasure-coded Data

Abstract

We propose an algorithm for opportunistic multicasting in wireless networks. Whereas prior multicast rate adaptation schemes primarily optimize long-term throughput, we investigate the finite horizon problem where a fixed number of packets has to be transmitted to a set of wireless receivers in the shortest amount of time – a common problem, e.g., for software updates or video multicast. In the finite horizon problem, the optimum rate critically depends on the recent reception history of the receivers and requires a fine balance between maximizing overall throughput and equalizing individual receiver throughput. We formulate a dynamic programming algorithm that optimally solves this problem. We then develop two low complexity heuristics that perform close to the optimal solution and are suitable for practical online scheduling. We further analyze the performance of our algorithms by means of simulation. They substantially outperform existing solutions based on throughput maximization or favoring the user with the worst channel, and we obtain a 30% performance improvement over the former and a 120% improvement over the latter in scenarios with Rayleigh fading. We further analyze the performance of the schemes under imperfect state information and observe an even higher improvement over the benchmark schemes.