A novel clustering algorithm for efficient energy saving in wireless sensor networks

Energy efficiency operations are essential in extending wireless sensor networks lifetime. Among the energy-saving-based solutions, clustering sensor nodes is an interesting alternative that features a reduction in energy consumption through: (i) aggregating data; (ii) controlling transmission power levels (iii) balancing load; (iv) putting redundant sensor nodes to sleep. This paper introduces a novel clustering algorithm that uses a distributed approach to set up non-overlapping clusters, while performing cluster heads rotation as well as carrying out other energy intensive tasks. Besides the transmission power and the energy level of each node, the proposed clustering algorithm considers nodes number that a cluster head can handle aiming at ideally partitioning the network. In fact, the nodes number constituting the cluster is confined around a pre-defined threshold, facilitating thus the optimal operation of the medium access control (MAC) protocol. Further, intending to reduce the computation and the communications cost as well as the messages exchanged, the proposed algorithm invokes the cluster formation only at the system activation, and delays as long as possible the cluster head turn over