Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation
The DOI matches its Crossref record.
Abstract
A sensor in wireless sensor networks (WSNs) periodically produces data as it monitors its vicinity. The basic operation in such a network is the systematic gathering (with or without in-network aggregation) and transmitting of sensed data to a base station for further processing. A key challenging question in WSNs is to schedule nodes' activities to reduce energy consumption. In this paper, we focus on designing energy-efficient protocols for low-data-rate WSNs, where sensors consume different energy in different radio states (transmitting, receiving, listening, sleeping, and being idle) and also consume energy for state transition. We use TDMA as the MAC layer protocol and schedule the sensor nodes with consecutive time slots at different radio states while reducing the number of state transitions. We prove that the energy consumption by our scheduling for homogeneous network is at most twice of the optimum and the timespan of our scheduling is at most a constant times of the optimum. The energy consumption by our scheduling for heterogeneous network is at most ¿ (log Rmax/Rmin) times of the optimum. We also propose effective algorithms to construct data gathering tree such that the energy consumption and the network throughput is within a constant factor of the optimum. Extensive simulation studies show that our algorithms do considerably reduce energy consumption.
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
Self-citation
Metadata
- Authors
- Wu, Y., Li, X.-Y., Liu, Y., & Lou, W.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2010-02
- Volume
- 21
- Issue
- 2
- Pages
- 275-287
- ISSN
- 1045-9219 (ISSN-L)
- 1558-2183
- 2161-9883
- OpenAlex
- W2149296408
- Cited by
- 208
- References
- 0
- FWCI
- 25.70
- Type
- journal article
- 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: Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation. https://app.cochat.ai/papers/10.1109/tpds.2009.45
- The paper
- Wu, Y., Li, X.-Y., Liu, Y., & Lou, W. (2010). Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2009.45
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.