{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:09:59Z","timestamp":1760234999578,"version":"build-2065373602"},"reference-count":16,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T00:00:00Z","timestamp":1626652800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 108-3116-F-168-001-CC2; MOST 109-2410\u2013H-168-005"],"award-info":[{"award-number":["MOST 108-3116-F-168-001-CC2; MOST 109-2410\u2013H-168-005"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Distributed denial of service (DDoS) attacks often use botnets to generate a high volume of packets and adopt controlled zombies for flooding a victim\u2019s network over the Internet. Analysing the multiple sources of DDoS attacks typically involves reconstructing attack paths between the victim and attackers by using Internet protocol traceback (IPTBK) schemes. In general, traditional route-searching algorithms, such as particle swarm optimisation (PSO), have a high convergence speed for IPTBK, but easily fall into the local optima. This paper proposes an IPTBK analysis scheme for multimodal optimisation problems by applying a revised locust swarm optimisation (LSO) algorithm to the reconstructed attack path in order to identify the most probable attack paths. For evaluating the effectiveness of the DDoS control centres, networks with a topology size of 32 and 64 nodes were simulated using the ns-3 tool. The average accuracy of the LS-PSO algorithm reached 97.06 for the effects of dynamic traffic in two experimental networks (number of nodes = 32 and 64). Compared with traditional PSO algorithms, the revised LSO algorithm exhibited a superior searching performance in multimodal optimisation problems and increased the accuracy in traceability analysis for IPTBK problems.<\/jats:p>","DOI":"10.3390\/sym13071295","type":"journal-article","created":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T10:07:37Z","timestamp":1626689257000},"page":"1295","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Identifying the Attack Sources of Botnets for a Renewable Energy Management System by Using a Revised Locust Swarm Optimisation Scheme"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8304-4786","authenticated-orcid":false,"given":"Hsiao-Chung","family":"Lin","sequence":"first","affiliation":[{"name":"Faculty of Department of Information Management, Kun Shan University, Tainan 710303, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8077-4759","authenticated-orcid":false,"given":"Ping","family":"Wang","sequence":"additional","affiliation":[{"name":"Faculty of Department of Information Management, Kun Shan University, Tainan 710303, Taiwan"}]},{"given":"Wen-Hui","family":"Lin","sequence":"additional","affiliation":[{"name":"Faculty of Department of Information Management, Kun Shan University, Tainan 710303, Taiwan"}]},{"given":"Kuo-Ming","family":"Chao","sequence":"additional","affiliation":[{"name":"School of MIS, Coventry University, Coventry CV1 5FB, UK"}]},{"given":"Zong-Yu","family":"Yang","sequence":"additional","affiliation":[{"name":"Faculty of Department of Information Management, Kun Shan University, Tainan 710303, Taiwan"}]}],"member":"1968","published-online":{"date-parts":[[2021,7,19]]},"reference":[{"key":"ref_1","unstructured":"Nguyen, A. (Taiwan News, 2018). Taiwan\u2019s Central Bank to Offer Banknote Exchange ahead of Lunar New Year, Taiwan News."},{"key":"ref_2","unstructured":"FS-ISAC (Taiwan News, 2021). More than 100 Financial Services Firms Hit with DDoS Extortion Attacks, Taiwan News."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"601","DOI":"10.4038\/jnsfsr.v46i4.8560","article-title":"Two-layer malicious network flow detection system with sparse linear model based feature selection","volume":"46","author":"Catak","year":"2018","journal-title":"J. Natl. Sci. Found. Sri Lanka"},{"key":"ref_4","unstructured":"Shi, Y., and Eberhart, R. (1998, January 4\u20139). A Modified Particle Swarm Optimizer. Proceedings of the IEEE International Conference on Evolutionary Computation, Anchorage, AK, USA."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Angeline, P.J. (1998, January 25\u201327). Evolutionary Optimization versus Particle Swarm Optimization: Philosophy and Performance Difference. Proceedings of the 7th Annual Conference on Evolutionary Programming, International Conference on Evolutionary Computation, San Diego, CA, USA.","DOI":"10.1007\/BFb0040811"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Lin, H.C., Wang, P., and Lin, W.H. (2019). Implementation of an PSO-based security defense mechanism for tracing the sources of DDoS attacks. Computers, 8.","DOI":"10.3390\/computers8040088"},{"key":"ref_7","unstructured":"Eberhart, R.C., and Shi, Y. (2000, January 16\u201319). Comparing Inertia Weights and Constriction Factors in Particle Swarm Optimization. Proceedings of the Congress on Evolutionary Computation, La Jolla, CA, USA."},{"key":"ref_8","unstructured":"(2021, February 25). Multi-Swarm Optimization. Available online: https:\/\/en.wikipedia.org\/wiki\/Multi-swarm_optimization."},{"key":"ref_9","unstructured":"Hendtlass, T. (2005, January 2\u20135). WoSP: A Multi-Optima Particle Swarm Algorithm. Proceedings of the IEEE 2005 Congress on Evolutionary Computation, Edinburgh, UK."},{"key":"ref_10","first-page":"116","article-title":"Particle swarm optimization algorithm based on multi-subgroup harmony search","volume":"31","author":"Zhang","year":"2020","journal-title":"J. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Zhao, S.Z., Liang, J.J., Suganthan, P.N., and Tasgetiren, M.F. (2008, January 1\u20136). Dynamic Multi-Swarm Particle Swarm Optimizer with Local Search for Large Scale Global Optimization. Proceedings of the IEEE 2008 Congress on Evolutionary Computation, Hong Kong, China.","DOI":"10.1109\/CEC.2008.4631320"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.asoc.2014.12.026","article-title":"Dynamic multi-swarm particle swarm optimizer with cooperative learning strategy","volume":"29","author":"Xua","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Chen, S., and Montgomery, J. (2011, January 12\u201316). Selection Strategies for Initial Positions and Initial Velocities in Multi-Optima Particle Swarms. Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, Dublin, Ireland.","DOI":"10.1145\/2001576.2001585"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Chen, S. (2009, January 18\u201321). Locust Swarms-A New Multi-Optima Search Technique. Proceedings of the 2009 IEEE Congress on Evolutionary Computation, Trondheim, Norway.","DOI":"10.1109\/CEC.2009.4983152"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"805357","DOI":"10.1155\/2015\/805357","article-title":"Multithreshold segmentation by using an algorithm based on the behavior of locust swarms","volume":"2015","author":"Cuevas","year":"2015","journal-title":"Math. Probl. Eng."},{"key":"ref_16","unstructured":"(2020, January 17). A* Search Algorithm. Available online: https:\/\/en.wikipedia.org\/wiki\/A*_search_algorithm\/."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/7\/1295\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:31:53Z","timestamp":1760164313000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/7\/1295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,19]]},"references-count":16,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2021,7]]}},"alternative-id":["sym13071295"],"URL":"https:\/\/doi.org\/10.3390\/sym13071295","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2021,7,19]]}}}