NODIC: a novel distributed clustering routing protocol in WSNs by using a time-sharing approach for CH election

Due to the battery limitations, energy-efficient routing is one of the most important issues in WSNs. In this paper, a novel distributed clustering routing protocol (NODIC) is proposed. The algorithm makes three main contributions to literature. Firstly, a time-sharing approach for CH election is suggested differently from the studies in literature. The most effective parameters are combined in a time-sharing approach on the purpose of gaining the highest performance. Secondly, easy implementation and self-reliant decision of probabilistic schemes and the guarantee that iterative schemes issue about selecting the desired CHs are pieced together without using any of them. Finally, since CH decision is performed locally and dynamically, the clusters can make their decisions independently from the others. NODIC is compared with three common corresponding approaches in literature for various values of the number of nodes and under different traffic distributions. The algorithms are evaluated by using the number of living nodes and total energy consumptions per round. The results show that NODIC performs considerably better than the other approaches for all number of nodes and under all distributions up to 79 %.