Academic Journals Database
Disseminating quality controlled scientific knowledge

Developing Fault-Tolerant Heuristic Routing Algorithm Using Ant Colonies in Mesh Networks

ADD TO MY LIST
 
Author(s): Alireza Shams Shafigh | Hekmat Mohammadzadeh | Alireza Soleimany | Shahriyar Lotfi

Journal: Advances in Molecular Imaging
ISSN 2161-6728

Volume: 05;
Issue: 02;
Start page: 130;
Date: 2012;
Original page

Keywords: Fault-Tolerant | Mesh Networks | Ant Colony | Network Routing | Computer Networks

ABSTRACT
“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. This article will attempt to choose a path that is optimal in terms of fault tolerance to transmit messages from source to destination with faulty nodes in mesh networks. For this purpose we took advantage of the ant colony algorithm. Ant colony algorithm is one of the optimization algorithms .In this article, four types of ants is 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.
Save time & money - Smart Internet Solutions     

Tango Jona
Tangokurs Rapperswil-Jona