Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks
The DOI matches its Crossref record.
Abstract
Data aggregation is a fundamental yet time-consuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation algorithm of least latency [1] has a latency bound of (Delta - 1)R, where Delta is the maximum degree and R is the network radius. Since both Delta andRcould be of the same order of the network size, this algorithm can still have a rather high latency. In this paper, we designed an algorithm based on maximal independent sets which has an latency bound of 23R+ Delta - 18. Here Delta contributes to an additive factor instead of a multiplicative one; thus our algorithm is nearly constant approximation and it has a significantly less latency bound than earlier algorithms especially when Delta is large.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
Minimizing Convergecast Time and Energy Consumption in Green Internet of Things
Li, Z., Liu, Y., Liu, A., Wang, S., & Liu, H. (2020) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2018.2844282 · Cited by 124
Metadata
- Authors
- Huang, S. C. H., Wan, P.-J., Vu, C. T., Li, Y., & Yao, F.
- Venue
- IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications
- Publisher
- IEEE
- Published
- 2007
- Pages
- 366-372
- OpenAlex
- W2169542876
- Cited by
- 213
- References
- 0
- FWCI
- 9.05
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks. https://app.cochat.ai/papers/10.1109/infcom.2007.50
- The paper
- Huang, S. C. H., Wan, P.-J., Vu, C. T., Li, Y., & Yao, F. (2007). Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks. IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications. https://doi.org/10.1109/infcom.2007.50
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.