HAR: hierarchy-based anycast routing protocol for wireless sensor networks
HAR: hierarchy-based anycast routing protocol for wireless sensor networks
复制标题
DOI：
10.1109/saint.2005.34
复制
发表时间：
2005-01
期刊：
影响因子：
--
通讯作者：
N. Thepvilojanapong;Y. Tobe;K. Sezaki
中科院分区：
文献类型：
--
作者：
N. Thepvilojanapong;Y. Tobe;K. Sezaki
本文提出了一种基于层次结构的任播路由协议(HAR)，用于在多跳无线传感器网络上收集数据。该协议的设计旨在满足传感器网络中每个传感器定期或自发地向基站发送传感数据的要求。基站通过寻找自己的子节点来构建层次树，子节点再发现自己的子节点，依此类推。HAR避免了洪泛和定期更新路由信息，但在节点故障或添加新节点时将重建树。通过只知道自己的父节点和祖节点，每个传感器都可以做出转发决策，而不考虑其他邻近节点的知识或地理信息。我们使用ns-2模拟器对HAR的性能进行了评估，并与DSR和AODV进行了比较。仿真结果表明，HAR在各种场景下都能获得更高的投递率和更低的时延。
In this paper, we present hierarchy-based any-cast routing (HAR), a routing protocol for collecting data over multihop, wireless sensor networks. The design of the protocol aims to satisfy the requirements of sensor networks that every sensor transmits sensed data to the base station periodically or spontaneously. The base station constructs hierarchical tree by finding its child nodes which in turn discover their own child nodes and so on. HAR avoids both flooding and periodic updating of routing information but the tree will be reconstructed upon node failures or adding of new nodes. By knowing only its own parent and grandparent, each sensor can make forwarding decisions regardless of the knowledge on other neighboring nodes or geographical information. We evaluate the performance of HAR by using the ns-2 simulator and comparing with those of both DSR and AODV. The simulation results demonstrate that HAR achieves much higher delivery ratio and lower latency on various scenarios.