A grid-based clustering routing protocol for wireless sensor networks

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

Abstract

After sensors are deployed, it cannot be recharged in Wireless sensor networks. Therefore, the energy of sensors is limited. In this situation, how to design a routing algorithm is very important. An effective algorithm can reduce energy consumption and prolong network lifetime. In this proposal, we proposed a routing protocol. First, this algorithm divides networks into several units and those units would be regarded as clusters. Second, it uses conditions of method we proposed to generate some clusters by combining. According to remaining energy of nodes, it will execute cluster-head selection. And it can reduce the energy consumption of nodes and use energy effectively to sense by clustering. Finally, we compare the methods we proposed with the others by simulation, and the conclusion proves the method we proposed can save more power to make network lifetime longer than other ways.

Cite

CITATION STYLE

APA

Wang, Y. H., Lin, Y. W., Lin, Y. Y., & Chang, H. M. (2013). A grid-based clustering routing protocol for wireless sensor networks. Smart Innovation, Systems and Technologies, 20, 491–499. https://doi.org/10.1007/978-3-642-35452-6_50

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