English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 56848/90584 (63%)
造訪人次 : 12158013      線上人數 : 63
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/104268

    題名: A Hole Avoiding Routing Protocol using a Relative Neighborhood Graph for Wireless Sensor Networks
    作者: Tsai, Chih-Hsiao;Wang, Ying-Hong;Lee, Liang-Yi
    關鍵詞: Wireless sensor network;Hole detection, Relative neighborhood graph;Hole avoiding routing
    日期: 2013-12-01
    上傳時間: 2016-01-06 10:53:32 (UTC+8)
    摘要: In wireless sensor networks, “holes” are difficult to
    find and avoid because of various actual geographical
    environments. A hole can form dynamically due to
    unbalanced deployment, failure or power exhaustion of sensors, animus interference, or physical barriers such as buildings or mountains. Hence, we propose a novel algorithm, the Relative Neighborhood Graph Hole.Avoiding Routing protocol (RNGHAR), which uses relative neighborhood graphs (RNG) to model holes so that hole information can be collected in order to construct a routing path that avoids holes in advance. Therefore, event packets will be guided to avoid the hole and move along the shortest path from the source node to the sink node. Simulations how that the proposed method achieves good performance
    in terms of the average hop count, packet delivery success rate, and power consumption in comparison with existing protocols.
    關聯: Journal of Internet Technology 14(7), pp.1021-1031
    DOI: 10.6138/JIT.2013.14.7.02
    顯示於類別:[資訊工程學系暨研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數



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