Optimal Configuration Planning for Sensor Network Serviceability Under a System Coverage Constraint

Abstract

We develop an optimization approach for the planning problem of configuring the positions of sensors within a sensor network for minimization of the travel length required to service the sensor locations. This is in contrast to existing approaches whereby the coverage of the sensor network is an objective of the optimization; in this new optimization approach the level of coverage is treated as a constraint. By beginning with an over-populated sensor network and then alternating between sensor repositioning and sensor removal, we create an optimization procedure that solves this difficult practical planning problem. A formal rule for switching between the repositioning and removal components of the optimization strategy is developed. Numerical example problems are presented to illustrate the method and show its performance against a heuristic optimization approach.

Keywords

• Genetic algorithms
• optimal planning
• Q-coverage
• traveling salesman problem
• wireless sensor networks