Connected Point Coverage in Wireless Sensor Networks Using Robust Spanning Trees
Energy limitation is one of the most critical challenges in the area of sensor networks. Sleep scheduling mechanisms can reduce the energy consumption. Coverage mechanisms attempt to cover the area with the minimum possible number of sensors. There are many area coverage approaches which also consider the connectivity problem. However, in the area of point coverage, there are limited mechanisms that maintain connectivity. In this paper, the authors propose a point coverage mechanism and two connectivity mechanisms. They compare these mechanisms to one of the best methods that consider both point coverage and connectivity.