Computer Science ›› 2021, Vol. 48 ›› Issue (6A): 485-490.doi: 10.11896/jsjkx.200800132

• Information Security • Previous Articles     Next Articles

Application and Simulation of Ant Colony Algorithm in Continuous Path Prediction of Dynamic Network

YANG Lin, WANG Yong-jie   

  1. College of Electromagnetic Countermeasure,National University of Defense Technology,Hefei 230037,China
    Anhui Province Key Laboratory of Cyberspace Security Situation Awareness and Evaluation,Hefei 230037,China
  • Online:2021-06-10 Published:2021-06-17
  • About author:YANG Lin,born in 1995,postgraduate,is a member of China Computer Federation.His main research interests include cyberspace security,network security situational awareness and artificial intelligence.
    WANG Yong-jie,born in 1974,Ph.D,associate professor.His main research interests include cyberspace security,risk assessment and information system modeling and simulation.

Abstract: With the widespread use of active defense methods,dynamic variability has become a prominent feature of network systems.When discussing network system security,it is inevitable to base on dynamic network environment.Path prediction,as a common method of network security assessment,also needs to adapt to dynamic network environment and have the characteristics of continuous and efficient.In order to solve this problem,it is proposed to apply the ant colony optimization algorithm to the continuous path prediction of the network,and to design a simulation experiment to compare it with the completely random algorithm and the greedy algorithm in terms of optimization accuracy and optimization speed.The simulation experiment results show that the optimization accuracy of the original ant colony algorithm is not as good as the completely random algorithm,but due to the guidance of heuristic information,its optimization speed is much better than the completely random algorithm.In order to balance the advantages of the original ant colony algorithm and the completely random algorithm,a new ant colony pheromone update strategy is proposed,and a simulation experiment is designed to verify the efficiency of the algorithm.The final experimental results show that the improved ant colony optimization algorithm can better integrate the advantages of the original ant colony algorithm and the completely random algorithm,and achieve a balance between optimization accuracy and optimization speed.Howe-ver,it is necessary to continue to optimize the algorithm in the next research,so that it can better and more completely inherit the advantages of the original ant colony algorithm and the completely random algorithm,and achieve a high level both in accuracy and speed.

Key words: Ant colony optimization algorithm, Dynamic network, Path prediction, Simulation experiment

CLC Number: 

  • TP393.08
[1] DURKOTA K,LISY V,KIEKINTVELD C,et al.Case Studies of Network Defense with Attack Graph Games[J].IEEE Intelligent Systems,2016,31(5):24-30.
[2] XIONG X L,YANG L,ZHAO G S.Effectiveness EvaluationModel of Moving Target Defense Based on System Attack Surface [J].IEEE Access,2019,7:9998-10014.
[3] GORDON L,LOEB M,LUCYSHYN W,et al.2016 CSI/FBIcomputer crime and security survey [C]//Proceedings of the 2016 Computer Security Institute,2016.San Francisco:IEEE.
[4] NITRD.Cybersecurity game-change research & developmentrecommendations [OL].http://www.nitrd.gov/pubs/CSIAIWG%20Cyberscurty%20GameChange_RD%20Recom-mendations 20100513.pdf,2014-03-21.
[5] WU J X.Research on Cyber Mimic Defense[J].Journal of Cyber Security,2016,1:1-10.
[6] NI Z,LI Q M,LIU G.Game-Model-Based Network SecurityRisk Control [J].Computer,2018,51(4):28-38.
[7] HU Q.Attack Prediction Method Based on Multi-step AttackScenario[J].Computer Science,2019(46):365-369.
[8] ZHANG Y C,ZHOU T Y,GE X Y,et al.An improved attack path discovery algorithm through compact graph planning [J].IEEE Access,2019,7:1.
[9] MUÑOZ-GONZALEZ L,SGANDURRA D,PAUDICE A,et al.Efficient Attack Graph Analysis through Approximate Inference[J].ACM Transactions on Privacy and Security,2017,20(3):1-30.
[10] BENNET D J,MCINNES C R.Distributed control of multi-robot systems using bifurcating potential fields [J].Robotics and Autonomous Systems,2010,58(3):256-264.
[11] SHOU S,CHEN L S,GUO D H,et al.Dynamic Shortest Path Monitoring in Spatial Networks [J].Journal of Computer Science and Technology,2016,31(4):637-648.
[12] LIU R C,LIU J D,HE M M.A multi-objective ant colony optimization with decomposition for community detection in complex networks [J].Transactions of the Institute of Measurement and Control,2018,41(9):2521-2534.
[13] SHAHABI SANI N,MANTHOURI M,FARIVAR F.A multi-objective ant colony optimization algorithm for community detection in complex networks [J].Journal of Ambient Intelligence and Humanized Computing,2020,11(1):5-21.
[14] SONG Q,ZHAO Q L,WANG S X,et al.Dynamic Path Planning for Unmanned Vehicles Based on Fuzzy Logic and Improved Ant Colony Optimization[J].IEEE Access,2020,8:62107-62115.
[15] DORIGO M,GAMBARDELLA L M.Ant colony system:a cooperative learning approach to the traveling salesman problem [J].IEEE Transactions on Evolutionary Computation,1997,1(1):53-66.
[16] LIU J W,LIU J J,LU Y L,et al.Optimal Defense Strategy Selection Method Based on Network Attack-Defense Game Model[J].Computer Science,2018(45):117-123.
[17] FRANK H,FRISCH I.Analysis and Design of Survivable Networks [J].IEEE Transactions on Communication Technology,1970(5):501-519.
[18] WU J,TAN S Y,TAN Y J,et al.Analysis of Invulnerability in Complex Networks Based on Natural Connectivity[J].Complex Systems and Complexity Science,2014(11):77-86.
[1] PU Shi, ZHAO Wei-dong. Community Detection Algorithm for Dynamic Academic Network [J]. Computer Science, 2022, 49(1): 89-94.
[2] FU Kun, QIU Qian, ZHAO Xiao-meng, GAO Jin-hui. Event Detection Method Based on Node Evolution Staged Optimization [J]. Computer Science, 2020, 47(5): 96-102.
[3] ZHAO Wei-ji,ZHANG Feng-bin,LIU Jing-lian. Review on Community Detection in Complex Networks [J]. Computer Science, 2020, 47(2): 10-20.
[4] FU Li-dong and NIE Jing-jing. Dynamic Community Detection Based on Evolutionary Spectral Method [J]. Computer Science, 2018, 45(2): 171-174.
[5] ZHANG Yan-qing, LU Yu-liang and YANG Guo-zheng. Link Prediction of AS Level Internet Based on Association Rule of Frequent Closed Graphs [J]. Computer Science, 2016, 43(Z6): 314-318.
[6] GAO Fa-qin. Path Prediction and Query Algorithm Based on Probability [J]. Computer Science, 2016, 43(8): 207-211.
[7] QIAN Pei-jie, WU Juan and GAO Cheng-ying. Study and Implementation on Cache Algorithms [J]. Computer Science, 2015, 42(Z6): 38-44.
[8] QIAO Guan-hua,MAO Jian-lin,GUO Ning,HU Yu-jie and WANG Le. Research and Improved Design in IEEE802.15.4 MAC Protocol for Service Distinguishing [J]. Computer Science, 2014, 41(10): 149-153.
[9] . New P2P Network Security Mechanism Based on the Rough Set and the Bayes Classifier [J]. Computer Science, 2012, 39(9): 28-32.
[10] . Research on Influence Maximization Problem Based on Dynamic Networks [J]. Computer Science, 2012, 39(6): 111-115.
[11] . Platform Resource Scheduling Method Based on DLS and ACO [J]. Computer Science, 2012, 39(6): 98-103.
[12] SONG Yu-rong,JIANG Guo-ping. Information Dissemination Strategy for Energy and Delay Optimization in Wireless Sensor Networks [J]. Computer Science, 2010, 37(10): 123-126.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!