Schedule a mobile charger to replenish energy to sensor nodes for the wireless sensor networks has attracted great attention recently, due to its efficiency and flexibility. Some existing works study the mobile charger scheduling problem by considering that only the depot can recharge or replace the battery for the mobile charger. However, for large-scale wireless sensor networks, the mobile charger is energy inefficient or even may run out of energy during the travel for charging. In this paper, we consider the scenario that there are some service stations in the network area which can be used to replace the battery for the mobile charger, and we study the problem of minimizing the number of used batteries for a mobile charger to charge a wireless sensor network (MBA). We first consider a special case of the MBA problem, in which the depot is the only service station, and we present an approximation algorithm to address it. Then we propose an approximation algorithm for the MBA problem with the assumption that the distance of any two service stations is limited. And finally, we consider the general MBA problem and propose an approximation algorithm. We validate the performance of our algorithms by extensive simulations, and the results show that our proposed algorithms are promising.

计划移动充电器为无线传感器网络的传感器节点补充能量由于其效率和灵活性最近引起了极大的关注。一些现有的工作通过考虑只有仓库可以为移动充电器充电或更换电池来研究移动充电器调度问题。但是，对于大型无线传感器网络，移动充电器的能源效率很低，甚至可能在旅行途中进行充电。在本文中，我们考虑了以下情况：网络区域中有一些服务站可以用来替换移动充电器的电池，并且我们研究了最大限度地减少用于移动充电器充电的电池数量的问题。无线传感器网络（MBA）。我们首先考虑MBA问题的特殊情况，其中仓库是唯一的服务站，我们提出一种近似算法来解决这个问题。然后，我们提出了一种针对MBA问题的近似算法，并假设任何两个服务站的距离都受到限制。最后，我们考虑了一般的MBA问题并提出了一种近似算法。我们通过广泛的仿真验证了我们算法的性能，结果表明我们提出的算法很有希望。