Energy Efficient PCP protocol for k- coverage in Sensor networks
C. Vimalarani · 2010
Wireless sensor networks are networks used to collect an environmental information in an area using sensor nodes with low power. The sensors sense various informations in different ways. So tha the sensors are expected to have different sensing models.Probabilistic coverage protocol (PCP) that can employ different sensing models. In this paper our coverage protocol is combined with K-coveragein order to increase the coverage area and to minimize the energy consumed by the sensor networks.For k-coverage case an efficient approximation algorithm DRKC(distributed randomised k-coverage algorithm) is used to achieve low power consumption.Our algorithm can be implemented in a distributed manner with a local information and a low message complexity. Simulation results show that the distributed algorithm converges faster and consumes much less energy than the previous centralized algorithms.