A FAULT-TOLERANT HEURISTIC ROUTING ALGORITHM USING ANT COLONIES IN MESH NETWORKS

"Message Routing" is one of the important issues in computer networks. Routing with fault-tolerant has an important effect on the fast exchange of information in such networks. In this article, four types of ants are used for fault-tolerant routing in mesh networks. From these four types of ants, two types are for routing and the two other types are for fault-finding, discovering new routes and finding the shortest path dynamically. Finally, the proposed method is compared with fault-tolerant routing algorithm in mesh networks using the balanced ring. Simulation results showed that this method reacted quickly about network faults, meanwhile in each time step the data can choose the optimal path to reach their destination.