Open AccessDemand‐based charging strategy for wireless rechargeable sensor networks
Author(s) -
Dong Ying,
Wang Yuhou,
Li Shiyuan,
Cui Mengyao,
Wu Hao
Publication year - 2019
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.2018-0126
Subject(s) - computer science , wireless power transfer , cluster analysis , wireless sensor network , schedule , wireless , energy consumption , simulated annealing , path (computing) , mathematical optimization , real time computing , computer network , electrical engineering , algorithm , engineering , telecommunications , artificial intelligence , mathematics , operating system
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, which can group nodes based on location, residual energy, and historical contribution. Second, the dynamic selection algorithm for charging nodes (DSACN) was proposed to select on‐demand charging nodes. Third, we designed simulated annealing based on performance and efficiency (SABPE) to optimize the charging path for a mobile charging vehicle (MCV) and reduce the charging time. Last, we proposed the DBCS to enhance the efficiency of the MCV. Simulations reveal that the strategy can achieve better performance in terms of reducing the charging path, thus increasing communication effectiveness and residual energy utility.