Toward the imperialist competitive algorithm based routing method inward flying ad-hoc networks

An Ad-hoc network is one of the most complex topology implementations or connectivity of wireless networks. The advancement of technology in important systems, aeronautical communications and the micro-electric mechanical system has opened a new path to the newly developed evolving multi-UAV system with an internal connection called flying Ad-hoc networks (FANET). One of the biggest challenges in the FANET networks is the routing issue. Because the shape of these networks is constantly changing and nodes can leave the network or enter it, the use of common routing methods is not appropriate in these qualifications. Routing problems in this type of network can point to limited bandwidth, interference and power consumption. The high mobility of nodes in FANET networks causes intermittent changes in its topology compared to other Ad-hoc networks. Hence to do the routing, time is a critical factor and important. This means that routing operations should be carried out with maximum speed and in the least possible time. In order to cope with the above challenges, an optimization method is proposed using the Imperialist Competitive Algorithm (ICA) to find the shortest path between transmitter and receiver. The ICA, like other evolutionary algorithms, starts with a primitive population. The population is randomly generated and includes various solutions to the problem. To test the validity of the proposed method, a simulation was performed with MATLAB simulator. The evaluation factors are for the proposed method are the time of convergence, network life span, packet delivery rates, end-to-end delay and overhead. Simulation results showed that the proposed method has better performance than other previous methods.

کلیدواژه ها:

Flying Ad-hoc Network ، Imperialist Competitive Algorithm ، Ad-hoc Network ، Shortest Route