由於無線感測網路(wireless sensor networks, WSNs)之實務應用，受現實中各式各樣的地理環境，使得"洞"的產生及位置是很難避免，也很難去得知的。所以在進行封包傳送路由建置時，傳送此路由會受到因感測網路中有“洞”的存在而造成封包在傳遞時，可能因此延遲甚至遺失。為了解決這些問題，我提出一個新的路由方法(RNG Hole Avoiding Routing protocol, RNGHAR)，可以塑造出在無線感測網路中的"洞"，使得在進行事件封包傳送時，如果會遇到"洞"時，可事先得知、並避開經過洞的路徑。本篇論文提出 RNGHAR這個方法，是利用關聯鄰近圖(relative neighborhood graph, RNG)的路由演算法，勾勒出在無線感測網路中的"洞"，進而可以收集到"洞"的資訊，接著在進行事件封包傳送時，利用此資訊建構一條避開"洞"的路由，因而達到事件封包可事先避開"洞"，且可沿著最短路徑，由來源的位置順利傳送到目的地。由模擬結果顯示，我所提出的方法在平均節點數、封包傳送成功率以及能量的消耗上比起現存的方法都來的好。 In wireless sensor networks, “holes” are hardly to know its location and avoid either because of various actual geographical environments. A hole can be dynamically formed due to unbalanced deployment, failure or power exhaustion of sensors, animus interference, or physical barriers such as buildings or mountains. Hence, we hope to propose the RNG Hole Avoiding Routing protocol, RNGHAR which can model “holes” existed in wireless sensor network and a event packets can avoid meeting a “hole” in advance instead of bypassing a hole when it meets the hole.
This thesis proposes a novel algorithm RNGHAR which uses RNG (relative neighborhood graph) modeling holes then we can collect hole information in order to construct in advance hole avoiding routing path. Hence event packets will be guided to overcome the hole and move along the shortest path from source node to the sink node. Simulation studies show that my proposed method achieve good performance in terms of average hop count, packet delivery success rate and power consumption in comparison with the existing protocols.
