Run to Potential: Sweep Coverage in Wireless Sensor Networks

Wireless sensor networks have become a promising technology in monitoring physical world. In many applications with wireless sensor networks, it is essential to understand how well an interested area is monitored (covered) by sensors. The traditional way of evaluating sensor coverage requires that every point in the field should be monitored and the sensor network should be connected to transmit messages to a processing center (sink). Such a requirement is too strong to be financially practical in many scenarios. In this study, we address another type of coverage problem, sweep coverage, when we utilize mobile nodes as supplementary in a sparse and probably disconnected sensor network. Different from previous coverage problem, we focus on retrieving data from dynamic Points of Interest (POIs), where a sensor network does not necessarily have fixed data rendezvous points as POIs. Instead, any sensor node within the network could become a POI. We first analyze the relationship among information access delay, information access probability, and the number of required mobile nodes. We then design a distributed algorithm based on a virtual 3D map of local gradient information to guide the movement of mobile nodes to achieve sweep coverage on dynamic POIs. Using the analytical results as the guideline for setting the system parameters, we examine the performance of our algorithm compared with existing approaches.