By Topic

On the Distance Entropy of a Data Collection Network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Junning Liu ; Department of Computer Science, University of Massachusetts, Amherst, MA 01003, Email: ; M. Adler ; D. Towsley

We study the communication cost of collecting correlated data at a sink over a network. To do so, we introduce Distance Entropy, an intrinsic quantity that characterizes the data gathering limit of networked sources. We demonstrate that, for any network embedded with any set of sources and a cost function [cost]=[data rate]×[link weight], distance entropy is a lower bound on the optimal communication cost. This is true for the most general data collection schemes that allow arbitrary routing and coding operations, including network coding and source coding. This lower bound can be matched using optimal rate Slepian-Wolf encoding plus shortest path routing. For more general communication cost functions, we show that the optimal scheme among schemes using Slepian-Wolf codes is also optimal over all of the possible schemes. Our results imply that for collecting data from correlated sources at a single sink, Network Coding does not help in the sense of lowering the optimal communication cost. We then extend our results to the case that includes broadcast links in the network. We show that the same optimal cost holds even if we allow broadcasting. In other words, neither broadcasting nor Network Coding improves the total cost of collecting data from correlated sources at a single sink.

Published in:

2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks

Date of Conference:

03-06 April 2006