NDLI: On the Distance Entropy of a Data Collection Network

Content Provider	IEEE Xplore Digital Library
Author	Junning Liu Adler, M. Towsley, D.
Copyright Year	2006
Description	Author affiliation: Department of Computer Science, University of Massachusetts, Amherst, MA 01003, Email: liujn@cs.umass.edu (Junning Liu)
Abstract	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.
Starting Page	1
Ending Page	6
File Size	215964
Page Count	6
File Format	PDF
ISBN	0780395492
DOI	10.1109/WIOPT.2006.1666442
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-02-26
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer science Source coding Network coding Broadcasting Cost function Routing Solids Entropy Encoding Data communication
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On the distance entropy of a data collection network.

On the multiple unicast network coding, conjecture

Communicating the sum of sources in a 3-sources/3-terminals network

Collecting correlated data through a network with minimum cost: Distance entropy and a practical asymptotically optimal design (2005)

On optimal communication cost for gathering correlated data through wireless sensor networks

Two-way source coding through a relay

Broadcasting with Side Information

The encoding complexity of network coding

Distributed minimum cost multicasting with lossless source coding and network coding

On the Distance Entropy of a Data Collection Network

Similar Documents

On the distance entropy of a data collection network.

On the multiple unicast network coding, conjecture

Communicating the sum of sources in a 3-sources/3-terminals network

Collecting correlated data through a network with minimum cost: Distance entropy and a practical asymptotically optimal design (2005)

On optimal communication cost for gathering correlated data through wireless sensor networks

Two-way source coding through a relay

Broadcasting with Side Information

The encoding complexity of network coding

Distributed minimum cost multicasting with lossless source coding and network coding

On the Distance Entropy of a Data Collection Network