Multi-MC Charging Schedule Algorithm with Time Windows in Wireless Rechargeable Sensor Networks

IEEE Access(2019)

引用 14|浏览47
暂无评分
摘要
The limited lifespan of the traditional Wireless Sensor Networks (WSNs) has always restricted the broad application and development of WSNs. The current studies have shown that the wireless power transmission technology can effectively prolong the lifetime of WSNs. In most present studies on charging schedules, the sensor nodes will be charged once they have energy consumption, which will cause higher cost and lower networks utility. It is assumed in this paper that the sensor nodes in Wireless Rechargeable Sensor Networks (WRSNs) will be charged only after its energy is lower than a certain value. Each node has a charging time window and is charged within its respective time window. In large-scale wireless sensor networks, single mobile charger (MC) is difficult to ensure that all sensor nodes work properly. Therefore, it is propoesd in this paper that the multiple MCs which are used to replenish energy for the sensor nodes. When the average energy of all the sensor nodes falls below the upper energy threshold, each MC begins to charge the sensor nodes. The genetic algorithm has a great advantage in solving optimization problems. However, it could easily lead to inadequate search. Therefore, the genetic algorithm is improved by 2-opt strategy. And then multi-MC charging schedule algorithm with time windows based on genetic algorithm is proposed and simulated. The simulation results show that the algorithm designed in this paper can timely replenish energy for each sensor node and minimize the total charging cost.
更多
查看译文
关键词
Wireless sensor networks, Schedules, Genetic algorithms, Wireless communication, Approximation algorithms, Scheduling, Optimization, Wireless rechargeable sensor networks, charging schedule, time windows, multiple mobile chargers, energy threshold
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要