An efficient grid-based data gathering scheme in wireless sensor networks

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

Abstract

Data gathering is an important operation in wireless sensor networks. Due to the limited battery power, sensor nodes consume significant energy and drain out of it quickly if each node transmits its sensed data directly to a distant base station, even though the delay time is minimized in a round of communication. Hence, there is a trade-off between minimizing both of the energy consumed by sensor nodes and the delay time, then the overall cost is defined as the energy x delay cost. In this paper, we propose an Efficient Grid-based Data Gathering (EGDG) scheme which adopts a hierarchical grid structure and constructs cycles by connecting heads in each order of the hierarchy. Data transmissions move toward a leader from two starter nodes simultaneously in each cycle. The objective of EGDG is to achieve a better result for the energy x delay cost comparing to other schemes, and also to accomplish significant coverage-preserving at the same time. Simulation results show that EGDG outperforms than LEACH and PEGASIS in terms of rounds, the energy x delay cost and coverage-preserving. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Hwang, S. F., Lu, K. H., Chang, H. N., & Dow, C. R. (2007). An efficient grid-based data gathering scheme in wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4611 LNCS, pp. 545–556). Springer Verlag. https://doi.org/10.1007/978-3-540-73549-6_54

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