中文摘要：

在水面无线传感器网络（surface wireless sensor networks，SWSNs）中，传感器节点布置稀疏，节点间距离大于节点通信距离，移动基站需有效收集节点数据信息。完整收集节点数据，使基站移动路径最短或近似最短是一个关键问题。文章在节点间距离大于节点通信距离的前提下，利用Voronoi图理论生成基站移动候选子路径，并使用细菌觅食优化（bacterial foraging optimization，BFO）算法求解，以使规划路径最短或近似最短，网络通信能耗降低。结果表明，该方法在不同网络规模情况下均具有最短或近似最短的路径长度，且网络通信能耗低。

英文摘要：

In surface wireless sensor networks（SWSNs）, the sensor nodes are arranged sparsely, the distance between nodes is greater than the communication distance of the nodes, and the mobile base station needs to collect data of the nodes effectively. So the way to collect data completely so that the path is the shortest or the shortest approximately is a key problem. On the premise that the distance between nodes is greater than communication distance of the nodes, the base station moving candidate sub-path is generated by using the Voronoi diagram theory, and the bacterial foraging optimization （BFO） algorithm is proposed to solve the problem, so as to achieve a shortest path or approximate shortest path with lower energy consumption of network communication. The effectiveness of the pro- posed approach at different network scales is validated through extensive simulations.