Computing best coverage path with reliability in wireless sensor networks

Under the domain of barrier coverage, Best Coverage Path can be calculated using computational geometric algorithms. The sensing field may have randomly distributed sensors that can provide a cover to a single point by multiple numbers of sensors resulting into a k-coverage scenario where k is the constant number of sensors available to cover any single point on the field. In real environment we have obstacles that hinders path and obstruct line of sight. Obstacles can be simulated as geometrical shapes say line segment causing absolute opaqueness to the line of sight and blockage of path. In this paper we have proposed an approach of computing a k-covered Best coverage path between a pair of location on a two dimensional field in presence of line segment obstacles. An algorithm is proposed to find a path covered by a constant number of sensors in polynomial time. Then a java application based on proposed algorithm has been designed and some observations are being made.