A Near-Optimal Sensor Placement Algorithm to Achieve Complete Coverage/Discrimination in Sensor Networks
Resource
IEEE COMMUNICATIONS LETTERS, VOL. 9, NO. 1, JANUARY 2005
Journal
IEEE COMMUNICATIONS LETTERS
Journal Volume
VOL. 9
Journal Issue
NO. 1
Pages
-
Date Issued
2005-01
Date
2005-01
Author(s)
Lin, Y.S. Frank
Chiu, P.L.
DOI
246246/200611150121517
Abstract
In this letter, we develop a robust and scalable
algorithm to cope with the sensor placement problem for target
location under constraints of the cost limitation and the complete
coverage. The problem is NP-complete for arbitrary sensor fields.
The grid-based placement scenario is adopted and the sensor
placement problem formulated as a combinatorial optimization
problem for minimizing the maximum distance error in a sensor
field under the constraints. The proposed algorithm is based
on the simulated annealing approach. The experimental results
reveal that, for small sensor fields, the algorithm can find the
optimal sensor placement under the minimum cost limitation.
Moreover, it can also find a placement with minimum distance
error for large sensor fields under the cost limitation.
Subjects
Sensor placement
target location
mathematical
programming
programming
optimization
simulated annealing
Publisher
Taipei:National Taiwan University Dept Elect Engn
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
4099.pdf
Size
494.73 KB
Format
Adobe PDF
Checksum
(MD5):3fce97dd7ed8685b6a86f8124934f579