Vulnerable Node Detection and Route Recovery in Dynamic Complex Networks with the Ant Colony Optimization

Abstract

Vulnerability is an important issue that needs to be solved in order to optimize the performance of complex networks. Dynamism in the topology of a complex network isan important factor in vulnerability analysis of complex networks.We analyses the vulnerability of dynamic complex networks and deals with vulnerable nodes in such networks by focusing on ad-hoc networks, which are typical dynamic networkssharing the properties of complex networks.This paper represents a node-type model with respect to network vulnerability as a semi-Markov process, and definesthe vulnerability index of ad-hoc networks by throughput measurement and graphical analysis. We propose an algorithm based on the ant colony optimization (ACO) in order to detect vulnerable nodesand to reconstruct a new robust routefor ad-hoc networks. The simulation results show that the proposed algorithm lowers the vulnerability index andreduces vulnerable nodes with maintainingthe throughput of the network. Keyword-Vulnerable Node Detection, Route Recovery, Ad-hoc Networks, Ant Colony Optimization

13 Figures and Tables

Cite this paper

@inproceedings{Kim2016VulnerableND, title={Vulnerable Node Detection and Route Recovery in Dynamic Complex Networks with the Ant Colony Optimization}, author={Tae-Hyong Kim}, year={2016} }