Band Codes for Energy-Efficient Network Coding with Application to P2P Mobile Streaming

A key problem in random network coding (NC) lies in the complexity and energy consumption associated with the packet decoding processes, which hinder its application in mobile environments. Controlling and hence limiting such factors has always been an important but elusive research goal, since the packet degree distribution, which is the main factor driving the complexity, is altered in a non-deterministic way by the random recombinations at the network nodes. In this paper we tackle this problem proposing Band Codes (BC), a novel class of network codes specifically designed to preserve the packet degree distribution during packet encoding, ecombination and decoding. BC are random codes over GF(2) that exhibit low decoding complexity, feature limited and controlled degree distribution by construction, and hence allow to effectively apply NC even in energy-constrained scenarios. In particular, in this paper we motivate and describe our new design and provide a thorough analysis of its performance. We provide numerical simulations of the performance of BC in order to validate the analysis and assess the overhead of BC with respect to a onventional NC scheme. Moreover, peer-to-peer media streaming experiments with a random-push protocol show that BC reduce the decoding complexity by a factor of two, to a point where NC-based mobile streaming to mobile devices becomes practically feasible.Comment: To be published in IEEE Transacions on Multimedi

Characterization of Band Codes for Pollution-Resilient Peer-to-Peer Video Streaming

We provide a comprehensive characterization of band codes (BC) as a resilient-by-design solution to pollution attacks in network coding (NC)-based peer-to-peer live video streaming. Consider one malicious node injecting bogus coded packets into the network: the recombinations at the nodes generate an avalanche of novel coded bogus packets. Therefore, the malicious node can cripple the communication by injecting into the network only a handful of polluted packets. Pollution attacks are typically addressed by identifying and isolating the malicious nodes from the network. Pollution detection is, however, not straightforward in NC as the nodes exchange coded packets. Similarly, malicious nodes identification is complicated by the ambiguity between malicious nodes and nodes that have involuntarily relayed polluted packets. This paper addresses pollution attacks through a radically different approach which relies on BCs. BCs are a family of rateless codes originally designed for controlling the NC decoding complexity in mobile applications. Here, we exploit BCs for the totally different purpose of recombining the packets at the nodes so to avoid that the pollution propagates by adaptively adjusting the coding parameters. Our streaming experiments show that BCs curb the propagation of the pollution and restore the quality of the distributed video stream

Network Coding Strategies for Satellite Communications

Network coding (NC) is an important technology that allows the network services to be optimal. The main advantage of NC is to reduce the necessity for re-transmissions of packets. Satellite Communications (SatComs) are one of the potential applications that can leverage on the benefits of NC due to their challenging fading environments and high round trip times. The motivation is to take the physical layer-awareness into consideration for adapting and hence extend the NC gains. Different rate and energy efficient adaptive NC schemes for time variant channels are proposed. We compare our proposed physical layer adaptive schemes to physical layer non-adaptive NC schemes for time variant channels. The adaptation of packet transmissions is on the basis of the corresponding time-dependent erasures, and allows proposed schemes to achieve significant gains in terms of throughput, delay and energy efficiency. The proposed schemes are robust for large and small size of packets. Although, the energy per bit is affected, a similar rate and energy gains can be arise. However, the performance gains are not motivated by the packet size, but through duty cycle silence of transfer packets. In this thesis, virtual schemes are also proposed to solve an open literature problem in the NC. The objective is to find a quasi-optimal number of coded packets to multicast to a group of independent wireless receivers suffer from a different channel conditions. In particular, we propose two virtual network that allows for the representation of a group of receivers as a multicast group to be visible as one receiver and single channel. Most of the schemes are applied to LEO/MEO/GEO satellite scenarios. They demonstrate remarkable gains compared to that strategy in which the adaptation depends only on one receiver point-to-point