Research of AODV Protocol Based on Ant Colony Algorithm

Article Preview

Abstract:

in order to reduce the congestion in AODV protocol and decrease the time taking to find the route, CA-AODV protocol was applied to a routing selection algorithm with cognitive ability of an ant colony algorithm. The algorithm uses probability routing and diffusion of pheromone improving routing search capabilities, around development send congested nodes, to improve the route algorithm performance, enhance the adaptability of the algorithm. By comparing the improved routing algorithm With the original AODV protocol, the simulation results show that, the routing algorithm reduces the end-to-end delay and network congestion.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2790-2794

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Komali R S, Thomas R W, DaSilva L A, et al. The price of ignorance: Distributed topology control in cognitive networks. IEEE Transactions on Wireless Communications. 2010, 8, 9(4).

DOI: 10.1109/twc.2010.04.090400

Google Scholar

[2] K.R. Chowdhury, M.D. Felice. A routing protocol for mobile cognitive radio ad-hoc networks. Computer Communication, 2009: 1983-(1997).

DOI: 10.1016/j.comcom.2009.06.011

Google Scholar

[3] Christos Anagnostopoulos, Stathes Hadjiefthymiades. Delay-tolerant delivery of quality information in ad hoc networks. J. Parallel Distrib Comput, , 2011: 974–987.

DOI: 10.1016/j.jpdc.2010.11.007

Google Scholar

[4] Xingzhen Bai, Shu Li, Changjun Jianga, Juan Xua, ChengWanga, Lina Hana. Capacity and delay in mobile cognitive networks with random way-point mobility model. Int. J. Electron. Commun., 2011: 288-295.

Google Scholar

[5] Thomas R W, DaSilva L A, Marathe M V, et al. Critical design decisions for cognitive networks. Proceeding of IEEE ICC (2007).

Google Scholar