Coded Cooperative Data Exchange in Multihop Networks

Details Coded Cooperative Data Exchange in Multihop Networks Coded Cooperative Data Exchange in Multihop Networks

2012-03-15

arxiv.org/abs/1203.3445v1

Computer Science

Information Theory

49 pages, 6 figures, submitted to Transactions on Information Theory

Scientific paper

Consider a connected network of n nodes that all wish to recover k desired packets. Each node begins with a subset of the desired packets and exchanges coded packets with its neighbors. This paper provides necessary and sufficient conditions which characterize the set of all transmission schemes that permit every node to ultimately learn (recover) all k packets. When the network satisfies certain regularity conditions and packets are randomly distributed, this paper provides tight concentration results on the number of transmissions required to achieve universal recovery. For the case of a fully connected network, a polynomial-time algorithm for computing an optimal transmission scheme is derived. An application to secrecy generation is discussed.

Affiliated with

Also associated with

No associations

Rating

Coded Cooperative Data Exchange in Multihop Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Coded Cooperative Data Exchange in Multihop Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coded Cooperative Data Exchange in Multihop Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-31962