Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 255

The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.

Data Gathering Optimization by Dynamic Sensing and Routing in Rechargeable Sensor Networks

Zhang, Yongmin, He, Shibo, Chen, Jiming·2016·IEEE/ACM Transactions on Networking

Abstract

In rechargeable sensor networks (RSNs), energy harvested by sensors should be carefully allocated for data sensing and data transmission to optimize data gathering due to time-varying renewable energy arrival and limited battery capacity. Moreover, the dynamic feature of network topology should be taken into account, since it can affect the data transmission. In this paper, we strive to optimize data gathering in terms of network utility by jointly considering data sensing and data transmission. To this end, we design a data gathering optimization algorithm for dynamic sensing and routing (DoSR), which consists of two parts. In the first part, we design a balanced energy allocation scheme (BEAS) for each sensor to manage its energy use, which is proven to meet four requirements raised by practical scenarios. Then in the second part, we propose a distributed sensing rate and routing control (DSR2C) algorithm to jointly optimize data sensing and data transmission, while guaranteeing network fairness. In DSR2C, each sensor can adaptively adjust its transmit energy consumption during network operation according to the amount of available energy, and select the optimal sensing rate and routing, which can efficiently improve data gathering. Furthermore, since recomputing the optimal data sensing and routing strategies upon change of energy allocation will bring huge communications for information exchange and computation, we propose an improved BEAS to manage the energy allocation in the dynamic environments and a topology control scheme to reduce computational complexity. Extensive simulations are performed to demonstrate the efficiency of the proposed algorithms in comparison with existing algorithms.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tnet.2015.2425146

Cites

13 of 13 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 13 references

Cited by

See all 255

Metadata

Authors
Zhang, Y., He, S., & Chen, J.
Venue
IEEE/ACM Transactions on Networking
Published
2016-06
Volume
24
Issue
3
Pages
1632-1646
ISSN
  • 1063-6692 (ISSN-L)
  • 1558-2566
OpenAlex
W2428120229
Cited by
255
References
13
FWCI
62.55
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: Data Gathering Optimization by Dynamic Sensing and Routing in Rechargeable Sensor Networks. https://app.cochat.ai/papers/10.1109/tnet.2015.2425146
The paper
Zhang, Y., He, S., & Chen, J. (2016). Data Gathering Optimization by Dynamic Sensing and Routing in Rechargeable Sensor Networks. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/tnet.2015.2425146

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.