Scheduling with Collaborative Mobile Chargers Inter-WSNs
Scheduling with Collaborative Mobile Chargers Inter-WSNs
复制标题
DOI：
10.1155/2015/921397
复制
发表时间：
2015-05
影响因子：
2.3
通讯作者：
Jidong Zhao;Xili Dai;Xiaomin Wang
中科院分区：
文献类型：
--
作者：
Jidong Zhao;Xili Dai;Xiaomin Wang
移动充电问题描述了无线传感器网络中移动充电器向传感器节点周期性地提供能量的问题。其中，每个传感器节点在充电轮中都有一个异步休息工作时间。考虑了异步休息工作时间，并以合适的总服务速率给出了充电周期的下界和上界，给出了传感器节点时间窗的定义。在本文中，我们将这个问题在二维无线传感器网络中建模为一个带时间窗的车辆路径问题（VRPTW）。为了解决多个移动充电器具有不同路由路径的问题，我们提出将多个路由问题转化为单个路由问题，通过将sink复制为多个虚拟sink。为了优化路径，我们提出了一种考虑移动充电器协同充电的局部优化算法。通过仿真，我们将所提出的算法与H η C l u、H η C H ar g i n g （β）算法进行了比较。在此问题中，我们展示了我们的协同调度算法的优势。
Mobile charge problem describes a fleet of mobile chargers delivers energy to the sensor nodes periodically in wireless sensor networks (WSNs). In it, every sensor node has an asynchronous rest working time during a charging round. We consider the asynchronous rest working time and give the lower and upper bounds of the recharging cycle by the suitable total serving rate, to give the definition of time windows for the sensor nodes. In this paper, we model this problem in 2-dimensional WSNs as a vehicle routing problem with time windows (VRPTW). For solving the problem of multiple mobile chargers with different routing paths, we propose to transform the multiple routing problems into a single routing problem, by duplicating the sink into multiple virtual sinks. To optimize the routing path, we propose a local optimization algorithm by considering the collaborative charging among the mobile chargers. Through the simulations, we compare our proposed algorithm with the H η C l u s t e r C h a r g i n g ( β ) algorithm. We demonstrate the advantages of our collaborative scheduling algorithm in this problem.