BHAR: A Bidirectional Hierarchy-based Anycast Routing Protocol for Wireless Sensor Networks
學年 103
學期 1
出版（發表）日期 2014-08-01
作品名稱 BHAR: A Bidirectional Hierarchy-based Anycast Routing Protocol for Wireless Sensor Networks
作品名稱（其他語言）
著者 Po-Jen Chuang; Teng-Tai Hu
單位 電機工程學系暨研究所
出版者
著錄名稱、卷期、頁數 International Journal of Communication Networks and Distributed Systems 13(1), p. 1-24
摘要 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.
關鍵字 wireless sensor networks;WSNs;hierarchy;anycast routing protocols;first declaration wins;location-less;bidirectional routing protocols;network lifetime;simulation
語言 en
ISSN 1754-3924
期刊性質 國外
收錄於 EI
產學合作
通訊作者 Po-Jen Chuang
審稿制度 是
國別 GBR
公開徵稿
出版型式 ,電子版,紙本
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/98968 )

機構典藏連結
SDGS 優質教育,產業創新與基礎設施