Soft Computing

, Volume 21, Issue 19, pp 5621–5629 | Cite as

Critical node identification for complex network based on a novel minimum connected dominating set

  • Fahong Yu
  • Xiaoyun Xia
  • Wenping Li
  • Jiang Tao
  • Longhua Ma
  • Zhao-quan Cai
Foundations

Abstract

Identifying critical nodes in complex networks aims to fragment a graph \(G = (V, E)\) by removing a set of vertices R with cardinality \(\left| R \right| \le \) k, such that the residual graph has minimum pairwise connectivity. Existing optimization algorithms are incapable of finding a good set R in complex networks. By investigating the role of nodes, a minimum dominating set approach is considered in controlling a network. This paper presents an algorithmic procedure to compute the critical nodes using a novel minimum connected dominating set, in which the critical nodes are identified based on the number of close subsequences. Through experimental verification on some randomly generated networks and comparing with the similar algorithms, the results showed that the proposed algorithm has high capability of identifying the critical nodes and low time complexity.

Keywords

Minimum connected dominating set Critical nodes identification The number of close subsequences 

References

  1. Agrawal D, Budak C, Abbadi AE (2011) Information diffusion in social networks: observing and influencing societal interests. In: 2011 Proceedings of the VLDB endowment. IEEE, pp 1512–1518Google Scholar
  2. Balaji S, Revathi N (2012) An efficient heuristic for the minimum connected dominating set problem on ad hoc wireless networks. World Acad Sci Eng Technol 6(9):8–22Google Scholar
  3. Barabsi A-L, Bonabeau E (2003) Scale-free networks. Sci Am 6(9):50–59Google Scholar
  4. Callaway DS, Newman MEJ, Strogatz SH, Watts DJ (2000) Network robustness and fragility: percolation on random graphs. Phys Rev Lett 85(25):5468–5471CrossRefGoogle Scholar
  5. Cao YJ, Ding LJ, Wang GZ, Bao ZJ, Han ZX (2009) Analysis on cascading failure and self-organized criticality in evolving power grids. Autom Electr Power Syst 33(5):1–6Google Scholar
  6. Chakradhar P, Yogesh P (2014) Energy efficient minimum connected dominating set algorithm for manets. Int Conf Recent Trends Inf Technol 7(9):270–282Google Scholar
  7. Chamodrakas I, Martakos D (2015) An improved algorithm for minimum connected dominating sets in ad hoc networks. ICIC Express Lett 13(5):202–209Google Scholar
  8. Chen H, Xu J, Wang G, Qin Y, Chau M, Chung W (2004) Crime data mining: a general framework and some examples. Computer 4(37):50–56CrossRefGoogle Scholar
  9. Dan X, Xiao-Fan W, Xiang L (2010) An investigation on local area control of virus spreading in complex networks. Acta Phys 13(3):1313–1317Google Scholar
  10. Ding D (2012) Identification of crucial nodes in biological networks. Netw Biol 15(3):118–127Google Scholar
  11. Firmani D, Italiano GF, Laura L (2015) The (not so) critical nodes of criminal networks. Soc Inf 8(3):87–96Google Scholar
  12. Freeman LC (1998) Centrality in social networks. Soc Netw 14(7):1170–1182Google Scholar
  13. Girvan M, Newman MEJ (2006) Community structure in social and biological networks. PhysRevE 8(4):147–160MATHGoogle Scholar
  14. Kinney R, Albert R, Latora V, Crucitti P (2005) Modeling cascading failures in the North American power grid. Eur Phys J B 46(9):101–107Google Scholar
  15. Li J, Li M, Li J, Chen X (2014) Secure deduplication with efficient and reliable convergent key management. IEEE Trans Parallel Distrib Syst 25(6):1615–1625. doi:10.1109/TPDS.2013.284 CrossRefGoogle Scholar
  16. Lu TYXWYHSB, Piao XF (2012) Energy efficient minimum connected dominating set algorithm for manets. Acta Phys 61(9):170–179Google Scholar
  17. Nguyen DT, Shen Y, Thai MT (2013) Detecting critical nodes in interdependent power networks for vulnerability assessment. IEEE Trans Smart Grid 11(9):151–159CrossRefGoogle Scholar
  18. Shen Y, Nguyen NP, Xuan Y, Thai MT (2014) On the discovery of critical links and nodes for assessing network vulnerability. IEEE/ACM Trans Netw 21(3):963–973CrossRefGoogle Scholar
  19. Sweet N, Kanefsky S (2013) The c2 constellation air force network centric warfare program. In: 2013 Command and control research and technology symposium. IEEE, pp 563–571Google Scholar
  20. Ventresca M, Aleman D (2015) Efficiently identifying critical nodes in large complex networks. Comput Soc Netw 6(2):179–188Google Scholar
  21. Ventresca M, Ombuki-Berman BM, Harrison KR (2015) An experimental evaluation of multi-objective evolutionary algorithms for detecting critical nodes in complex networks. Appl Evol Comput 7(3):164–176Google Scholar
  22. Veremyev A, Pasiliao EL, Boginski V (2014) Exact identification of critical nodes in sparse networks via new compact formulations. Optim Lett 8(5):1245–1259MathSciNetCrossRefMATHGoogle Scholar
  23. Vida R, Cuenda S, Galeano J (2013) Identifying critical nodes in multi-layered networks under multi-vector malware attack. Int J Complex Syst Sci 3(5):97–105Google Scholar
  24. Wang XG (2014) An algorithm for critical nodes problem in social networks based on owen value. Sci World J 15(10):72–82Google Scholar
  25. Wang P, Lu J, Yu X (2014) Identification of important nodes in artificial bio-molecular networks. In: 2014 IEEE international symposium on circuits and systems. IEEE, pp 1267–1276Google Scholar
  26. Xu J, Chen H (2005) Criminal network analysis and visualization. Commun ACM 48(6):100–107Google Scholar
  27. Xu Y, Gao Z, Xiao B, Meng F, Lin Z (2013) key nodes evaluation with multi-criteria in complex networks based on ahp analysis. In: Proceedings of IEEE IC-BNMT2013. IEEE, pp 175–182Google Scholar
  28. Yan-Chao Z, Hai-Feng Z, Hui C, Fei X, Yun L (2011) The research of information dissemination model on online social network. Acta Phys 60(16):171–179Google Scholar
  29. Yan R, Tang J, Liu X, Shan D, Li X (2012) Citation count prediction: learning to estimate future citations for literature. In: Proceedings of the 20th ACM international conference on Information and knowledge management. IEEE, pp 1247–1252Google Scholar
  30. Yong XXH (2015) Research on the dynamics of opinion spread based on social network services. Acta Phys 15(9):973–979Google Scholar
  31. Yu G (2011) Novel connected dominating set algorithm based on minimum spanning tree. J Comput Appl 26(9):327–335Google Scholar
  32. Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 11(2):452–473CrossRefGoogle Scholar
  33. Zhongtai C, Xiaohuan W, Ning M, Xiuqing S (2015) Key nodes identify in the peasants social network based on structural hole theory. Int J Hybrid Inf Technol 8(2):251–258Google Scholar
  34. Zhu J, Yang XJ (2015) Recognizing key nodes in area communication network. Electron Inf Warf Technol 64(7):46–52Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.College of Mathematics and Information EngineeringJiaxing UniversityJiaxingChina
  2. 2.Ningbo Institute of TechnologyZhejiang UniversityNingboChina
  3. 3.Jiangxi University of Science and TechnologyGanzhouChina
  4. 4.Huizhou UniversityHuizhouChina

Personalised recommendations