Energy-efficient chain formation algorithm for data gathering in wireless sensor networks

24Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In wireless sensor networks, since sensor nodes are distributed in inaccessible regions for data gathering, they need to be operated during an assigned time without battery recharging and relocation. For this reason, there has been abundant research on improving energy efficiency. PEGASIS, one of the well-known chain-based routing protocols for improving energy efficiency, builds a chain based on the greedy algorithm. However, due to long communication distance of some sensor nodes in a chain formed by the greedy algorithm, unbalanced energy consumption of sensor nodes occurs. Eventually, the network lifetime from this cause decreases. We propose energy efficient chain formation (EECF) algorithm to resolve the unbalanced energy consumption problem caused by long-distance data transmission of some nodes in a chain formed by the greedy algorithm. The simulation results are used to verify the energy consumption balance of sensor nodes and the whole network lifetime. In simulation, it is shown that EECF produces better results than the greedy algorithm. © 2012 Se-Jung Lim and Myong-Soon Park.

Cite

CITATION STYLE

APA

Lim, S. J., & Park, M. S. (2012). Energy-efficient chain formation algorithm for data gathering in wireless sensor networks. International Journal of Distributed Sensor Networks, 2012. https://doi.org/10.1155/2012/843413

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