Coverage and Exposure Paths in Wireless Sensor Networks

Wireless sensor networks have posed a number ofchallenging problems such as localization, deployment and tracking,etc. One of the interesting problems is the calculation of the coverageand exposure paths for the sensor networks. This paper presents a fullylocalized algorithm to solve the worst coverage problem firstintroduced by Meguerdichian et al. The nodes of the sensor networkcooperate to construct the worst coverage path only by the one-hopneighbor's information, thus avoiding the massive communication andconserving the energy. The correctness of the proposedalgorithm is proved formally under the sensing diminishing model. Moreover, thisalgorithm can be easily extended to solve the minimal exposure problemwith local information as well.