EEK: An Energy Efficient K-Means-Like Routing Protocol for Wireless Sensor Networks

Hits: 3437
Research areas:
Year:
2013
Type of Publication:
Article
Keywords:
Cluster Head Selection, Energy-Efficiency, K-Means Algorithm, LEACH, Wireless Sensor Network
Authors:
Parisa Bazmi; Manijeh Keshtgary; Reza Javidan
Journal:
IJAIM
Volume:
2
Number:
3
Pages:
56-61
Month:
November
ISSN:
2320-5221
Abstract:
Wireless Sensor Networks (WSNs) consist of hundreds of low-power sensor nodes that capture real-world phenomena. Limited and generally irreplaceable power sources in sensor nodes cause sensor network protocols to focus on reducing sensors power consumption and prolonging network lifetime. LEACH is one of the most popular routing protocols which developed in 2000 for this purpose. In this paper a new method of cluster head selection is proposed to improve the LEACH protocol. K-means algorithm together with graph theory is used to minimize the distance between nodes and Cluster Heads (CHs) and also the concept of eccentricity in graph theory is used to find the center of each cluster for new CH selection. It minimizes the energy consumed by each sensor for the transmission of their data to CH. The proposed algorithm is compared with LEACH in parameters including remaining energy of each round and network lifetime. Computer simulation reveals better behavior of the proposed algorithm in these parameters than LEACH.
Full text: IJAIM_191_Final.pdf

Indexed By