在這篇論文裡,我們提出了一個能夠有效率地探測出在無線感測網路上的覆蓋空洞的分散式演算法。在假設每個散佈的感測節點位置都能知道的情況下,我們將整個方法分成兩個階段。第一個階段,我們的目的是檢測出每個包圍在覆蓋空洞旁的節點。我們利用我們提出來的概念-單獨覆蓋弧線(mono-covered arc),此弧線代表了每個節點的感測圓弧中,沒有被其它節點所重覆覆蓋的部分。在我們的方法中,這些有方向性的單獨覆蓋弧線的右側,就是覆蓋空洞及未完全覆蓋區域。在這樣的觀念之下,我們發展出一個以圖論為基礎的分散式演算法,這個演算法可以在感測節點端有效地分辨出每個覆蓋空洞的位置及型態。甚者,這些圖的資訊可被送到基地台做整合,以辨認出所有存在於網路中的覆蓋空洞的幾何特徵
In this thesis, we develop a practical and energy-efficient distributed algorithm for the detection of coverage holes in a wireless sensor network. It assumes the location of sensor nodes is available. We do this in two phases. First we want to identify a set of nodes of which encircle a coverage hole. This is done by introducing a concept of mono-covered arc, which represents the circumference of a non-overlapping region of the sensing disc of a sensor node. That is, a coverage hole or insufficient coverage region will be along the right-hand side of these directed mono-covered arcs. Based on this notion, a graph-theoretic distributed algorithm can then be developed to identify every simple boundary and interior hole locally. Furthermore, these graph-theoretic information can also be forwarded to the sink or base station to recognize the geometric characteristics among these coverage holes existing in the network fabric remotely.