Containing smartphone worm propagation with an influence maximization algorithm
Data(s) |
09/12/2014
|
---|---|
Resumo |
In recent years, wide attention has been drawn to the problem of containing worm propagation in smartphones. Unlike existing containment models for worm propagation, we study how to prevent worm propagation through the immunization of key nodes (e.g.; the top k influential nodes). Thus, we propose a novel containment model based on an influence maximization algorithm. In this model, we introduce a social relation graph to evaluate the influence of nodes and an election mechanism to find the most influential nodes. Finally, this model provides a targeted immunization strategy to disable worm propagation by immunizing the top k influential nodes. The experimental results show that the model not only finds the most influential top k nodes quickly, but also effectively restrains and controls worm propagation. |
Identificador | |
Idioma(s) |
eng |
Publicador |
Elsevier BV |
Relação |
http://dro.deakin.edu.au/eserv/DU:30072505/peng-containingsmartphone-2014.pdf http://www.dx.doi.org/10.1016/j.comnet.2014.09.004 |
Direitos |
2014, Elsevier |
Palavras-Chave | #Influence maximization #Smartphones #Social relationship graph #Voting algorithm Immunization #Worm containment #Science & Technology #Technology #Computer Science, Hardware & Architecture #Computer Science, Information Systems #Engineering, Electrical & Electronic #Telecommunications #Computer Science #Engineering #Voting algorithm #Immunization #SOCIAL NETWORKS #MALWARE #DYNAMICS #VIRUS |
Tipo |
Journal Article |