We consider the problem of correlated data gathering by a network with a sink node and a tree communication s t~c t u~, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. Two coding strategies are analyzed a Slepian-Wolf model where optimal d i n g is complex and transmission optimization is simple, and a joint entropy coding model with explicit communication where coding is simple and transmission optimization is difficult. Thi problem requires a joint optimization of the rate allocation at the nodes and of the transmission structure. For the Slepian-Wolf setting, we derive a closed form solution and an efficient distributed approximation algorithm with a good performance. For the explicit communication case, we prove that building an optimal data gathering tree is NPcomplete and we pmpose variow distributed approximation algorithms.
Two approaches to optimize the transmission structure and the rate allocation determination at the sensor nodes is proposed by Baltasar et al. REF .
On network correlated data gathering
IEEE INFOCOM 2004
IEEE INFOCOM 2004
Computer Science