English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 58289/91817 (63%)
造访人次 : 13804422      在线人数 : 70
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/98968

    题名: BHAR: A Bidirectional Hierarchy-based Anycast Routing Protocol for Wireless Sensor Networks
    作者: Po-Jen Chuang;Teng-Tai Hu
    贡献者: 電機工程學系暨研究所
    关键词: wireless sensor networks;WSNs;hierarchy;anycast routing protocols;first declaration wins;location-less;bidirectional routing protocols;network lifetime;simulation
    日期: 2014-08-01
    上传时间: 2014-09-28 15:28:05 (UTC+8)
    摘要: This paper presents a bidirectional hierarchy-based anycast routing (BHAR) protocol to facilitate data collection in multi-hop wireless sensor networks (WSNs). In contrast to existing HAR mechanisms (Thepvilojanapong et al., 2005), the proposed BHAR is able to prolong network lifetime as it constructs hierarchical trees and repairs routes faster. BHAR is unique in letting sinks and sources initialise the construction of a hierarchical tree. Whenever a node knows its own parent and neighbour nodes, it can join a tree, exchange/refresh the routing table, and perform route repair without the aid of geographical information or being controlled remotely. As simulation results have demonstrated, such a design makes BHAR a faster and better protocol in constructing trees and repairing routes than HAR.
    關聯: International Journal of Communication Networks and Distributed Systems 13(1), pp. 1-24
    DOI: 10.1504/IJCNDS.2014.063968
    显示于类别:[電機工程學系暨研究所] 期刊論文





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