A new approach for multi-sink environments in WSNs
IM'09 Proceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management
Multiple-metric hybrid routing protocol for heterogeneous wireless access networks
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Adjustable convergecast tree protocol for wireless sensor networks
Computer Communications
Tree-based anycast for wireless sensor/actuator networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
HMRP: hierarchy-based multipath routing protocol for wireless sensor networks
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Routing protocol for anycast communications in a wireless sensor network
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
| Hi-index | 0.00 |
In this paper, we present Hierarchy-Based Any-cast Routing (HAR), a routing protocol for collecting data over multi-hop, 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.