Optimal sensor placement with signal propagation effects and inhomogeneous coverage preferences Online publication date: Tue, 01-Mar-2011
by Sergey N. Vecherin, D. Keith Wilson, Chris L. Pettit
International Journal of Sensor Networks (IJSNET), Vol. 9, No. 2, 2011
Abstract: The optimal sensor placement problem consists of determining the number, types, and locations of sensors satisfying inhomogeneous coverage requirements while minimising a specified cost function. The cost function can reflect various factors such as the actual cost of the sensors, their total number, and energy consumption. A strict and general formulation of the problem is described here for sensors characterised by probability of detection at some specified probability of false alarm. The formulation includes non-uniform coverage preferences and realistic, non-line-of-sight detection accounting on signal propagation effects. The optimisation is expressed as a solution to a binary linear programming problem. While exact solution of this problem is typically prohibitive, a fast greedy algorithm is presented that yields a near-optimal solution. It can also be successfully applied to improve coverage of an existing sensor network. This approach compares very favourably to an alternative heuristic strategy based on placing sensors one-by-one in the previously worst-covered location.
Online publication date: Tue, 01-Mar-2011
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com