Farzad Omidi-Kashani^1,, Ouadoudi Zytoune^2,, Driss Aboutajdine³, Seyed Mohammad Ata Sharifi Dalooei⁴

A Wireless sensor network (WSN) is a collection of tiny sensor nodes that are deployed to monitor the environment. These sensor nodes have limited capabilities, especially the energy reserve and processing ability. So, the routing protocols design for this kind of networks is a crucial challenge. Because these routing protocols should be simple, energy-efficient, and robust to deal with a very large number of nodes, they should also be self-configurable to node failures and changes of the network topology dynamically. The most proposed routing techniques organize the network in clusters where the sensing area is divided into many sub-areas. This paper presents a new algorithm for clustering in WSN based on the node residual energy compared to the network one and allowing a better partitioning of the network area which enhance the data distortion at the sink by using the best data coding rate at the cluster head. The simulation results show that this algorithm allows network stability extension compared to the most known clustering algorithm.

wireless sensor networks, energy efficiency, clustering-based algorithm, data aggregation, data compression