A dynamic clustering construction for wireless sensor networks

Research in sensor networks has focused on development of energy efficient infrastructures. In this article, we introduce a new approach to organize sensor networks in clusters in order to reduce energy dissipation. Our contribution is an heuristic to define the number of clusters and also an efficient manner to choose cluster heads by minimizing the distance between cluster heads and its cluster nodes. Inspired from LEACH, a wellknown TDMA cluster-based sensor network architecture, we introduce a new method for building and maintaining clusters using the paradigm of a soccer team. In this work, a new algorithm called OH-K-means, based on the K-means algorithm, is used to find dynamically the number of clusters and form them, guaranteeing direct transmission between cluster heads and cluster nodes.