教師資料查詢 | 類別: 會議論文 | 教師: 王英宏WANG YING-HONG (瀏覽個人網頁)

標題:A Hole Avoiding Routing Protocol with Relative Neighborhood Graph for Wireless Sensor Network
學年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
語言英文
收錄於
會議性質國際
校內研討會地點淡水校園
研討會時間20091203~20091205
通訊作者
國別中華民國
公開徵稿Y
出版型式
出處Proceedings of the 2009 joint conferences on pervasive computing, pp.239-246
相關連結
SDGs
Google+ 推薦功能,讓全世界都能看到您的推薦!