Neural Network Optimal Routing Algorithm Based on Genetic Ant Colony in IPv6 Environment
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 algor...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2021-01-01
|
Series: | Computational Intelligence and Neuroscience |
Online Access: | http://dx.doi.org/10.1155/2021/3115704 |
id |
doaj-1152193f3f0c44459afb3a22a5678153 |
---|---|
record_format |
Article |
spelling |
doaj-1152193f3f0c44459afb3a22a56781532021-07-26T00:35:12ZengHindawi LimitedComputational Intelligence and Neuroscience1687-52732021-01-01202110.1155/2021/3115704Neural Network Optimal Routing Algorithm Based on Genetic Ant Colony in IPv6 EnvironmentWeichuan Ni0Zhiming Xu1Jiajun Zou2Zhiping Wan3Xiaolei Zhao4Guangzhou Xinhua UniversityGuangzhou Xinhua UniversityGuangzhou Xinhua UniversityGuangzhou Xinhua UniversityGuangzhou Xinhua UniversityThe 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.http://dx.doi.org/10.1155/2021/3115704 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Weichuan Ni Zhiming Xu Jiajun Zou Zhiping Wan Xiaolei Zhao |
spellingShingle |
Weichuan Ni Zhiming Xu Jiajun Zou Zhiping Wan Xiaolei Zhao Neural Network Optimal Routing Algorithm Based on Genetic Ant Colony in IPv6 Environment Computational Intelligence and Neuroscience |
author_facet |
Weichuan Ni Zhiming Xu Jiajun Zou Zhiping Wan Xiaolei Zhao |
author_sort |
Weichuan Ni |
title |
Neural Network Optimal Routing Algorithm Based on Genetic Ant Colony in IPv6 Environment |
title_short |
Neural Network Optimal Routing Algorithm Based on Genetic Ant Colony in IPv6 Environment |
title_full |
Neural Network Optimal Routing Algorithm Based on Genetic Ant Colony in IPv6 Environment |
title_fullStr |
Neural Network Optimal Routing Algorithm Based on Genetic Ant Colony in IPv6 Environment |
title_full_unstemmed |
Neural Network Optimal Routing Algorithm Based on Genetic Ant Colony in IPv6 Environment |
title_sort |
neural network optimal routing algorithm based on genetic ant colony in ipv6 environment |
publisher |
Hindawi Limited |
series |
Computational Intelligence and Neuroscience |
issn |
1687-5273 |
publishDate |
2021-01-01 |
description |
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. |
url |
http://dx.doi.org/10.1155/2021/3115704 |
work_keys_str_mv |
AT weichuanni neuralnetworkoptimalroutingalgorithmbasedongeneticantcolonyinipv6environment AT zhimingxu neuralnetworkoptimalroutingalgorithmbasedongeneticantcolonyinipv6environment AT jiajunzou neuralnetworkoptimalroutingalgorithmbasedongeneticantcolonyinipv6environment AT zhipingwan neuralnetworkoptimalroutingalgorithmbasedongeneticantcolonyinipv6environment AT xiaoleizhao neuralnetworkoptimalroutingalgorithmbasedongeneticantcolonyinipv6environment |
_version_ |
1721282278633504768 |