Evidence map›Paper›PMID 39409354›Full record

ArticleSensors (Basel, Switzerland)2024

Petri-Net-Based Charging Scheduling Optimization in Rechargeable Sensor Networks.

Huaiyu Qin, Wei Ding, Lei Xu, Chenzhi Ruan

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. Article
  2. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Huaiyu QinSchool of Electrical and Information Engineering, Jiangsu University of Science and Technology, Zhenjiang 212000, China.ORCID 0000-0002-5238-2026
Wei DingSchool of Electrical and Information Engineering, Jiangsu University of Science and Technology, Zhenjiang 212000, China.
Lei XuSchool of Electrical and Information Engineering, Jiangsu University of Science and Technology, Zhenjiang 212000, China.
Chenzhi RuanThe Key Laboratory for Agricultural Machinery Intelligent Control and Manufacturing of Fujian Education Institution, Wuyishan 354330, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

In order to express the energy flow, motion flow, and control flow in wireless rechargeable sensor networks accurately and intuitively, and to maximize the charging benefit of MVs (mobile vehicles), a type of MTS-HACO (Mobile Transition Sequence Hybrid Ant Colony Optimization) is proposed. Firstly, node places are grouped according to the firing time of node's energy consumption transition to ensure that in each time slot, MV places only enable charging transitions for the node places with lower remaining lifetimes. Then, the FSOMCT (Firing Sequence Optimization of Mobile Charging Transition) problem is formulated under the constraints of MV places capacity, travelling arc weight, charging arc weight, and so on. The elite strategy and the Max-Min Ant Colony system are further introduced to improve the ant colony algorithm, while the improved FWA (fireworks algorithm) optimizes the path constructed by each ant. Finally, the optimal mobile charging transition firing sequence and charging times are obtained, ensuring that MVs have sufficient energy to return to the base station. Simulation results indicate that, compared with the periodic algorithm and the PE-FWA algorithm, the proposed method can improve charging benefit by approximately 48.7% and 26.3%, respectively.

Indexed as

ant colony algorithmcharging benefitPetri netprecision agriculturewireless rechargeable sensor network

Identifiers

PMID39409354
PMCPMC11478692

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.