無線網路中無地理資訊之覆蓋程度計算

Abstract

覆蓋率的判定係無線感測網路的一項基本議題。普遍決定覆蓋率的演算法均需仰賴精確的感測器位置資訊。本篇論文探討在無法獲得位置資訊的前提之下，將覆蓋問題定義為尋找一個感測器所組成的最大集合，而此集合中的每個感測器的服務區域至少都被k個感測器所覆蓋，此處的k是一個給定的整數。在我們提出的分散式演算法中，每個感測器僅需鄰居資訊即可判斷其感測區域是否為k-覆蓋。最後，我們利用模擬通訊範圍與覆蓋範圍的比率變化來評估此演算法的效能。

Determining the coverage of a wireless sensor network is a fundamental issue. Most coverage determination algorithms rely on accurate location information of sensors. In this paper, assuming no location knowledge, the coverage problem is defined as one of finding a maximum set of sensor nodes whose service areas are covered by at least k sensors, where k is a given integer. We propose distributed algorithms where each sensor only depends on neighborhood information to determine if its sensing area is k-covered or not. We evaluate the performance of these algorithms with simulations by varying the ratio of sensors' communication distance to sensing distance.