首页> 外文期刊>IEEE transactions on mobile computing >TSCA: A Temporal-Spatial Real-Time Charging Scheduling Algorithm for On-Demand Architecture in Wireless Rechargeable Sensor Networks
【24h】

TSCA: A Temporal-Spatial Real-Time Charging Scheduling Algorithm for On-Demand Architecture in Wireless Rechargeable Sensor Networks

机译:TSCA:无线可充电传感器网络中按需架构的时空实时充电调度算法

获取原文
获取原文并翻译 | 示例
           

摘要

The collaborative charging issue in Wireless Rechargeable Sensor Networks (WRSNs) is a popular research problem. With the help of wireless power transfer technology, electrical energy can be transferred from wireless charging vehicles (WCVs) to sensors, providing a new paradigm to prolong network lifetime. Existing techniques on collaborative charging usually take the periodical and deterministic approach, but neglect influences of non-deterministic factors such as topological changes and node failures, making them unsuitable for large-scale WRSNs. In this paper, we develop a temporal-spatial charging scheduling algorithm, namely TSCA, for the on-demand charging architecture. We aim to minimize the number of dead nodes while maximizing energy efficiency to prolong network lifetime. First, after gathering charging requests, a WCV will compute a feasible movement solution. A basic path planning algorithm is then introduced to adjust the charging order for better efficiency. Furthermore, optimizations are made in a global level. Then, a node deletion algorithm is developed to remove low efficient charging nodes. Lastly, a node insertion algorithm is executed to avoid the death of abandoned nodes. Extensive simulations show that, compared with state-of-the-art charging scheduling algorithms, our scheme can achieve promising performance in charging throughput, charging efficiency, and other performance metrics.
机译:无线可充电传感器网络(WRSN)中的协作充电问题是一个流行的研究问题。借助无线功率传输技术,电能可以从无线充电车(WCV)传输到传感器,从而提供了延长网络寿命的新范例。现有的协作计费技术通常采用周期性和确定性的方法,但是忽略了诸如拓扑变化和节点故障之类的不确定性因素的影响,使其不适用于大规模WRSN。在本文中,我们针对按需计费架构开发了一种时空计费调度算法,即TSCA。我们旨在最大程度地减少死节点的数量,同时最大限度地提高能效,以延长网络寿命。首先,在收集充电请求之后,WCV将计算可行的运动解决方案。然后引入基本的路径规划算法来调整充电顺序,以提高效率。此外,在全局级别进行了优化。然后,开发了一种节点删除算法来删除低效的充电节点。最后,执行节点插入算法以避免废弃节点的死亡。大量的仿真表明,与最新的充电调度算法相比,我们的方案可以在充电吞吐量,充电效率和其他性能指标上实现有希望的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号