A Simulated Annealing Algorithm for the Target Coverage Problem in Wireless Sensor Networks

• Main Authors: Rong-Chin Tsai, 蔡榮欽
• Other Authors: Pi-Rong Sheu
• Format: Others
• Language: zh-TW
• Published: 2015
• Online Access: http://ndltd.ncl.edu.tw/handle/98770043286267646613

碩士 === 國立雲林科技大學 === 電機工程系 === 103 === The target coverage problem in wireless sensor networks has been proven to be an NP-complete problem. As a problem has been proven to be NP-complete, it is important and practical to design its heuristic algorithms. Actually, several heuristic algorithms have been proposed for the target coverage problem. Because the wireless sensor networks are more and more widely applied, the allocations of targets and sensors may be a randomly distribution or a checkerboard distribution. In this thesis, we discover that the existing heuristic algorithms cannot produce long network lifetime simultaneously at these two distributions. Simulated annealing has been used to solve some NP-complete problems in wireless networks. In this thesis, based on simulated annealing, we design an efficient heuristic algorithm for the target coverage problem in wireless sensor networks. Computer simulation results show that compared with other algorithms, our simulated annealing algorithm may generate longer network lifetime whether the targets and sensors are allocated in a randomly distribution or in a checkerboard distribution. Keywords: network lifetime, simulated annealing, target coverage problem, wireless sensor network.