Node centrality awareness Via swarming effects

Decebal Constantin Mocanu, Georgios Exarchakos, Antonio Liotta

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

10 Citations (Scopus)

Abstract

Centralization is a weakness in large scale dynamic topologies and, thus, collaboratively electing at runtime the most impactful (central) nodes is necessary to ensure reliability. However, little has been achieved in measuring the centrality of nodes in an accurate, fast, decentralized and with low overhead method. This paper proposes a swarm-inspired approach (DANIS) to detect the nodes that would most impact the network connectivity if removed. The idea lies on the trivial fact that the more accessible a node is, the more resources per time unit it loses. Experiments on random, scale-free and small-world graph topologies indicate that DANIS achieves higher accuracy, faster convergence and fewer communication overhead compared to other methods.

Original languageEnglish
Title of host publication2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC)
Place of PublicationPiscataway, NJ
PublisherIEEE
Pages19-24
Number of pages6
ISBN (Electronic)978-1-4799-3840-7
DOIs
Publication statusPublished - 2014
Externally publishedYes
EventIEEE International Conference on Systems, Man, and Cybernetics, SMC 2014 - Paradise Point Resort and Spa, San Diego, United States
Duration: 5 Oct 20148 Oct 2014

Publication series

NameProceedings IEEE International Conference on Systems, Man and Cybernetics
PublisherIEEE
Volume2014
ISSN (Print)1062-922X

Conference

ConferenceIEEE International Conference on Systems, Man, and Cybernetics, SMC 2014
Abbreviated titleSMC 2014
CountryUnited States
CitySan Diego
Period5/10/148/10/14

Fingerprint

Dive into the research topics of 'Node centrality awareness Via swarming effects'. Together they form a unique fingerprint.

Cite this