Optimal coverage paths in ad-hoc sensor networks
Dinesh P. Mehta, Marisa López, Lan Lin · 2004
This paper discusses the computation of optimal coverage paths in an ad-hoc network consisting of n sensors. Improved algorithms, with a preprocessing time of O(n log n), to compute a maximum breach/support path P in optimal (|P|) time or the maximum breach/support value in O(1) time are presented. Algorithms for computing a shortest path that has maximum breach/support are also provided. Experimental results for breach paths show that the shortest path length is on the average 30% less and is not much worse that the ideal straight line path. For applications that require redundancy (i.e., detection by multiple sensors), a generalization of Voronoi diagrams allows us to compute maximum breach paths where breach is defined as the distance to the kth nearest sensor in the field. Extensive experimental results are provided.