A Novel Cluster Algorithm for Wireless Sensor Networks Based on Edge Centrality and Reference Nodes
Special Issues Editor (Nottingham Tent University, United Kingdom (Great Britain))
The Low Energy Clustering Hierarchy routing protocol, often termed LEACH, does not apply to large-scale networks where energy consumption is uneven. We propose a cluster-head selection algorithm based on edge-Centrality,- often called 'between-ness' but here the more correct English word Centrality will be used throughout. First the whole network is divided into several clusters by edge Centrality. At each cluster, a node which has the largest residual energy is selected as the reference node. A cluster head can be rotated periodically according to the distances between 'base station and node' and between 'reference node and node within cluster'. The algorithm forms a reasonable and stable cluster structure based on the structure of the network itself. Then a cluster head is selected at each cluster. The algorithm takes as factors node energy and location in selecting cluster heads so that the energy consumption of the whole network is relatively balanced. Matlab simulation shows the new algorithm extends the life cycle of the network by 20% compared to LEACH protocol.
Journal: International Journal of Simulation: Systems, Science & Technology, IJSSST V17
Published: Jul 14, 2016