Influence of crossover on the behavior of Differential Evolution Algorithms
Applied Soft Computing
Mathematics and Computers in Simulation
Performance modeling of the LEACH protocol for mobile wireless sensor networks
Journal of Parallel and Distributed Computing
Energy-efficient collaborative tracking in wireless sensor networks
International Journal of Sensor Networks
Arranging cluster sizes and transmission ranges for wireless sensor networks
Information Sciences: an International Journal
Improving response surface methodology by using artificial neural network and simulated annealing
Expert Systems with Applications: An International Journal
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
An energy-efficient adaptive clustering algorithm with load balancing for wireless sensor network
International Journal of Sensor Networks
Hi-index | 0.00 |
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.