Optimizing sensors placement in complex networks for localization of hidden signal source: A review
December 03, 2020 Β· The Cartographer Β· π Future generations computer systems
"No code URL or promise found in abstract"
"Title-pattern auto-detect: Optimizing sensors placement in complex networks for localization of hidden signal source: A review"
Evidence collected by the PWNC Scanner
Authors
Robert Paluch, Εukasz G. Gajewski, Janusz A. HoΕyst, Boleslaw K. Szymanski
arXiv ID
2012.01876
Category
cs.SI: Social & Info Networks
Cross-listed
cs.CY,
physics.data-an
Citations
39
Venue
Future generations computer systems
Last Checked
2 days ago
Abstract
As the world becomes more and more interconnected, our everyday objects become part of the Internet of Things, and our lives get more and more mirrored in virtual reality, where every piece of~information, including misinformation, fake news and malware, can spread very fast practically anonymously. To suppress such uncontrolled spread, efficient computer systems and algorithms capable to~track down such malicious information spread have to be developed. Currently, the most effective methods for source localization are based on sensors which provide the times at which they detect the~spread. We investigate the problem of the optimal placement of such sensors in complex networks and propose a new graph measure, called Collective Betweenness, which we compare against four other metrics. Extensive numerical tests are performed on different types of complex networks over the wide ranges of densities of sensors and stochasticities of signal. In these tests, we discovered clear difference in comparative performance of the investigated optimal placement methods between real or scale-free synthetic networks versus narrow degree distribution networks. The former have a clear region for any given method's dominance in contrast to the latter where the performance maps are less homogeneous. We find that while choosing the best method is very network and spread dependent, there are two methods that consistently stand out. High Variance Observers seem to do very well for spread with low stochasticity whereas Collective Betwenness, introduced in this paper, thrives when the spread is highly unpredictable.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Social & Info Networks
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Fake News Detection on Social Media: A Data Mining Perspective
R.I.P.
π»
Ghosted
Heterogeneous Graph Attention Network
R.I.P.
π»
Ghosted
Natural Scales in Geographical Patterns
R.I.P.
π»
Ghosted
Representation Learning on Graphs: Methods and Applications
R.I.P.
π»
Ghosted