A near-optimal sensor placement algorithm to achieve complete coverage-discrimination in sensor networks

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 se...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE communications letters Ročník 9; číslo 1; s. 43 - 45
Hlavní autoři: Lin, F.Y.S., Chiu, P.L.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.01.2005
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Aircraft
Applied sciences
Constraint optimization
Cost function
Exact sciences and technology
Information management
Intelligent networks
Mathematical programming
Quality of service
Robustness
Simulated annealing
Surveillance
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Valuation and optimization of characteristics. Simulation
Positioning
Sensor placement
target location
Simulated annealing
Localization
Sensor array
Algorithm
Target detection
Optimization
Mathematical programming
ISSN:1089-7798, 1558-2558
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2005.01027