Network Coding Based Information Spreading in Dynamic Networks With Correlated Data

Abstract

Abstract-In this work, we design and analyze information spreading algorithms for dynamic networks with correlated data. In these networks, either the data to be distributed, the data already available at the nodes, or both, are correlated. Moreover, nodes' availability and connectivity is dynamic -a scenario typical for wireless networks.Our contribution is twofold. First, although coding schemes for correlated data have been studied extensively, the focus has been on characterizing the rate region in static networks. In an information spreading scheme, however, nodes may communicate by continuously exchanging packets according to some underlying communication model. The main figure of merit is the stopping time -the time required until nodes can successfully decode. While information spreading schemes, such as gossip, are practical, distributed and scalable, they have only been studied for uncorrelated data. We close this gap by providing techniques to analyze network-coded information spreading in dynamic networks with correlated data.Second, we give a clean framework for oblivious dynamic network models that in particular applies to a multitude of wireless network and communication scenarios. We specify a general setting for the data model, and give tight bounds on the stopping times of network coded protocols in this wide range of settings. En route, we analyze the capacities seen by nodes under a network-coded information spreading protocol, a previously unexplored question.We conclude with extensive simulations, clearly validating the key trends and phenomena predicted in the analysis.

Secure Multi-Source Multicast

“…In the same way, using a gossip protocol, the reliability proof is almost a direct consequence of [29,Theorem 1]. Hence, the number of rounds required is given by Theorem 3.…”

“…Note that the result above is constant-optimal, as T is the number of rounds required for a single message, hence one cannot expect less that T above for k|S| messages. This is a perfect pipelining property [29], thus, surprisingly, one can gossip securely messages to all parties in the network, without any loss in rate and without any centralized mechanism for routing, key exchange or any other encryption mechanism, as long as the eavesdropper is interested in single messages.…”

“…For multicast problems and LNC, the condition in (1) can be used with = 0 [1], [2]. Yet, we allow a small error to cope with protocols such as randomized gossip [24], [29], which we discuss later in this paper. Remark 3.…”

“…The process stops when all the legitimate nodes have all the messages, i.e., have a full rank matrix. We briefly review the definitions and results from [29] for non-secure gossip networks, which we will use to formulate our result in this context. Definition 2.…”

Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services

“…From a system implementation perspective, all-zero coded packets should be discarded and not transmitted. On the other hand, in the literature dealing with the performance characterization of RLNC, it is common to include the transmission of all-zero coded packets [35], [36]. In that way, the performance modeling is tractable and keeps a higher degree of generality.…”