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

    題名: A New and Efficient Hierarchy-Based Anycast Routing Protocol for Wireless Sensor Networks
    作者: Chuang, Po-Jen;Hu, Teng-Tai
    貢獻者: 淡江大學電機工程學系
    關鍵詞: Bidirectional;First Declaration Wins;Hierarchy;Location-less;Routing Protocols;Wireless sensor networks
    日期: 2010-09
    上傳時間: 2013-03-07 14:52:05 (UTC+8)
    出版者: New York: Institute of Electrical and Electronics Engineers (IEEE)
    摘要: This paper presents a Bidirectional Hierarchy-based Any cast Routing (BHAR) protocol for collecting data over multi-hop wireless sensor networks (WSNs). The BHAR protocol improves on existing HAR mechanisms to speed up the process of constructing hierarchical trees and repairing routes, and as a result to prolong network lifetime. Different from HAR, BHAR allows sinks and sources to initialize the construction of a hierarchical tree. By knowing only its own parent and neighbor nodes, each node can join a tree, exchange/refresh its routing table, and perform route repair without geographical information or being controlled remotely. Simulation results show that our BHAR performs apparently better than traditional HAR on network construction and route repair.
    關聯: Parallel and Distributed Processing with Applications (ISPA), 2010 International Symposium on, pp.334-341
    DOI: 10.1109/ISPA.2010.86
    顯示於類別:[電機工程學系暨研究所] 會議論文


    檔案 描述 大小格式瀏覽次數
    A New and Efficient Hierarchy-based Anycast Routing Protocol.pdf全文檔393KbAdobe PDF286檢視/開啟



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