最近幾年，以位置資訊為基礎的服務持續發展中，像是搜尋、目標追蹤或是緊急搜救等；在無線感測網路中，精準且高效率的定位演算法是這些網路服務的關鍵．過去的文獻中已記載了許多不同類型的定位演算法．由於無線感測網路的布建範圍廣大，考量其成本和硬體的限制，range-free類型的定位演算法較為可行．此類型之演算法可分為兩個階段，分別是距離測量（distance estimation）和三角定位(triangulation)階段．若距離測量的精確性可以有所改進，便可增進定位的精準度．在這篇論文中，我們提出一套新的方法來測量單一躍點(single hop)間的距離；另外，在相距多個躍點(multi-hop)的情況下，也提出了一套修正的法則用以修正加總多個單一hop距離後的誤差．藉由模擬，我們將此方法和其他range-free的演算法加以比較，我們發現我們的距離測量方法可降低距離測量階段的誤差，在相同的設定下，我們的距離測量方法比起其他的方法準確，尤其是在錨點(anchor)數量低的情況下． In recent years, a number of location - based services have been proposed, such as search, target tracking and rescue. An accurate and efficient localization algorithm is crucial in supporting all these services in wireless networks. There are many different localization algorithms proposed in the literature. Due to the cost and limitation of hardware on sensing nodes, range-free localization schemes have received great deal of attention. Such schemes include two phases: distance estimation and triangulation. A better distance estimation helps improve the accuracy of localization. In this thesis, we propose a novel scheme for single hop and range estimation. Additionally, we propose the first correction scheme to estimate multi-hop range by mean of single hop range estimations. Compared to other range-free distance estimation, our scheme reduces the error significantly, especially when the number of anchors is low.
