The existing wireless sensor network clustering routing algorithms commonly have the problems of unbalanced network energy consumption and uneven clustering. A new clustering algorithm based on ACO and K-medoids optimization methods is proposed in this paper. The optimized K-medoids clustering algorithm can cluster sensor nodes effectively to solve the problem of uneven clustering. At the same time based on the improved ACO algorithm, this new algorithm can fully consider nodal residual energy either when cluster heads are replaced or in time of route selection and data transmission between cluster heads. Compared with other routing algorithms, this new algorithm has better performance and good capacity of balancing network energy consumption and lengthening network life cycle as result verified by simulation experiments.
展开▼
