Network Correlated Data Gathering With Explicit Communication: NP-Completeness and Algorithms

Free registration required

Executive Summary

The authors consider the problem of correlated data gathering by a network with a sink node and a tree-based communication structure, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. For source coding of correlated data, they consider a joint entropy-based coding model with explicit communication where coding is simple and the transmission structure optimization is difficult. They first formulate the optimization problem definition in the general case and then they study further a network setting where the entropy conditioning at nodes does not depend on the amount of side information, but only on its availability.

  • Format: PDF
  • Size: 685.9 KB