Optimal coverage paths in ad-hoc sensor networks

@inproceedings{Mehta2003OptimalCP,
  title={Optimal coverage paths in ad-hoc sensor networks},
  author={Dinesh P. Mehta and Mario A. L{\'o}pez and Lan Lin},
  booktitle={ICC},
  year={2003}
}
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 O(|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… CONTINUE READING
Highly Cited
This paper has 59 citations. REVIEW CITATIONS
33 Citations
7 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 33 extracted citations

59 Citations

051015'07'10'13'16
Citations per Year
Semantic Scholar estimates that this publication has 59 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…