A New and Efficient Hierarchy-Based Anycast Routing Protocol for Wireless Sensor Networks

淡江大學機構典藏 > 工學院 > 電機工程學系暨研究所 > 會議論文 > Item 987654321/70256

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: 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	全文檔	393Kb	Adobe PDF	312	检视/开启
index.html		0Kb	HTML	256	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章