I am currently working on a project that is based on optimizing cluster head (CH) selection for energy-efficient wireless sensor networks (WSNs) using evolutionary search techniques. For the purpose of comparison with classical baseline algorithms in this subject, I also want to compare my results with LEACH and LEACH-C. I have successfully implemented LEACH algorithm. However, I am not sure how to implement the LEACH-C algorithm.
This is the original paper that LEACH-C is proposed: Heinzelman, W. B., Chandrakasan, A. P., & Balakrishnan, H. (2002). An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on wireless communications, 1(4), 660-670.
In this paper, it was mentioned that the Simulated Annealing (SA) algorithm was used to determine clusters. It was also stated that SA selects among nodes having energy above the average energy. However, I cannot see any detail about how the neighborhood structures and the algorithm parameters were determined. Besides, I saw many other papers using LEACH-C in their experimental work, however, I could not find any guidelines for how they were implemented as well.
My question is that is there a standard to implement a LEACH-C algorithm? Thank you for any help you can provide.
LEACH-C uses the centralized clustering
algorithm for achieving a better distribution of
nodes and similar sizes of clusters. During the set- up
phase, each sensor sends data about its current position
and the available energy to the BS. BS calculates
the average energy of the entire network. The sensors
with energy below this value cannot be CH in the
next round. In the steady state phase it uses the same
algorithm as in LEACH.
Goran Popovic thanks for the response. But it is still not clear for me how we determine the CHs among nodes that have energy above the average of the entire network. I mean, in the setup phase, which algorithm do we use for CH selection and formation? Is there a standard way to do this or is it left for the algorithm designer?
I haven’t been able to see the code but I’m pretty sure the way to select CH within a cluster is left to the code designers. BS should choose the best CH according to some of the criteria. We can play with these criteria when simulating.
- Badges
- Science topic