TY - JOUR
T1 - Energy-efficient chain formation algorithm for data gathering in wireless sensor networks
AU - Lim, Se Jung
AU - Park, Myong Soon
N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84867340827&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867340827&partnerID=8YFLogxK
U2 - 10.1155/2012/843413
DO - 10.1155/2012/843413
M3 - Article
AN - SCOPUS:84867340827
SN - 1550-1329
VL - 2012
JO - International Journal of Distributed Sensor Networks
JF - International Journal of Distributed Sensor Networks
M1 - 843413
ER -