Node centrality awareness via swarming effects

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

10 Citations (Scopus)
69 Downloads (Pure)

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 publicationIEEE International Conference on Systems, Man, and Cybernetics (SMC2014), 5-8 October, San Diego, California
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages19-24
ISBN (Print)978-1-4799-3840-7
DOIs
Publication statusPublished - 2014
Event2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC 2014) - San Diego; California, San Diego, United States
Duration: 5 Oct 20148 Oct 2014
Conference number: 6974061
http://ieeexplore.ieee.org/document/6974061/?arnumber=6974061

Conference

Conference2014 IEEE International Conference on Systems, Man, and Cybernetics (SMC 2014)
Abbreviated titleSMC 2014
CountryUnited States
CitySan Diego
Period5/10/148/10/14
Internet address

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

Cite this