Achieving 360° Angle Coverage with Minimum Transmission Cost in Visual Sensor Networks

In this paper, we study the angle coverage problem in visual sensor network. We consider a tracking system where an object of interest moves around the network, and the sensors surrounding it are responsible for capturing the images of it. We aim at finding the minimum cost cover which preserves all the angles of view with minimum transmission cost. We proved formally that the minimum cost cover problem can be transformed into the shortest path problem. Due to the acyclic nature of graphs generated in the transformation, we can develop a distributed algorithm to solve the problem, which is a lot more efficient than the distance vector protocol. Our simulation results show that our algorithm can successfully save a lot of energy.