TY - JOUR
T1 - Energy efficient Chessboard Clustering and routing in heterogeneous sensor networks
AU - Du, Xiaojiang
AU - Xiao, Yang
PY - 2006
Y1 - 2006
N2 - Sensor nodes have severe energy constraints. The typical many-to-one traffic pattern in sensor networks causes uneven energy consumption among sensor nodes, i.e., sensor nodes near a sink or cluster head have much heavier traffic burden and run out of power much faster than other nodes. This can dramatically reduce sensor network lifetime. In this paper, we adopt a heterogeneous sensor network model and propose a novel Chessboard Clustering (CC) scheme. We also design an efficient routing protocol based on the CC scheme. Extensive simulations show that our scheme balances node energy consumption very well and significantly increases network lifetime.
AB - Sensor nodes have severe energy constraints. The typical many-to-one traffic pattern in sensor networks causes uneven energy consumption among sensor nodes, i.e., sensor nodes near a sink or cluster head have much heavier traffic burden and run out of power much faster than other nodes. This can dramatically reduce sensor network lifetime. In this paper, we adopt a heterogeneous sensor network model and propose a novel Chessboard Clustering (CC) scheme. We also design an efficient routing protocol based on the CC scheme. Extensive simulations show that our scheme balances node energy consumption very well and significantly increases network lifetime.
KW - Clustering; routing
KW - Energy efficiency
KW - Heterogeneous sensor networks
UR - http://www.scopus.com/inward/record.url?scp=35448987469&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=35448987469&partnerID=8YFLogxK
U2 - 10.1504/IJWMC.2006.012471
DO - 10.1504/IJWMC.2006.012471
M3 - Article
AN - SCOPUS:35448987469
SN - 1741-1084
VL - 1
SP - 121
EP - 130
JO - International Journal of Wireless and Mobile Computing
JF - International Journal of Wireless and Mobile Computing
IS - 2
ER -