Code dissemination is very useful to remotely fix bugs or add now functions in wireless sensor networks (WSNs) after sensors deployed. Hostile environments keep the secure code dissemination a major concern. The Delugebased protocols are the widely used code disseminations, however, which have to take much energy and memory to deal with the problem caused by out of order delivery of packets in ...

Spinal codes are a new class of rateless codes that enable wirelessnetworks to cope with time-varying channel conditions in a naturalway, without requiring any explicit bit rate selection. The key ideain the code is the sequential application of a pseudo-random hashfunction to the message bits to produce a sequence of coded symbolsfor transmission. This encoding ensures that...

Rateless codes over a binary erasure channel (BEC) provide successful transmission independent of the erasure probability. Luby Transform (LT) codes and raptor codes are examples of rateless codes over a BEC. For successful decoding, LT codes require either a large overhead at linear complexity, or capacity-approaching overheads with nonlinear complexity. When overhead is low at linear complexi...

An on-line fountain code is defined as a fountain code for which an optimal encoding strategy can be found efficiently given any instantaneous decoding state. This property is important for data distribution in practical networks. In this paper we formalize the problem of on-line fountain code construction, and propose new on-line fountain codes that outperform known ones in having factor 3-5 l...

Over the past decade, rateless codes, i.e., digital fountain codes, have emerged as an efficient and robust solution for reliable data transmission over packet erasure networks and a particularly suitable one for multicasting and broadcasting applications where users may experience variable channel conditions and packet loss rates, such as mobile environments. Luby Transform (LT) and Raptor cod...

This paper evaluates the performance of two seminal rateless erasure codes, LT Codes and Online Codes. Their properties make them appropriate for coping with communication channels having an unbounded loss rate. They are therefore very well suited to peer-to-peer systems. This evaluation targets two goals. First, it compares the performance of both codes in different adversarial environments an...

Erasure codes are a type of encoding of data, generally for transmission over a lossy medium, that survive deletions (erasures) of parts of the message.1 They are especially useful for transmission of data across a medium or network that can drop packets of data, when it is impractical for the receiver to be in constant communication with the sender. Given a file with K blocks, the sender gener...