摘要：This paper proposes a new clustering scheme for wireless sensor networks, which efficiently balances the energy usage inter- and intra-clusters, by using the k - medoids method and the intra-cluster head update policy. Particularly, we propose a simple-but-effective routing tree algorithm to maintain a dynamic energy-efficient tree structure over all cluster heads, in order to further reduce the energy consumption for those heads to relay data to the sink. We also conduct simulations with realistic configurations to evaluate our design in terms of system lifetime, by comparing with LEACH. The experimental results show the efficiency and effectiveness of our work.
