在無線感測網路中，Coverage 一直是最重要的問題之一。barrier coverage主要是探討如何找出一群較少的sensor集合，以共同防衛國與國邊界並達到禁止惡意闖入的目的。而k-barrier coverage則定義為在邊界區域中至少有k個sensors 可感應闖入者跨越邊界。本論文考慮在一 Mobile WSN的場景中，假設其最低的防禦能力為k-barrier coverage，為提升此網路的防禦能力與延長其生命期，我們提出一分散式的演算法，以減少sensor總耗電量及平衡sensor電量消耗的考量下，移動少量sensor，使整個網路的防禦能力提昇至k+1-barrier coverage。而實驗數據顯示，本論文所發展的演算法能夠移動較少sensor提升整個網路至k+1-barrier coverage的防禦能力，並可有效延長整個網路的生命期。 The k-barrier coverage problem is known as the problem of detecting the intruders by at least k sensors when the intruder moves along the crossing paths from one boundary to another. This paper considers a mobile WSN with demand of k-barrier coverage. To increase the monitoring quality and reduces and balances the energy consumption for each mobile sensor, this paper designs a distributed algorithm aiming at moving fewer mobile sensors with shorter distance for increasing the monitoring quality from (k-1)-barrier coverage to k-barrier coverage. Performance study reveals that the proposed algorithm can efficiently improve the monitoring quality and extend the network lifetime.
