A Combined Method for Dynamic Routing in Mobile Ad-Hoc Networks

Wireless sensor networks are a large number of sensor nodes with limited energy in a scattered geographically limited area. Due to limited resources in wireless sensor networks, increasing the lifetime of the networks by reducing energy consumption is always considered. More nodes to send data to the central station energy consumption. Sequential routing based on clustering, this responsibility falls on the head, and this increases the energy consumption of cluster heads. In recent years later all the energy of cluster heads, routing protocols and a lot of clustering is proposed. The purpose of this study, the combination of clustering and routing in order to extend the lifetime of this type of network. For clustering of genetic algorithm with fixed and harmony search algorithm is used for routing. Customize search algorithm for routing in harmony, three criteria neighborhood, reducing energy consumption and proper distribution of energy consumption is taken into account. Harmony algorithm is proposed to establish a proper balance between the criteria listed will generate more efficient routes. Finally change the routing cluster heads in each round will be balancing energy consumption between nodes per cluster. The results of the tests show the superiority of 2.14% proposed increase in messaging as well as 24.84% Lifetime network protocol is DEEC.