一個新的可用於無線感測網路之分散式協作且對衝突友善之定位演算法

Abstract

定位問題是無線感測網路中最重要的問題之一。兩個常用的評估定位演算法的標準為：精確度及覆蓋率，其中精確度是經由測量平均位置誤差而來，而覆蓋率則是定位成功的感測器佔全體感測器的比例。在文獻[16]中，劉等人使用三種可定位協作體單元來提升覆蓋率並減少定位誤差。在文獻[7]中，Bu等人提出對衝突友善的定位演算法來增加精確度及覆蓋率。在本論文中，我們將給出一個新的可定位協作體單元，並提出一個新的分散式協作且對衝突友善之定位演算法，此演算法同時擁有文獻[16]及文獻[7]中演算法的優點。實驗數據顯示：我們的演算法改進了文獻[16]中的圖4的覆蓋率，由89%提升到97%。此外，我們的演算法確切給出了每個已定位的感測器的位置，而不是只記錄該感測器已被定位。

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.