Affiliation:
1. Information Technology Services Center, Nanjing University, Nanjing, Jiangsu, China
Abstract
Under the influence of COVID-19, an efficient Ad-hoc network routing algorithm is required in the process of epidemic prevention and control. Artificial neural network has become an effective method to solve large-scale optimization problems. It has been proved that the appropriate neural network can get the exact solution of the problem in real time. Based on the continuous Hopfield neural network (CHNN), this paper focuses on the study of the best algorithm path for QoS routing in Ad-hoc networks. In this paper, a new Hopfield neural network model is proposed to solve the minimum cost problem in Ad-hoc networks with time delay. In the improved version of the path algorithm, the relationship between the parameters of the energy function is provided, and it is proved that the feasible solution of the network belongs to the category of progressive stability by properly selecting the parameters. The calculation example shows that the solution is not affected by the initial value, and the global optimal solution can always be obtained. The algorithm is very effective in the prevention and control in COVID-19 epidemic.
Subject
Artificial Intelligence,General Engineering,Statistics and Probability
Reference11 articles.
1. BDD-based algorithm for the minimum spanning tree in wireless ad-hoc network routing;Yanez-Marquez;IEEE Latin America Transactions,2013
2. Minimized routing protocol in ad-hoc network with quality maintenance based on genetic algorithm: a survey;Chauhan;Evolutionary Ecology Research,2013
3. HOPNET: A hybrid ant colony optimization routing algorithm for mobile ad-hoc network;Wang;Networks,2009
4. The performance of a hybrid routing intelligent algorithm in a mobile Ad-hoc network;Nancharaiah;Computers & Electrical Engineering,2014
5. Entire network load-aware cooperative routing algorithm for video streaming over mobile Ad-hoc networks;Kwon;Wireless Communications and Mobile Computing,2013
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献