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

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SOLTANI AZADEH; AKBARZADEH TOUTOUNCHI M.R.; NAGHIB ZADEH MAHMOUD

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, A- MUHANDISI -I BARQ Year:2007 | Volume:5 | Issue:1 Page(s): 41-46

Download Full-Text

Persian Verion

View:

1,147

Download:

Cites:

Information Journal Paper

Title

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 | Issue Writer Certificate

Keywords

ANTNETQ4

MOBILE AGENTQ4

NETWORK ROUTINGQ4

ASSISTANT ANTSQ4

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.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

SOLTANI, AZADEH, AKBARZADEH TOUTOUNCHI, M.R., & NAGHIB ZADEH, MAHMOUD. (2007). THE EFFECT OF UPDATING ROUTING TABLES OF NEIGH BORING NODES IN ANTNET ALGORITHM BY ASSISTANT AGENTS. NASHRIYYAH-I MUHANDESI-I BARQ VA MUHANDESI-I KAMPYUTAR-I IRAN (PERSIAN), 5(1), 41-46. SID. https://sid.ir/paper/53722/en

Vancouver: Copy

SOLTANI AZADEH, AKBARZADEH TOUTOUNCHI M.R., NAGHIB ZADEH MAHMOUD. THE EFFECT OF UPDATING ROUTING TABLES OF NEIGH BORING NODES IN ANTNET ALGORITHM BY ASSISTANT AGENTS. NASHRIYYAH-I MUHANDESI-I BARQ VA MUHANDESI-I KAMPYUTAR-I IRAN (PERSIAN)[Internet]. 2007;5(1):41-46. Available from: https://sid.ir/paper/53722/en

IEEE: Copy

AZADEH SOLTANI, M.R. AKBARZADEH TOUTOUNCHI, and MAHMOUD NAGHIB ZADEH, “THE EFFECT OF UPDATING ROUTING TABLES OF NEIGH BORING NODES IN ANTNET ALGORITHM BY ASSISTANT AGENTS,” NASHRIYYAH-I MUHANDESI-I BARQ VA MUHANDESI-I KAMPYUTAR-I IRAN (PERSIAN), vol. 5, no. 1, pp. 41–46, 2007, [Online]. Available: https://sid.ir/paper/53722/en

Related Journal Papers