Presentation of an Optimum Routing Template in Wireless Sensor Networks (WSNs) Based on Imperialist Competitive Algorithm

In recent years, regarding to basic progresses in design of integrated orbits, wireless telecommunication and designing sensor a special type of wireless network named wireless sensor networks (WSNs) has been considered by researchers and different industries. One of the major challenges in wireless sensor networks is routing to send data on the network. In this paper was presented the method to find optimized routes by using imperialist competitive algorithm. In the method, initiallyin routing phase, we model the state of the network based on a graph, then according to the possibleroutes we routing. The target functions in the algorithm are to find the lowest available route between sender and recipient data. Two important operators in the proposed method are assimilation and revolution. In the paper, assimilation rate has been considered 90% and revolution rate is 50% and themaximum iteration in algorithm is considered 1000 in the base mode. According to the comparisons were done, the proposed method does the operation routing more efficient compared to methods based on genetic algorithm (GA).

Keywords:

Routing , Wireless Sensor , Network , Imperialist Competition