Article: Optimisation of numbers, types, and locations of wireless sensors with communication, finite supply, and multiple-sensor coverage constraints Journal: International Journal of Sensor Networks (IJSNET) 2017 Vol.23 No.4 pp.222 - 232 Abstract: The sensor placement problem considered in this paper is to determine optimal sensor configurations satisfying coverage preferences at a minimal cost. This problem is formulated as the binary linear programming problem. The generic formulation is generalised to include several realistic demands, such as a finite sensor supply, single hop wireless sensor communication, and multiple-sensor overlapping coverage. Communication and detection are considered in a probabilistic framework. An exact solution to this problem is computationally demanding (NP-complete) and practically impossible for realistic scenarios. Therefore, a fast algorithm for approximate solutions is used. To evaluate the quality of the approximate solutions, they are compared with exact solutions for cases when the exact solutions are obtainable. The results demonstrate that the approximate solutions are highly satisfactory regardless of the complexity of problem constraints, while an exact algorithm can be impractically slow. Inderscience Publishers - linking academia, business and industry through research

Title: Optimisation of numbers, types, and locations of wireless sensors with communication, finite supply, and multiple-sensor coverage constraints

Authors: Sergey N. Vecherin; D. Keith Wilson; Chris L. Pettit

Addresses: US Army Cold Regions Research and Engineering Laboratory, Signature Physics Branch, 72 Lyme Rd., Hanover, NH 03755-1290, USA ' US Army Cold Regions Research and Engineering Laboratory, Signature Physics Branch, 72 Lyme Rd., Hanover, NH 03755-1290, USA ' US Naval Academy, Aerospace Engineering Department, 590 Holloway Rd., MS 11-B, Annapolis, MD 21402, USA

Abstract: The sensor placement problem considered in this paper is to determine optimal sensor configurations satisfying coverage preferences at a minimal cost. This problem is formulated as the binary linear programming problem. The generic formulation is generalised to include several realistic demands, such as a finite sensor supply, single hop wireless sensor communication, and multiple-sensor overlapping coverage. Communication and detection are considered in a probabilistic framework. An exact solution to this problem is computationally demanding (NP-complete) and practically impossible for realistic scenarios. Therefore, a fast algorithm for approximate solutions is used. To evaluate the quality of the approximate solutions, they are compared with exact solutions for cases when the exact solutions are obtainable. The results demonstrate that the approximate solutions are highly satisfactory regardless of the complexity of problem constraints, while an exact algorithm can be impractically slow.

Keywords: optimal sensor placement; communicating sensors; optimal sensor networks; binary linear programming; overlapping sensor coverage; sensor network optimisation.

DOI: 10.1504/IJSNET.2017.083524

International Journal of Sensor Networks, 2017 Vol.23 No.4, pp.222 - 232

Received: 07 Nov 2014
Accepted: 17 Feb 2015
Published online: 09 Apr 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: Optimisation of numbers, types, and locations of wireless sensors with communication, finite supply, and multiple-sensor coverage constraints

Keep up-to-date