Ant Colony Optimization Routing Algorithm for P2P Networks

Hanafy Mahmoud Ali*
Assistant Professor, Department of Computers and Systems Engineering, Faculty of Engineering, Minia University, El Minia, Egypt.
Periodicity:October - December'2017
DOI : https://doi.org/10.26634/jwcn.6.3.14106

Abstract

Due to the importance of these information that move through the local and global networks , recent re­searches focused on improving the speed of communication networks with little attention to have the ability to secure the flow of the transmitted information through them. To tackle into the preceding points, some protocols have been developed in the literature to support efficiently the transfer of encrypted data. The efficiency of these protocols such as used in routing information raised the need to propose an intelligent technique that can merge some of the optimal protocols to gain both the high speed and security of the significant valuable transmitted data. In this article, Swarm intelligence follows the behaviour of cooperative ants in order to solve hard static and dynamic optimization problems using Ant Colony Optimization (ACO) technique and an artificial ant colony capable of finding the shortest path source to connected P2P nodes. The main goal of ACO-based search algorithm is that achieve high efficient in information retrieval & reduce load overhead.

Keywords

Ant Colony Optimization (ACO), AntNet Routing, NS-2, Ajent J, P2P.

How to Cite this Article?

Hanafy M. A. (2017). Ant Colony Optimization Routing Algorithm for P2P Networks. i-manager's Journal on Wireless Communication Networks, 6(3), 10-19. https://doi.org/10.26634/jwcn.6.3.14106

References

[1]. Ali, H. M. (2016). A Proposed ACO Routing In Peer-To- Peer Networks. i-manager's Journal on Communication Engineering and Systems, 6(1), 9.
[2]. Bonabeau, E., Dorigo, M., & Theraulaz, G. (2000). Inspiration for optimization from social insect behaviour. Nature, 406(6791), 39.
[3]. Chen, K., Shen, H., & Zhang, H. (2014). Leveraging social networks for P2P content-based file sharing in disconnected manets. IEEE Transactions on Mobile Computing, 13(2), 235-249.
[4]. Cuihua, Z. U. O., Ruixuan, L. I., & Zhengding, L. U. (2009). A Novel Approach to Improve the Security of P2P File-Sharing Systems. International Journal of Communications, Network and System Sciences, 2(03), 229.
[5]. Dhillon, S. S., & Mieghem, P. V. (2007). Performance analysis of the AntNet algorithm. Computer Networks, 51(8), 2104-2125.
[6]. Di Caro, G., & Dorigo, M. (1997). AntNet: A mobile agents approach to adaptive routing. Technical Report IRIDIA/97-12, IRIDIA, Université Libre de Bruxelles, Belgium.
[7]. Dorigo, M., & Di Caro, G. (1999). Ant colony optimization: a new meta-heuristic. In Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on (Vol. 2, pp. 1470-1477). IEEE.
[8]. Issariyakul, T., & Hossain, E. (2009). Transport Control Protocols Part 2–Transmission Control Protocol (TCP). In Introduction to Network Simulator NS2 (pp. 1-43). Springer, Boston, MA.
[9]. Nghiem, T. P., Maulana, K., Nguyen, K., Green, D., Waluyo, A. B., & Taniar, D. (2014). Peer-to-peer bichromatic reverse nearest neighbours in mobile adhoc networks. Journal of Parallel and Distributed Computing, 74(11), 3128-3140.
[10]. Schwartz, M., & Stern, T. (1980). Routing techniques used in computer communication networks. IEEE Transactions on Communications, 28(4), 539-552.
[11]. Shen, H., Li, Z., & Qiu, C. (2015a). A distributed threehop routing protocol to increase the capacity of hybrid wireless networks. IEEE Transactions on Mobile Computing, 14(10), 1975-1991.
[12]. Shen, H., Li, Z., & Yu, L. (2015b). A P2P-based marketguided distributed routing mechanism for highthroughput hybrid wireless networks. IEEE Transactions on Mobile Computing, 14(2), 245-260.
[13]. Sim, K. M., & Sun, W. H. (2003). Ant colony optimization for routing and load-balancing: survey and new directions. IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans, 33(5), 560-572.
[14]. Singh, B. P., & Garg, S. (2013). A Characteristics Study of Ant Colony Optimization Algorithms for Routing Problems. International Journal of Advanced Research in Computer Science and Software Engineering, 3(3).
[15]. Strobbe, M., Verstraete, V., Van Breusegem, E., Coppens, J., Pickavet, M., & Demeester, P. (2005). Implementation and evaluation of AntNet, a distributed shortest-path algorithm. In Telecommunications, 2005. advanced industrial conference on telecommunications/service assurance with partial and intermittent resources conference/e-learning on telecommunications workshop. aict/sapir/elete 2005. proceedings (pp. 320-325). IEEE.
[16]. Stutzbach, D., & Rejaie, R. (2006). Understanding churn in peer-to-peer networks. In Proceedings of the 6th ACM SIGCOMM conference on Internet measurement (pp. 189-202). ACM.
[17]. Stutzle, T., & Dorigo, M. (2002). A short convergence proof for a class of ant colony optimization algorithms. IEEE Transactions on evolutionary computation, 6(4), 358- 365.
[18]. Trajkovska, I., Rodriguez, P., Cervino, J., Harsh, P., & Salvachua, J. (2014). P2P incentive model for QoS based streaming systems. In Consumer Communications and Networking Conference (CCNC), 2014 IEEE 11th (pp. 281- 286). IEEE.
[19]. Xu, C., Jia, S., Zhong, L., Zhang, H., & Muntean, G. M. (2014). Ant-inspired mini-community-based solution for video-on-demand services in wireless mobile networks. IEEE Transactions on Broadcasting, 60(2), 322- 335.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.