The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Network correlated data gathering with explicit communication: NP-completeness and algorithms
Open accessAbstract
We 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, we consider a joint entropy-based coding model with explicit communication where coding is simple and the transmission structure optimization is difficult. We first formulate the optimization problem definition in the general case and then we 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. We prove that even in this simple case, the optimization problem is NP-hard. We propose some efficient, scalable, and distributed heuristic approximation algorithms for solving this problem and show by numerical simulations that the total transmission cost can be significantly improved over direct transmission or the shortest path tree. We also present an approximation algorithm that provides a tree transmission structure with total cost within a constant factor from the optimal.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Directed diffusion for wireless sensor networking
Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., & Silva, F. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.808417 · Cited by 2,359
Cited by
In-network aggregation techniques for wireless sensor networks: a survey
Fasolo, E., Rossi, M., Widmer, J., & Zorzi, M. (2007) · IEEE Wireless Communications · doi:10.1109/mwc.2007.358967 · Cited by 734
Compressive data gathering for large-scale wireless sensor networks
Luo, C., Wu, F., Sun, J., & Chen, C. W. (2009) · Proceedings of the 15th annual international conference on Mobile computing and networking · doi:10.1145/1614320.1614337 · Cited by 578
The impact of spatial correlation on routing with compression in wireless sensor networks
Pattem, S., Krishnamachari, B., & Govindan, R. (2008) · ACM Transactions on Sensor Networks · doi:10.1145/1387663.1387670 · Cited by 492
Compressed data aggregation for energy efficient wireless sensor networks
Xiang, L., Luo, J., & Vasilakos, A. (2011) · 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks · doi:10.1109/sahcn.2011.5984932 · Cited by 360
From wireless sensor networks towards cyber physical systems
Wu, F.-J., Kao, Y.-F., & Tseng, Y.-C. (2011) · Pervasive and Mobile Computing · doi:10.1016/j.pmcj.2011.03.003 · Cited by 329
Metadata
- Authors
- Cristescu, R., Beferull-Lozano, B., Vetterli, M., & Wattenhofer, R.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2006-02
- Volume
- 14
- Issue
- 1
- Pages
- 41-54
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2099831016
- Cited by
- 183
- References
- 2
- FWCI
- 17.08
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Network correlated data gathering with explicit communication: NP-completeness and algorithms. https://app.cochat.ai/papers/10.1109/tnet.2005.863711
- The paper
- Cristescu, R., Beferull-Lozano, B., Vetterli, M., & Wattenhofer, R. (2006). Network correlated data gathering with explicit communication: NP-completeness and algorithms. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/tnet.2005.863711
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.