Paper Information

Journal:   NASHRIYYAH-I MUHANDESI-I BARQ VA MUHANDESI-I KAMPYUTAR-I IRAN (PERSIAN)   SPRING 2007 , Volume 5 , Number 1; Page(s) 41 To 46.
 
Paper: 

THE EFFECT OF UPDATING ROUTING TABLES OF NEIGH BORING NODES IN ANTNET ALGORITHM BY ASSISTANT AGENTS

 
 
Author(s):  SOLTANI AZADEH*, AKBARZADEH TOUTOUNCHI M.R., NAGHIB ZADEH MAHMOUD
 
* DEPT. OF ELECTRICAL ENGINEERING, BIRJAND UNIVERSITY, BIRJAND, I.R. IRAN
 
Abstract: 

Appropriate routing in data transfer is a challenging problem that can lead to improved performance of networks in terms of lower delay in delivery of packets and higher throughput. Considering the highly distributed nature of networks, several multi-agent based algorithms, and in particular ant colony based algorithms, have been suggested in recent years. However, considering the need for quick optimization and adaptation to network changes, improving the relative slow convergence of these algorithms remains an elusive challenge. Our goal here is to reduce the time needed for convergence and to accelerate the routing algorithm's response to network failures and/or changes by imitating pheromone propagation in natural ant colonies. More specifically, information exchange among neighboring nodes is facilitated by proposing a new type of ant (assistant ants) to the AntNet algorithm. This method is an extension of authors' earlier work by allowing intermediate nodes, in addition to destination nodes, to produce assistant ants. The resulting algorithm, the "modified AntNet," is then simulated via NS2 on NSF and NttNet network topologies. The network performance is evaluated under various conditions. Statistical analysis of results confirms that the new method can significantly reduce the average packet delivery time and rate of convergence to the optimal route when compared with standardAntNet.

 
Keyword(s): ANTNET, MOBILE AGENT, NETWORK ROUTING, ASSISTANT ANTS
 
References: 
  • ندارد
 
  Persian Abstract Yearly Visit 51
 
Latest on Blog
Enter SID Blog