Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain

This publication has 17 references indexed in Scilit:

• Optimal Point Movement for Covering Circular Regions
  Lecture Notes in Computer Science, 2012
• Representing a Functional Curve by Curves with Fewer Peaks
  Discrete & Computational Geometry, 2011
• Minimum-Cost Linear Coverage by Sensors with Adjustable Ranges
  Lecture Notes in Computer Science, 2011
• Optimal movement of mobile sensors for barrier coverage of a planar region
  Theoretical Computer Science, 2009
• Localized sensor self-deployment with coverage guarantee
  ACM SIGMOBILE Mobile Computing and Communications Review, 2008
• Designing localized algorithms for barrier coverage
  2007
• Barrier coverage with wireless sensors
  Wireless Networks, 2006
• Wireless sensor networks: a survey
  Computer Networks, 2002
• An Optimal-Time Algorithm for Slope Selection
  SIAM Journal on Computing, 1989
• Slowing down sorting networks to obtain faster sorting algorithms
  Journal of the ACM, 1987