| Summary: | 碩士 === 國立交通大學 === 應用數學系所 === 103 === Localization problem is one of the most important problems in wireless sensor networks (WSNs). Two commonly used criteria for evaluating localization algorithms are accuracy and coverage. Accuracy is measured by using the average of position errors, and coverage is the percentage of sensors which are localized. In 2005, Liu et al. [16] presented a protocol that uses three types of unit localizable collaborative body (ULCB) to enhance the coverage and to decrease the localization error. In 2012, Bu et al. [7] presented a conflict-friendly localization algorithm to increase localization accuracy and coverage. In this thesis, we will propose a new ULCB and propose a new distributed, collaborative, conflict-friendly localization algorithm, which has the advantages of both the algorithms in [16] and [7]. Simulation results show that our algorithm improves the coverage of Figure 4 in [16] from 85% to 98%. Moreover, for each localized sensor node, our algorithm reports its location instead of just mentioning that this sensor node is localized.
|
|---|
