English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62379/95055 (66%)
Visitors : 2301813      Online Users : 161
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/70256

    Title: A New and Efficient Hierarchy-Based Anycast Routing Protocol for Wireless Sensor Networks
    Authors: Chuang, Po-Jen;Hu, Teng-Tai
    Contributors: 淡江大學電機工程學系
    Keywords: Bidirectional;First Declaration Wins;Hierarchy;Location-less;Routing Protocols;Wireless sensor networks
    Date: 2010-09
    Issue Date: 2013-03-07 14:52:05 (UTC+8)
    Publisher: New York: Institute of Electrical and Electronics Engineers (IEEE)
    Abstract: 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.
    Relation: Parallel and Distributed Processing with Applications (ISPA), 2010 International Symposium on, pp.334-341
    DOI: 10.1109/ISPA.2010.86
    Appears in Collections:[Graduate Institute & Department of Electrical Engineering] Proceeding

    Files in This Item:

    File Description SizeFormat
    A New and Efficient Hierarchy-based Anycast Routing Protocol.pdf全文檔393KbAdobe PDF296View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

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