Deterministic algorithm for the cooperative data exchange problem

Author

Milosavljevic, Nebojsa ; Pawar, Sanjay ; El Rouayhe, Salim ; Gastpar, Michael ; Ramchandran, Kannan

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Berkeley, CA, USA

fYear

2011

fDate

July 31 2011-Aug. 5 2011

Firstpage

410

Lastpage

414

Abstract

In this paper we study the problem of data exchange, where each node in the system has a number of linear combinations of the data packets. Communicating over a public channel, the goal is for all nodes to reconstruct the entire set of the data packets in minimal total number of bits exchanged over the channel. We present a novel divide and conquer based architecture that determines the number of bits each node should transmit. This along with the well known fact, that it is sufficient for the nodes to broadcast linear combinations of their local information, provides a polynomial time deterministic algorithm for reconstructing the entire set of the data packets at all nodes in minimal amount of total communication.

Keywords

cooperative communication; divide and conquer methods; electronic data interchange; polynomials; broadcast linear combinations; cooperative data exchange problem; divide and conquer based architecture; polynomial time deterministic algorithm; public channel; Base stations; Correlation; Entropy; Partitioning algorithms; Polynomials; Resource management; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on

Conference_Location

St. Petersburg

ISSN

2157-8095

Print_ISBN

978-1-4577-0596-0

Electronic_ISBN

2157-8095

Type

conf

DOI

10.1109/ISIT.2011.6034157

Filename

6034157