Learn More
Coverage is a fundamental task in sensor networks. We consider the minimum cost point coverage problem and formulate a binary integer linear programming model for effective sensor placement on a grid-structured sensor field when there are multiple types of sensors with varying sensing quality and price. The formulation is general and can be adapted to(More)
The point coverage, sink location and data routing problems are considered in an integrated way and two new mixed integer programming formulations are proposed. As these models are computa-tionally difficult to solve, a nested solution procedure is proposed. The best sensor locations are sought by tabu search in the top level. Given the sensor locations, a(More)
  • 1