RETRACTED: Neural Network Optimal Routing Algorithm Based on Genetic Ant Colony in IPv6 Environment (Retracted Article)

被引:8
作者
Ni, Weichuan [1 ]
Xu, Zhiming [1 ]
Zou, Jiajun [1 ]
Wan, Zhiping [1 ]
Zhao, Xiaolei [1 ]
机构
[1] Guangzhou Xinhua Univ, Guangzhou, Peoples R China
关键词
MOBILE IPV6; SELECTION; OPTIMIZATION;
D O I
10.1155/2021/3115704
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
The traditional IPv6 routing algorithm has problems such as network congestion, excessive energy consumption of nodes, and shortening the life cycle of the network. In response to this phenomenon, we proposed a routing optimization algorithm based on genetic ant colony in IPv6 environment. The algorithm analyzes and studies the genetic algorithm and the ant colony algorithm systematically. We use neural network to build the initial model and combine the constraints of QoS routing. We effectively integrate the genetic algorithm and ant colony algorithm that maximize their respective advantages and apply them to the IPv6 network. At the same time, in order to avoid the accumulation of a lot of pheromones by the ant colony algorithm in the later stage of the network, we have introduced an anticongestion reward and punishment mechanism. By comparing the search path with the optimal path, rewards and punishments are based on whether the network path is smooth or not. Finally, it is judged whether the result meets the condition, and the optimal solution obtained is passed to the BP neural network for training; otherwise, iterative iterations are required until the optimal solution is satisfied. The experimental results show that the algorithm can effectively adapt to the IPv6 routing requirements and can effectively solve the user's needs for network service quality, network performance, and other aspects.
引用
收藏
页数:13
相关论文
共 30 条
[1]   Optimal reactive power dispatch using ant colony optimization algorithm [J].
Abou El-Ela, A. A. ;
Kinawy, A. M. ;
El-Sehiemy, R. A. ;
Mouwafi, M. T. .
ELECTRICAL ENGINEERING, 2011, 93 (02) :103-116
[2]   A Neural Network-Based Trust Management System for Edge Devices in Peer-to-Peer Networks [J].
Alhussain, Alanoud ;
Kurdi, Heba ;
Altoaimy, Lina .
CMC-COMPUTERS MATERIALS & CONTINUA, 2019, 59 (03) :805-815
[3]   NEURAL NETWORKS FOR SHORTEST-PATH COMPUTATION AND ROUTING IN COMPUTER-NETWORKS [J].
ALI, MKM ;
KAMOUN, F .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1993, 4 (06) :941-954
[4]   TIME-COMPLEXITY OF A PATH FORMULATED OPTIMAL ROUTING ALGORITHM [J].
ANTONIO, JK ;
TSAI, WK ;
HUANG, GM .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1994, 39 (02) :385-391
[5]  
Bharath N, 1969, MOL PHARMACOL, V5, P65
[6]  
Dong J.M., 2005, J NW U NATURAL SCI E, V35, P1392
[7]   Deploygin IPv6 [J].
Durand, A .
IEEE INTERNET COMPUTING, 2001, 5 (01) :79-81
[8]   A Genetic Algorithm Optimization for Multi-Objective Multicast Routing [J].
Hamed, Ahmed Y. ;
Alkinani, Monagi H. ;
Hassan, M. R. .
INTELLIGENT AUTOMATION AND SOFT COMPUTING, 2020, 26 (06) :1201-1216
[9]   Ant Colony Optimization for Multi-Objective Multicast Routing [J].
Hamed, Ahmed Y. ;
Alkinani, Monagi H. ;
Hassan, M. R. .
CMC-COMPUTERS MATERIALS & CONTINUA, 2020, 63 (03) :1159-1173
[10]   An algorithm to compute optimal genetic contributions in selection programs with large numbers of candidates [J].
Hinrichs, D. ;
Wetten, M. ;
Meuwissen, T. H. E. .
JOURNAL OF ANIMAL SCIENCE, 2006, 84 (12) :3212-3218