New adaptive localization algorithms that achieve better coverage for wireless sensor networks

• Main Authors: Lin, Shou-Chun, 林紹鈞
• Other Authors: Chen, Chiu-Yuan
• Format: Others
• Language: en_US
• Published: 2013
• Online Access: http://ndltd.ncl.edu.tw/handle/99255473513360043236

碩士 === 國立交通大學 === 應用數學系所 === 101 === Many applications in wireless sensor networks (such as forest fires detection, environment monitoring, military, and wildlife tracking) require position information to detect and record events. How to obtain the position information of the sensors become an important problem and is usually called the localization problem. Using Global Positioning System (GPS) is a possible solution for localization but is impractical. The reason is that a wireless sensor network usually has thousands of sensors and it is too expensive to equip every sensor a GPS. In [3], Huang et al. studied a new optimization problem, minimum cost localization problem, which aims to localize all sensors by using the minimum number of anchors. The purpose of this thesis is to propose adaptive algorithms for the localization problem. Our algorithms are simpler than the algorithms in [3] and cover all the cases in the algorithms in [3]; simulation results also show that our algorithms have better coverage.