2015 **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 …

Help me understand this report

Search citation statements

Paper Sections

Select...

1

1

1

1

Citation Types

0

5

0

Year Published

2016

2019

Publication Types

Select...

2

Relationship

1

1

Authors

Journals

(5 citation statements)

(73 reference statements)

0

5

0

“…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.…”

confidence: 98%

“…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.…”

confidence: 98%

“…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.…”

confidence: 99%

“…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.…”

confidence: 99%