Optimisation of numbers, types, and locations of wireless sensors with communication, finite supply, and multiple-sensor coverage constraints Online publication date: Sun, 09-Apr-2017
by Sergey N. Vecherin; D. Keith Wilson; Chris L. Pettit
International Journal of Sensor Networks (IJSNET), Vol. 23, No. 4, 2017
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook