|
Abstract
|
Article Information:
More Improvement by Helping Ant to Fault-Tolerant Heuristic Routing Algorithm in Mesh Networks
Alireza Soleimany and Somayeh Azmoodeh
Corresponding Author: Alireza Soleimany
Submitted: August 29, 2012
Accepted: October 22, 2012
Published: June 20, 2013 |
Abstract:
|
Routing with fault-tolerant mechanisms has a crucial effect on the fast exchange of information in variety of networks including mesh networks. This study attempts to choose an optimal path in terms of fault tolerance to transmit messages from source to destination while taking into account faulty nodes in such mesh networks. In this study, we take advantage of ant colony optimization algorithm to propose Adaptive Heuristic Routing algorithms to this problem. We use color pheromone ants to overcome problem of fail-recover behavior of network components. The proposed method is compared with fault-tolerant routing algorithm in mesh networks using the balanced ring. Simulation results depict that this method reacted quickly in terms of network faults, meanwhile in each time step the data can choose the optimal path to reach their destination. In this study, we improve performance of the proposed method using update ants to inform other nodes about the discovered shortest path. Simulation results show that the proposed method dramaticcaly increase efficiency of routing mechanism in mesh networks.
Key words: Ant colony, computer networks, fault-tolerant, mesh networks, network routing, update ant ,
|
|
Abstract
|
PDF
|
HTML |
|
Cite this Reference:
Alireza Soleimany and Somayeh Azmoodeh, . More Improvement by Helping Ant to Fault-Tolerant Heuristic Routing Algorithm in Mesh Networks. Research Journal of Applied Sciences, Engineering and Technology, (04): 622-630.
|
|
|
|
 |
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
 |
| Information |
|
|
|
|
| Sales & Services |
|
|
|
|
