Aiming at the problems of uneven clustering and unbalanced overall network energy consumption

the existing clustering routing algorithms commonly have

improved K-ACO clustering routing algorithm is proposed.K-medoids clustering algorithm can cluster random distributed sensor nodes

which solves shortcoming of uneven clustering.Combined with improved ant colony algorithm

when replace the cluster head node and select the next hop node for data transmission between the cluster head nodes

this algorithm can consider node residual energy and balance network energy consumption.Simulation results show K-ACO algorithm has better performance and longer network life cycle compared with other routing algorithms.