English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 56378/90242 (62%)
造訪人次 : 11682634      線上人數 : 34
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/73322

    題名: 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
    貢獻者: 淡江大學資訊工程學系
    關鍵詞: hole avoiding routing;hole detection;relative neighborhood graph;wireless sensor network
    日期: 2009-12
    上傳時間: 2011-10-24 11:45:34 (UTC+8)
    出版者: Taipei : Institute of electrical and electronics engineers (IEEE)
    摘要: 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.
    關聯: Proceedings of the 2009 joint conferences on pervasive computing, pp.239-246
    DOI: 10.1109/JCPC.2009.5420184
    顯示於類別:[資訊工程學系暨研究所] 會議論文


    檔案 描述 大小格式瀏覽次數
    A Hole Avoiding Routing Protocol with Relative Neighborhood Graph for.pdf全文檔7389KbAdobe PDF154檢視/開啟



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋