Ant Routing Algorithm Parameters Optimization Based on Velocity over Mobile P2P Networks

Article Preview

Abstract:

Regarding ant routing algorithm parameters selection over mobile p2p networks, a basic ant routing algorithm is proposed and related parameters are analyzed. They are the power function of pheromone and evaporation time interval. They obey some parabolic functions of the velocity of nodes. A new method of ant routing parameters optimization based on an independent variable is proposed. Simulation results show that this algorithm selects the parameters effectively.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 403-408)

Pages:

1750-1754

Citation:

Online since:

November 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] B. C. Seet: Mobile Peer-to-Peer Computing for Next Generation Distribution Environments: Advancing Conceptual and Algorithmic Applications. Information Science, New York, (2009).

DOI: 10.4018/978-1-60566-715-7

Google Scholar

[2] O. Babaoqlu, G. Canright, A. Deutsch, G. A. Di Caro, F. Ducatelle, etc: Design Patterns from Biology for Distributed Computing. ACM Transactions on Adaptive and Autonomous Systems, 2006, 1(1), pp.1-40, (2006).

DOI: 10.1145/1152934.1152937

Google Scholar

[3] B. Kalaavathi, S. Madhavi, S. VijayaRagavan, K. Duraiswamy: Review of Ant Based Routing Protocols for MANET. Proceedings of International Conference on Computing, Communication and Networking (ICCCN 2008). The United States Virgin Islands, pp.1-9, (2008).

DOI: 10.1109/icccnet.2008.4787667

Google Scholar

[4] C.H. Wu, Z. Chen, M. Jing. The Research on Initialization of Ants System and Configuration of Parameters for Different TSP Problems in Ant Algorithm. Chinese Journal of Electronics, 2006, 34(8), pp.1530-1533, (2006) (in Chinese).

Google Scholar

[5] L. Q. Liu, Y. T. Dai, L. H. Wang. Ant Colony Algorithm Parameters Optimization. Computer Engineering, 2008, 34(11), pp.208-210, (2008) (in Chinese).

Google Scholar

[6] C. E. Perkins, E. M. Royer, S. R. Das, M. K. Marina: Performance Comparison of two On-demand Routing Protocols for Ad hoc Networks. IEEE Personal Communications Magazine special issue on Ad hoc Networking, 2001, 8(1): 16-28, (2001).

DOI: 10.1109/98.904895

Google Scholar

[7] L. Rosati, M. Berioli, G. Reali: On Ant Routing Algorithms in Ad hoc Networks with Critical Connectivity. Ad Hoc Networks, 2008, 6(6), pp.827-859, (2008).

DOI: 10.1016/j.adhoc.2007.07.003

Google Scholar

[8] M. Gunes, M. Kahmer, I. Bouazizi: ARA- the Ant-Colony Based Routing Algorithm for Manets. Proceedings of 2002 ICPP Workshop on Ad Hoc Networks (IWAHN 2002), Vancouver, Canada, pp.79-85, (2002).

DOI: 10.1109/icppw.2002.1039715

Google Scholar