A simulated annealing algorithm for energy-efficient sensor network design
Resource
Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 2005. WIOPT 2005. Third International Symposium on
Journal
Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, 2005. WIOPT 2005. Third International Symposium on
Pages
-
Date Issued
2005-04
Date
2005-04
Author(s)
Lin, F.Y.S.
DOI
N/A
Abstract
In this paper, we develop an algorithm to deploy an energy efficient sensor network such that it provides surveillance and target-positioning services. We consider to place K independent sets of sensors on a sensor field. These sets monitor the field in turn and work together when intrusion events occur. The lifetime of the sensor network is therefore prolonged up to K times. The problem is therefore a variant of the set K-cover problem, which is NP-complete. We formulate such sensor deployment problem as a 0/1 integer programming problem. A Simulated Annealing based heuristic then is proposed for solving the optimization problem. The experimental results show that the proposed algorithm indicates a significant improvement in the sensor lifetime compared to the intuitive approach. Furthermore, the proposed algorithm is highly effective and efficient in terms of the overall deployment cost.
SDGs
Other Subjects
Algorithms; Energy efficiency; Position measurement; Problem solving; Sensors; Simulated annealing; Sensor deployment; Sensor network design; Set K-cover problem; Target-positioning services; Telecommunication networks
Type
other
File(s)![Thumbnail Image]()
Loading...
Name
01421105.pdf
Size
165.8 KB
Format
Adobe PDF
Checksum
(MD5):df86414c1def8162326c2bfc64415878