A maximum degree and negotiation strategy based clustering algorithm for wireless sensor networks

Clustering algorithm is one of the hotspots for studying routing protocol in wireless sensor networks, which can help to enlarge the network topology and utilize the capacity of channel efficiently. In this paper, we present a maximum degree and negotiation strategy based clustering algorithm to solve the cluster overlapping problem. It selects candidate according to maximum degree and determines the Cluster-Head according to the negotiation strategy. The negotiation strategy can also be applied to the weighted clustering algorithm. The simulation results demonstrate that the proposed algorithms can remove the cluster overlapping phenomenon of the original algorithms and prolong the lifetime of the wireless sensor networks.