Restructured Ant Colony Optimization Routing Protocol for Next Generation Network
AbstractWireless network is a major research domain in the past few decades. Wireless network evolves in many forms like cellular communication, ad hoc network, vehicular network, mesh network and sensor network. Next generation network is a recent cellular communication which provides heterogeneous connectivity on cellular communication. The routing in next generation wireless networks is an important research issue which requires many constraints than wired networks. Hence, Ant Colony Optimization (ACO) is applied in this paper for routing in heterogeneous next generation wireless network. The ACO is a swarm intelligence technique which applied for many engineering applications. ACO is an optimal technique for routing and travelling salesman problem. This paper proposed Restructured ACO which contains additional data structures for reducing packet loss and latency. Therefore, the proposed RACO provides higher throughput.
 Chandramohan, B., Prasanna Kumar P, Anantha Venkata Ramana, Sridharan D (2007); Real time routing protocol (Antnet) using ACO and performance comparison with OSPF, IEEE Int. Conf. on Emerging Trends in High Performance Architecture Algorithms and Computing, 47-53.
 Chandramohan, B. and Baskaran, R.(2010); Improving Network Performance using ACO Based Redundant Link Avoidance Algorithm, International Journal of Computer Science Issues, 7(3): 27-35.
 Chandramohan, B. and Baskaran, R. (2011); Survey on Recent Research and Implementation of Ant Colony Optimization in Various Engineering Applications, International Journal in Computational Intelligent Systems, 4(4): 566-582.
 Dorigo, M., Maniezzo, V. and Colorni, A. (1996); Ant System: Optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics, Part B, 26(1): 29-41.
 Dorigo, M. and Luca, M.G.(1997); Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem, IEEE Transactions on Evolutionary Computation, 1(1): 53-66.
 Dorigo, M. and Stutzle, T. (2004); Ant Colony Optimization, MIT Press, Cambrige MA.
 Hsin-Yun, L., Hao-Hsi, T., Meng-Cong, Z. and Pei-Ying, L. (2010); Decision support for the maintenance management of green areas, Expert Systems with Applications, 37: 4479-4487.
 Kwang, M. S. and Weng, H.S. (2003); Ant Colony Optimization for Routing and Load- Balancing: Survey and New Directions, IEEE Transactions on Systems, Man, and Cybernetics, 33(5): 60-572.
 Li-Ning, X., Ying-Wu, C., Peng, W., Qing-Song, Z. and Jian, X.(2010); A Knowledge- Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems, Applied Soft Computing, 10: 888-896.
 NS2, available online at: www.isi.edu/nsnam/ns/
 Osama, H.H., Tarek, N.S. and Myung, J.L. (2005); Probability Routing Algorithm for Mobile Ad Hoc Networks Resources Management, IEEE Journal on Selected Areas in Communications, 23(12): 2248-2259.
 Wang Chen, Yan-jun, S., Hong-fei, T., Xiao-ping, L. and Li-chen, H. (2010); An efficient hybrid algorithm for resource-constrained project scheduling, Information Sciences, 180: 1031-1039.
 Wei-Neng, C., Jun Zhang, Henry Shu-Hung, C., Rui-Zhang, H. and Ou Liu (2010); Optimizing Discounted Cash Flows in Project Scheduling An Ant Colony Optimization Approach, IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, DOI:10.1109/TSMCC.2009.2027335, 40(1): 64-77.
 Xiao-ming, Y., Sheng, L. and Yu-ming, W. (2010); Quantum Dynamic Mechanism-based Parallel Ant Colony Optimization Algorithm, International Journal of Computational Intelligence Systems, Suppl. 1, 101-113.
 Zhiding, Y., Oscar, C.A., Ruobing, Z., Weiyu, Y. and Jing, T. (2010); An adaptive unsupervised approach toward pixel clustering and color image segmentation, Pattern Recognition, 43: 1889-1906.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.