邊界覆蓋(Barrier Coverage)在無線感測網路中是很重要且受到廣泛討論的問題。在多數的研究中，大多假設感測器的感測範圍是二元感測模型(Binary Sensing Model)，然而，在現實監控區域中，機率式感測模型較接近大多數真實的感測器行為，即目標物被感測到之機率會因為其與感測器之距離遠近而有所不同。本論文基於機率式感測模型(Probability Sensing Model)，提出一分散式演算法，探討k-邊界覆蓋(k-Barrier Coverage)之排程技術，在滿足使用者所設定的k-覆蓋機率值門檻之監測品質要求下，形成一條盡可能的延長生命期的防禦曲線。實驗模擬顯示，我們所提出的k-Barrier Coverage演算法具有較長的網路壽命。 In wireless sensor networks, barrier coverage issue has been widely discussed due to its important role. In literatures, the sensing model of the sensor is a binary sensing model which provides large detection probability. However, in reality, the closer the sensor is located to the object, the greater the probability of the object being sensed. This is because of the proximity of the sensor''s distance varies. Based on the Probability Sensing Model, this paper proposes a decentralized algorithm method to deploy the sensors by using k-Barrier Coverage Scheduling. In order to meet the k-coverage probability requirements, the amount of sensors should be set by the user to extend the lifetime of the sensors. The simulation shows that the number of sensors used in the proposed k-Barrier Coverage algorithm are minimized in order to provide longer lifetime.
