In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
— In this paper, we concentrate on opportunistic scheduling for multicast information. We pose the problem as a multicast throughput optimization problem. As a solution we presen...
— The tolerable packet-loss ratio of an Internet Protocol (IP) based wireless networks varies according to the specific services considered. File transfer for example must be er...
We consider wireless broadcasting of multimedia content to allow asynchronous media access. Receivers subscribe at any time to the ongoing broadcast session, but are still able to...
Abstract—Rateless coding ensures reliability by providing everincreasing redundancy, traditionally at the packet level (i.e. the application layer) through erasure coding. This p...