2019
DOI: 10.4218/etrij.2018-0126
|View full text |Cite
|
Sign up to set email alerts
|

Demand‐based charging strategy for wireless rechargeable sensor networks

Abstract: A wireless power transfer technique can solve the power capacity problem in wireless rechargeable sensor networks (WRSNs). The charging strategy is a widespread research problem. In this paper, we propose a demand‐based charging strategy (DBCS) for WRSNs. We improved the charging programming in four ways: clustering method, selecting to‐be‐charged nodes, charging path, and charging schedule. First, we proposed a multipoint improved K‐means (MIKmeans) clustering algorithm to balance the energy consumption, whic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 31 publications
(10 citation statements)
references
References 33 publications
0
10
0
Order By: Relevance
“…We undertook simulation experiments so as to evaluate and analyze the performance of our proposed scheme. We performed a comparability study of our scheme with two other different state-of-the-art charging models in literature, which were the HCCA-TP charging model in [46] and the DBCS charging model in [47]. These models adopted clear and well-defined network topologies instead of complex topologies that are often initiated by network dynamics requiring collaborative charging mechanisms and large re-computational cost.…”
Section: Simulation Analysis and Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…We undertook simulation experiments so as to evaluate and analyze the performance of our proposed scheme. We performed a comparability study of our scheme with two other different state-of-the-art charging models in literature, which were the HCCA-TP charging model in [46] and the DBCS charging model in [47]. These models adopted clear and well-defined network topologies instead of complex topologies that are often initiated by network dynamics requiring collaborative charging mechanisms and large re-computational cost.…”
Section: Simulation Analysis and Discussionmentioning
confidence: 99%
“…In [46], the authors developed a K-means cluster algorithm to calculate the energy core set while an optimizing algorithm was proposed to convert the energy charging stage into a task splitting model so as to increase its energy efficiency. Additionally, in [47], another K-means clustering algorithm was introduced to balance the energy consumption among sensor nodes, while a dynamic selection algorithm was proposed to charge sensor nodes in order to reduce the charging time spent in the network. There are quite some issues in most of the models, as mentioned above, and to solve these problems to an extent, we proposed a set of algorithms that can inspect the network and make decisions on the best possible sensor nodes to charge.…”
Section: Optimizationsmentioning
confidence: 99%
“…In the simulation experiment, 200 to 250 sensors are randomly placed on flat surface 16,43,44 of area 1000 Â 1000 m 2 . The maximum energy of each hybrid rechargeable sensor is 10.8 KJ, 43,45 and its charging radius is 2.7 m. 43,46 The maximum energy of MV is 4000 KJ.…”
Section: Simulation Settingsmentioning
confidence: 99%
“…By using a low‐cost method, the optimized path for mobile charger can be designed for the sensors that have sent charging requests in [21]. A demand‐based charging strategy for rechargeable wireless sensor networks was designed in [22], where the charging path for a mobile charger is optimized to prolong the recharging time. However, some devices may be out of power prematurely, given they may wait energy replenishment for a long time.…”
Section: Related Workmentioning
confidence: 99%