A Hierarchically Collaborative Ant Colony Based Assembly Algorithm for Security Protocol
- DOI
- 10.2991/wcnme-19.2019.22How to use a DOI?
- Keywords
- security protocol assembly; collaborative ant colony; reconfigurable security protocol; space-ground integrated network; decision-making
- Abstract
Assembly of reconfigurable security protocol remains a major challenge for deploying higher security-level but more complicated security strategies in access points with limited resources and computing abilities. To handle this problem commendably, a hierarchically collaborative ant colony-based assembly algorithm was proposed. This algorithm decomposed the security protocol assembly problem into assembling directions controlling sub-task and cryptographic components selection sub-task. Directions control generated assembly sub-goals and cryptographic components selection schedules the best-fitted components for given sub-goals. Both sub-tasks adopted a modified version of ant colony algorithm to fulfil its targets. These two ant colony algorithms generate a candidate optimal solution collaboratively for the assembly problem. And a hierarchical pheromone was defined to reinforce positive behaviors of ant colony. Additionally, a Lévy theory based stochastic gradient algorithm was adopted to verify and re-optimize the optimal solution. Experiment results suggest that the proposed algorithm outperforms baseline algorithms in convergence and performance.
- Copyright
- © 2019, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Zhuo Yi AU - Muming Sun AU - Lifeng Cao AU - Xuehui Du PY - 2019/06 DA - 2019/06 TI - A Hierarchically Collaborative Ant Colony Based Assembly Algorithm for Security Protocol BT - Proceedings of the 2019 International Conference on Wireless Communication, Network and Multimedia Engineering (WCNME 2019) PB - Atlantis Press SP - 91 EP - 96 SN - 2352-538X UR - https://doi.org/10.2991/wcnme-19.2019.22 DO - 10.2991/wcnme-19.2019.22 ID - Yi2019/06 ER -