The full text of this article

 

Energy efficient Chessboard Clustering and routing in heterogeneous sensor networks
by Xiaojiang Du, Yang Xiao
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 1, No. 2, 2006

 

Abstract: 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.

 

is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

 
Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

 
Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

 

    Username:        Password:         

Forgotten your password?


 
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

 
If you still need assistance, please email subs@inderscience.com