Clustering and optimal routing in wireless sensor networks using harmony search algorithm

One of the main challenges in sensor networks is the energy used by these sensors and the most important reason for the energy consumption by sensors is transferring data, which has a direct relationship with distance. Researchers have proposed different algorithms so as to reduce the sonsors´ energy consumption. One of these ways is optimal route-finding and reduction of the length of typical knots to central knots. One way to reduce the energy consumption is to cluster and organize the sensors. To do so, in the beginning, some sensors are randomly considered as the head and then these heads will recruit members considering their distance to other sensors. The number of members in clusters will be almost similar in order to restore balance in the number if the members. Harmonic algorithm will help us have a thorough search on the space of the issue so that we can overcome the fundamental challenges in clustering the networks of wireless sensors through the performance of harmonic algorithm and change in the role of the head of a cluster.