TY - JOUR
T1 - Increasing network lifetime by balancing node energy consumption in heterogeneous sensor networks
AU - Du, Xiaojiang
AU - Xiao, Yang
AU - Dai, Fei
PY - 2008/1
Y1 - 2008/1
N2 - Sensor nodes are powered by battery and have severe energy constraints. The typical many-to-one traffic pattern causes uneven energy consumption among sensor nodes, that is, sensor nodes near the base station or a cluster head have much heavier traffic burden and run out of power much faster than other nodes. The uneven node energy dissipation dramatically reduces sensor network lifetime. In a previous work, we presented the chessboard clustering scheme to increase network lifetime by balancing node energy consumption. To achieve good performance and scalability, we propose to form a heterogeneous sensor network by deploying a few powerful high-end sensors in addition to a large number of low-end sensors. In this paper, we design an efficient routing protocol based on the chessboard clustering scheme, and we compute the minimum node density for satisfying a given lifetime constraint. Simulation experiments show that the chessboard clustering-based routing protocol balances node energy consumption very well and dramatically increases network lifetime, and it performs much better than two other clustering-based schemes.
AB - Sensor nodes are powered by battery and have severe energy constraints. The typical many-to-one traffic pattern causes uneven energy consumption among sensor nodes, that is, sensor nodes near the base station or a cluster head have much heavier traffic burden and run out of power much faster than other nodes. The uneven node energy dissipation dramatically reduces sensor network lifetime. In a previous work, we presented the chessboard clustering scheme to increase network lifetime by balancing node energy consumption. To achieve good performance and scalability, we propose to form a heterogeneous sensor network by deploying a few powerful high-end sensors in addition to a large number of low-end sensors. In this paper, we design an efficient routing protocol based on the chessboard clustering scheme, and we compute the minimum node density for satisfying a given lifetime constraint. Simulation experiments show that the chessboard clustering-based routing protocol balances node energy consumption very well and dramatically increases network lifetime, and it performs much better than two other clustering-based schemes.
KW - Cluster
KW - Energy consumption
KW - Heterogeneous sensor networks
KW - Routing protocol
UR - http://www.scopus.com/inward/record.url?scp=38149119063&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38149119063&partnerID=8YFLogxK
U2 - 10.1002/wcm.452
DO - 10.1002/wcm.452
M3 - Article
AN - SCOPUS:38149119063
SN - 1530-8669
VL - 8
SP - 125
EP - 136
JO - Wireless Communications and Mobile Computing
JF - Wireless Communications and Mobile Computing
IS - 1
ER -