Geometry Assisted Energy Efficient Sweep Coverage Algorithm For Wireless Sensor Networks

With the rapid development of wireless sensing technology and the popularity of the internet of things, applications based on wireless sensor networks have been applied universally in many scenarios. Sweep coverage is an emerging technique to improve the quality of service by promoting the energy efficiency of the sensors. To solve the distance-sensitive-route scheduling problem, which considering the route scheduling taking advantage of the sensing radius to reduces the cycle path of the mobile sensors and improves the feedback time of the network, this article proposes a three-stage geometry assisted energy-efficient sweep coverage algorithm to determine the route of mobile sensors with minimal energy consumption. With analysis of the distribution of the static monitoring targets, initial sensing points are determined. To minimize the sweep path in a single cycle, we use an ant colony optimization algorithm to schedule an energy-efficient routing. In addition, the sensing point of each target is updated by a local optimization mechanism according to the route information. To demonstrate the effectiveness of the proposed algorithm, we compare our proposed algorithm to a wealth of wireless sensor network scenarios. The simulation results show that our algorithm can significantly reduce the length of the cycle route, so as to enhance the energy efficiency of the wireless sensor networks.

I. Introduction

With the progress of wireless communication and sensor technology, wireless sensors are becoming much cheaper, more versatile, and more adaptable, making them more reliable and easily extensive in our daily life applications. It is well known the coverage problem is one of the most critical issues in the widespread application of wireless sensor networks.