ABSTRACT
Coverage problem in WSNs takes many shapes including target coverage, area coverage, and barrier coverage. The idea behind the point coverage is to cover specific points or moving points in the monitoring field. The problem in its general form is NP-complete problem (Zhao & Gurusamy, 2008) Therefore, the authors of (Zhao & Gurusamy, 2008) tried to solve the problem using heuristic approach as maximum cover tree problem and show that it is an NP-complete problem. One more point coverage technique is proposed in (Gu et al., 2011) to monitor a moving object in the monitored field. They propose heuristic approximation algorithms. In Area coverage (Singh & Sharma, 2014), the main purpose is to cover the whole area of the monitored field with minimum number of sensors and prolonging the lifetime of the network as well. To do so, different scheduling algorithms are proposed including learning automata (Dietrich & Dressler, 2009) (Maggie & Xuan, 2011). The last class of coverage is the barrier coverage in which it could be defined as maximizing the detection of penetration of a border. This type of coverage is used mostly in applications like countries border monitoring.
