Hierarchical cluster based query-driven routing protocol for wireless sensor networks

5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Wireless Sensor Networks require robust wireless communication that are energy efficient and provide low latency. Various routing schemes have been presented in order to improve the life time of these wireless sensor networks and to overcome the energy constraint of sensor nodes. One of the effective schemes is based on clustering of sensor nodes and as well as to improve the network life time, decreases the communication latency and to reduce the energy consumption of whole Wireless Sensor Networks as much as possible. In this paper we include a brief survey of the state-of-the-art of various existing cluster based routing algorithms for sensor networks and present a new clustering algorithm named HCBQRP: Hierarchical Cluster Based Query-Driven Routing Protocol for Wireless Sensor Networks. The main goal of this routing protocol is to evenly distribute the energy load among the entire sensor nodes in the network so that there are no overly utilized sensor nodes that will run out of energy before the others. © 2012 Springer-Verlag GmbH Berlin Heidelberg.

Cite

CITATION STYLE

APA

Saha, S., & Chaki, R. (2012). Hierarchical cluster based query-driven routing protocol for wireless sensor networks. In Advances in Intelligent and Soft Computing (Vol. 132 AISC, pp. 657–667). Springer Verlag. https://doi.org/10.1007/978-3-642-27443-5_76

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free