On Coding for Cooperative Data Exchange

TL;DR

This paper addresses the problem of minimizing transmissions in cooperative wireless data exchange, proposing bounds and algorithms to optimize the process in practical peer-to-peer and broadcast scenarios.

Contribution

It introduces new bounds and an efficient algorithm with performance guarantees for cooperative data exchange among wireless nodes.

Findings

Established upper and lower bounds on the minimum number of transmissions.

Developed an efficient algorithm with provable performance guarantees.

Validated the algorithm's effectiveness through numerical simulations.

Abstract

We consider the problem of data exchange by a group of closely-located wireless nodes. In this problem each node holds a set of packets and needs to obtain all the packets held by other nodes. Each of the nodes can broadcast the packets in its possession (or a combination thereof) via a noiseless broadcast channel of capacity one packet per channel use. The goal is to minimize the total number of transmissions needed to satisfy the demands of all the nodes, assuming that they can cooperate with each other and are fully aware of the packet sets available to other nodes. This problem arises in several practical settings, such as peer-to-peer systems and wireless data broadcast. In this paper, we establish upper and lower bounds on the optimal number of transmissions and present an efficient algorithm with provable performance guarantees. The effectiveness of our algorithms is established through numerical simulations.