Title: Minimum distance clustering algorithm based on an improved differential evolution

Authors: Xiangyuan Yin; Zhihao Ling; Liping Guan; Feng Liang

Addresses: School of Information Science and Engineering, East China University of Science and Technology, Shanghai 200237, China; Faculty of Electronic and Information Engineering, Zhejiang Wanli University, Ningbo 315100, China ' School of Information Science and Engineering, East China University of Science and Technology, Shanghai 200237, China ' Zhejiang Wanli University, Ningbo 315100, China ' Zhejiang Wanli University, Ningbo 315100, China

Abstract: The goals of wireless sensor networks (WSNs) are to sense and collect data and to transmit the information to a sink. Because the sensor nodes are typically battery powered, the main challenges in WSNs are to optimise the energy consumption and to prolong the network lifetime. This paper proposes a centralised clustering algorithm termed the minimum distance clustering algorithm that is based on an improved differential evolution (MD-IDE). The new algorithm combines the advantages of simulated annealing and differential evolution to determine the cluster heads (CHs) for minimising the communication distance of the WSN. Many simulation results demonstrate that the performance of MD-IDE outperforms other well-known protocols, including the low-energy adaptive clustering hierarchy (LEACH) and LEACH-C algorithms, in the aspects of reducing the communication distance of the WSN for reducing energy consumption.

Keywords: clustering algorithms; IDE; improved differential evolution; cluster heads; minimum distance clustering; wireless sensor networks; WSNs; wireless networks; simulated annealing; simulation; energy consumption.

DOI: 10.1504/IJSNET.2014.059990

International Journal of Sensor Networks, 2014 Vol.15 No.1, pp.1 - 10

Received: 05 Sep 2013
Accepted: 09 Sep 2013

Published online: 23 Mar 2014 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article