An entropy-based clustering algorithm for load balancing in WSN
by HyunSoo Cha; SeungWha Yoo; Taekkyeun Lee; Jihong Park; Ki-Hyung Kim
International Journal of Sensor Networks (IJSNET), Vol. 22, No. 3, 2016

Abstract: Energy efficiency and traffic load balancing are the important factors for wireless sensor network (WSN) designer. To achieve the efficient energy consumption and well-distributed load balancing, the clustering techniques can be an efficient solution. Furthermore, the several applications like real-time surveillance require the guaranteed delay in order to satisfy their delay requirements. The guaranteed delay can be one of the critical design issues for these WSN applications as well. In this paper, we propose a novel clustering algorithm to solve the energy and delay issues in WSN. Our algorithm uses an entropy-based cluster cost function, which takes into account the traffic load and the traffic variation. The simulation results show that our algorithm has longer lifetime and lower delay than low-energy adaptive clustering hierarchy (LEACH) and hybrid energy-efficient distributed clustering (HEED).

Online publication date: Tue, 08-Nov-2016

The full text of this article 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 Sensor Networks (IJSNET):
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