Sage Journals: Discover world-class research

Abstract

Previous research studied a problem of data collection in complex networks with failure-prone components using mobile agents and two movement strategies: random and a pheromone-based algorithm. As a main conclusion, a fast data collection implies higher robustness and success rates. In some scale-free networks with a higher standard deviation in the betweenness centrality, random exploration was faster than a pheromone-based algorithm because mobile agents remain re-exploring nodes for more time. This paper presents an improvement to selected movement algorithms to collect data in complex networks in a faster way. The proposed improvement consists of local marks in nodes to avoid re-exploration combined with the previously proposed algorithms. Experiments were performed with different failures rates. Results show that there is a significant difference between the pheromone algorithm with and without local marks providing a higher robustness in data collection tasks in scenarios with a higher standard deviation in the betweenness centrality. Possible applications include data-collection and retrieval in distributed environments like Internet of Things environments (IoT) as well as farms, clusters and clouds.

Keywords

Data collection complex networks failure-prone mobile agents local marking

Get full access to this article

View all access options for this article.

References

Aguilera

M.K.

and van

, Renesse and R. Guerraoui, Replication. In Charron-Bost

, Pedone

and Schiper

, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 5959, chapter Replication, Springer-Verlag, Berlin, Heidelberg, 2010, pp. 19–40.

Balaji

P.G.

and Srinivasan

, An introduction to multi-agent systems, Studies in Computational Intelligence310 (2010), 1–27.

Barabási

A.-L.

and Bonabeau

, Scale-free networks, Scientific American288(5) (2003), 60–69.

Dorigo

and Gambardella

L.M.

, Ant colony system: A cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation1(1) (1997), 53–66.

Dorigo

and Stutzle

, Ant colony optimization, volume 1, MIT Press, 2004.

Girvan

and Newman

M.E.J.

, Community structure in social and biological networks, Proceedings of the National Academy of Sciences of the United States of America99(12) (2002), 7821–7826.

Grabow

, Hill

S.M.

, Grosskinsky

Stefan

, Timme

Marc

, Do small worlds synchronize fastest?EPL (Europhysics Letters)90(4) (2010), 48002.

Lalanda

, Mccann

J.A.

and Diaconescu

, Autonomic Computing: Principles, Design and Implementation, Springer, 2013.

Mahmood

, Hill

, editors, Cloud Computing for Enterprise Architectures, Computer Communications and Networks, Springer, London, 2011.

10.

Mori

, Uehara

and Matsumoto

, Parallel Architectures with Small World Network Model, 2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops, 2015, pp, 467–472.

11.

Nami

M.R.

and Sharifi

, Autonomic Computing: A New Approach, Modelling & Simulation, 2007 AMS ’07 First Asia International Conference on, 2007, pp. 352–357.

12.

Ongaro

and Ousterhout

, In Search of an Understandable Consensus Algorithm, Ramcloud Stanford Edu (2013).

13.

Ozdaglar

and Nédic

, Consensus Problem in Multi-Agent Systems, 2007.

14.

Raynal

, Distributed Algorithms for Message-Passing Systems, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013.

15.

Rodríguez

, Gómez

and Diaconescu

, Foraging-Inspired Self-Organisation for Terrain Exploration with Failure-Prone Agents, In 2015 IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems, volume 2015-Octob, 2015, pp. 121–130. IEEE.

16.

Rodríguez

, Gómez

and Diaconescu

, Exploring Complex Networks with Failure-Prone Agents, In Pichardo-Lagunas

and Miranda-Jiménez

, editors, 15th Mexican International Conference on Artificial Intelligence, MICAI 2016, Lecture Notes In Computer Science, Cham, 2017, pp. 81–98.

17.

Rodríguez

, Gómez

and Diaconescu

, Replication-Based Self-healing of Mobile Agents Exploring Complex Networks, In Demazeau

, Davidsson

, Bajo

and Vale

, editors, Advances in Practical Applications of Cyber-Physical Multi-Agent Systems: The PAAMS Collection: 15th International Conference, PAAMS 2017, Porto, Portugal, Proceedings, Springer International Publishing, Cham, 2017, pp. 222–233.

18.

Russell

and Norvig

, Artificial intelligence a modern approach, Prentice-Hall, New Jersey, third edition, 2010.

19.

Schmider

, Ziegler

, Danay

, Beyer

and Bühner

, Is It Really Robust?: Reinvestigating the robustness of ANOVA against violations of the normal distribution assumption, Methodology6(4) (2010), 147–151.

20.

Small

, “Scale-Free Network” - MathWorld-A Wolfram Web Resource, 2016.

21.

Takemoto

, Oosawa

, Introduction to Complex Networks: Measures, Statistical Properties, and Models, John Wiley & Sons, Inc., Hoboken, NJ, USA, 2012, pp. 45–75.

22.

Tanenbaum

A.S.

and Steen

M.V.

, Distributed systems: Principles and paradigms, Prentice-Hall, 2006.

23.

Hofstad

R.V.D.

, Random Graphs and Complex Networks Vol. I. Available on http://www.win.tue.nl/rhofstad/NotesRGCN.pdf,I, 2016.

24.

Watts

D.J.

and Strogatz

S.H.

, Collective dynamics of ’smallworld’ networks, Nature393(6684) (1998), 440–442.

25.

White

, Analysis and visualization of network data using JUNG, Journal Of Statistical SoftwareVV(Ii) (2005), 1–35.

Improving data collection in complex networks with failure-prone agents via local marking

Abstract

Keywords

Get full access to this article

References