A Coverage Problem Optimization Algorithm Based on Adaptive Particle Swarm Optimization in Wireless Sensor Network

• Main Authors: Ming-Yuan Huang, 黃明元
• Other Authors: Te-Jen Su
• Format: Others
• Language: zh-TW
• Published: 2010
• Online Access: http://ndltd.ncl.edu.tw/handle/w4x576

碩士 === 國立高雄應用科技大學 === 電子工程系 === 98 === The coverage problem is a crucial issue in wireless sensor networks (WSN), however, a high coverage rate ensures a high quality of service of the WSN. In this thesis, the control of the coverage problem optimization via adaptive particle swarm optimization (APSO) approach is presented. Due to proper selection of inertia weight of APSO gives balance between global and local searching, the research of this thesis shows that the larger weight helps to increase the convergence speed while the smaller one benefits the convergence accuracy, so the operation times of algorithm is decreased. APSO is used to find the optimal deployment of the sensors that gives the best coverage rate. Finally, the demonstrated examples are presented to illustrate the effectiveness of the proposed APSO methodology and the simulation results show that APSO algorithm achieves a good coverage solution with a better time efficiency.