Minimum distance clustering algorithm based on an improved differential evolution

Xiangyuan Yin

doi:10.1504/IJSNET.2014.059990

Minimum distance clustering algorithm based on an improved differential evolution

2014-01-01

5

PRE

AI

DOI：10.1504/IJSNET.2014.059990

原文链接

摘要

En 中文

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.

Keyword:

clustering algorithm

IDE

improved differential evolution

cluster head

CH

MD-IDE

Minimum distance clustering algorithm based on an improved differential evolution

摘要

AI总结

期刊

机构

引用论文