TY - GEN
T1 - Lifetime increase for wireless sensor networks using cluster-based routing
AU - Khamfroush, Hana
AU - Saadat, Reza
AU - Khademzadeh, Ahmad
AU - Khamfroush, Keyhan
PY - 2009
Y1 - 2009
N2 - In this paper, we propose a new routing algorithm which can increase the network lifetime. We assume that each node can estimate its residual energy and then a new clustering method will be proposed for increase of network lifetime. This assumption is similar to many other proposed routing algorithms for WSN and is a possible assumption. In the new method, the predefined number of nodes which have the maximum residual energy are selected as cluster heads (CHs) first and then the members of each clusters are determined based on the distances between the node and the cluster head and also between the cluster head and BS. In fact, the selection of each cluster member is done based on the maximization of the residual energy for nodes which build a path to BS unlike the traditional methods that build a path with minimum length to the BS. All cluster heads use a multi-hop chain structure for transmission of data packets from themselves to BS. We compare our method with ERA routing algorithm in terms of network life-time by simulation.
AB - In this paper, we propose a new routing algorithm which can increase the network lifetime. We assume that each node can estimate its residual energy and then a new clustering method will be proposed for increase of network lifetime. This assumption is similar to many other proposed routing algorithms for WSN and is a possible assumption. In the new method, the predefined number of nodes which have the maximum residual energy are selected as cluster heads (CHs) first and then the members of each clusters are determined based on the distances between the node and the cluster head and also between the cluster head and BS. In fact, the selection of each cluster member is done based on the maximization of the residual energy for nodes which build a path to BS unlike the traditional methods that build a path with minimum length to the BS. All cluster heads use a multi-hop chain structure for transmission of data packets from themselves to BS. We compare our method with ERA routing algorithm in terms of network life-time by simulation.
KW - Network lifetime
KW - Wireless Sensor Networks
UR - http://www.scopus.com/inward/record.url?scp=70449561025&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449561025&partnerID=8YFLogxK
U2 - 10.1109/IACSIT-SC.2009.99
DO - 10.1109/IACSIT-SC.2009.99
M3 - Conference contribution
AN - SCOPUS:70449561025
SN - 9780769536538
T3 - 2009 International Association of Computer Science and Information Technology - Spring Conference, IACSIT-SC 2009
SP - 14
EP - 18
BT - 2009 International Association of Computer Science and Information Technology - Spring Conference, IACSIT-SC 2009
T2 - 2009 International Association of Computer Science and Information Technology - Spring Conference, IACSIT-SC 2009
Y2 - 17 April 2009 through 20 April 2009
ER -