A GAF algorithm of dislocated grid for wireless sensor network

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

Abstract

For the problem of limited energy in wireless sensor networks, a GAF algorithm of Dislocated Grid (GAFDG) is proposed, based on the traditional GAF algorithm of Aligned Grid (GAFAG). The algorithm divides monitoring areas into several dislocated grids, each node belong to corresponding grid according to its coordinate and the side length of grid. The nodes within the same grid compose a cluster. Selecting a node as cluster head, whose residual energy above the average residual energy and close to intra-cluster nodes' center. The backbone network of wireless sensor networks is composed by each cluster head, and forwarding information according to GeRaF routing protocol. Theoretically proofing the single-hop coverage area of GAFDG is increased by 12% than GAFAG. Emulational results show that both energy consumption and network lifetime Of GAFDG are better than GAFAG. © 2012 Springer-Verlag GmbH.

Cite

CITATION STYLE

APA

Chen, Z. J., Ouyang, Y. L., & Liu, S. Q. (2012). A GAF algorithm of dislocated grid for wireless sensor network. In Advances in Intelligent and Soft Computing (Vol. 163 AISC, pp. 721–728). https://doi.org/10.1007/978-3-642-29458-7_101

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