會議論文
| 學年 | 98 |
|---|---|
| 學期 | 1 |
| 發表日期 | 2009-12-03 |
| 作品名稱 | A Hole Avoiding Routing Protocol with Relative Neighborhood Graph for Wireless Sensor Network |
| 作品名稱（其他語言） | |
| 著者 | Wang, Ying-Hong; Huang,Kuo-Feng; Lee, Liang-Yi; Quek, Kai-Guan |
| 作品所屬單位 | 淡江大學資訊工程學系 |
| 出版者 | Taipei : Institute of electrical and electronics engineers (IEEE) |
| 會議名稱 | JCPC 2009 Joint Conferences on Pervasive Computing |
| 會議地點 | Taipei, Taiwan |
| 摘要 | 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 event packets can avoid meeting a ¿hole¿ in advance instead of bypassing a hole when it meets the hole. This paper 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 achieves good performance in terms of average hop count, packet delivery success rate and power consumption in comparison with the existing protocols. |
| 關鍵字 | hole avoiding routing;hole detection;relative neighborhood graph;wireless sensor network |
| 語言 | en |
| 收錄於 | |
| 會議性質 | 國際 |
| 校內研討會地點 | 淡水校園 |
| 研討會時間 | 20091203~20091205 |
| 通訊作者 | |
| 國別 | TWN |
| 公開徵稿 | Y |
| 出版型式 | |
| 出處 | Proceedings of the 2009 joint conferences on pervasive computing, pp.239-246 |
| 相關連結 |
機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/73322 ) |