Coded Cooperative Data Exchange Problem for General Topologies

Abstract

Abstract-We consider the coded cooperative data exchange problem for general graphs. In this problem, given a graph G = (V, E) representing clients in a broadcast network, each of which initially hold a (not necessarily disjoint) set of information packets; one wishes to design a communication scheme in which eventually all clients will hold all the packets of the network. Communication is performed in rounds, where in each round a single client broadcasts a single (possibly encoded) information packet to its neighbors in G. The objective is to design a broadcast scheme that satisfies all clients with the minimum number of broadcast rounds.The coded cooperative data exchange problem has seen significant research over the last few years; mostly when the graph G is the complete broadcast graph in which each client is adjacent to all other clients in the network, but also on general topologies, both in the fractional and integral setting. In this work we focus on the integral setting in general undirected topologies G. We tie the data exchange problem on G to certain well studied combinatorial properties of G and in such show that solving the problem exactly or even approximately within a multiplicative factor of log |V| is intractable (i.e., NP-Hard). We then turn to study efficient data exchange schemes yielding a number of communication rounds comparable to our intractability result. Our communication schemes do not involve encoding, and in such yield bounds on the coding advantage in the setting at hand.

Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications

“…Moreover, long range transmission will result in high power usage and high interference and fading which eliminates the benefits of D2D communications. In [176,177], the authors considered a general setting in which the constraint of a fully connected network is removed allowing the problem to be extended to arbitrary topologies. Using undirected graphs, the authors in [176] provides exact results for the number of transmissions in d-regular networks.…”

“…Using undirected graphs, the authors in [176] provides exact results for the number of transmissions in d-regular networks. In [177], the authors show that the polynomial time solution is limited only for some special cases such as the fully connected network. They proved that the general problem is NP-hard and computationally intractable.…”

Cooperative data exchange with weighted cost based on d-basis construction

“…It has been recently shown that a deterministic algorithm based on conditional basis construction [1] can solve this optimization problem with lower complexity. The CDE problem has also been extended in heterogeneous directions, including CDE for arbitrarily connected network [7], [8], successive omniscience and priority [9], [10], and optimization on weighted cost or fairness rate allocations [6], [11], [12].…”

Network Coding-Based Information Sharing Strategy for Reducing Energy Consumption in IoT Environments

“…(broadcast) 환경에서 네트워크 부호 기반 효과적인 재전송에 대한 연구 [7][8][9][10][11] , 네트워크 상의 노드들이 네 트워크 부호화를 통해 서로 정보를 효과적으로 교환 하는 연구 [12,13] , 그리고 네트워크 부호화 기법을 사용 한 시스템의 에너지 소모에 관한 연구 [14,15] …”