We present two coded random access protocols that rely on the ideas of rateless codes and Successive Interference Cancellation (SIC). The rateless aspect is seen in that the contention period continues until the Base Station (BS) decides that a sufficient fraction of users has been resolved. The first protocol is referred to as frameless ALOHA, in which a device transmits the packet multiple ti...

The proliferation of video streaming applications that distribute data to a large number of clients motivates the design of fast and reliable multimedia delivery systems capable to adapt effectively to diverse transmission conditions. Receiver-driven layered multicast (RLM) efficiently addresses the issue of heterogeneity in clients’ available bandwidths and packet loss rates by shifting rate c...

We consider an energy harvesting transmitter sending status updates to a receiver over an erasure channel, where each status update is of length k symbols. The energy arrivals and the channel erasures are independent and identically distributed (i.i.d.) and Bernoulli distributed in each slot. In order to combat the effects of the erasures in the channel and the uncertainty in the energy arrival...

Over the Internet, bit errors within the data packets translate into packet losses at the higher layers of the OSI model, yielding a packet erasure channel. Modern erasure correcting codes promise to offer a very simple and efficient solution to data transfers over these channels, opening up also other interesting applications. Amongst them one can enumerate reliable large scale content distrib...

The recently developed rateless erasure codes are a near-optimal channel coding technique that guarantees low overhead and fast decoding. The underlying theory, and current implementations, of these codes assume that a network transmitter encodes according to a pre-specified probability distribution. In this report, we use basic Machine Learning techniques to try to understand what happens when...

In this paper a novel protocol for application level multicast, that is designed so as to exploit the advantages offered by rateless coding, is proposed. With rateless coding a set of k packets can be used to generate an arbitrary number of coded packets. Any set of slightly more than k coded packets can be used by a node in the network to recover the information. The proposed protocol is based...

Bulk transport underlies data exfiltration and code update facilities in WSNs, but existing approaches are not designed for highly lossy and variable-quality links. We observe that Maymounkov’s rateless online codes are asymptotically more efficient, but can perform poorly in the WSN operating region. We analyze and optimize coding parameters and present the design and evaluation of RTOC, a pro...