Directional Bias and Pheromone for Discovery and Coverage on Networks

Natural multi-agent systems often rely on "correlated random walks" (random walks that are biased toward a current heading) to distribute their agents over a space (e.g., for foraging, search, etc.) Our contribution involves creation of a new movement and pheromone model that applies the concept of heading bias in random walks to a multi-agent, digital-ants system designed for cyber-security monitoring. We examine the relative performance effects of both pheromone and heading bias on speed of discovery of a target and search-area coverage in a two-dimensional network layout. We found that heading bias was unexpectedly helpful in reducing search time and that it was more influential than pheromone for improving coverage. We conclude that while pheromone is very important for rapid discovery, heading bias can also greatly improve both performance metrics.

[1]  T. O. Crist,et al.  Individual foraging components of harvester ants: movement patterns and seed patch fidelity , 1991, Insectes Sociaux.

[2]  R. Matthews,et al.  Ants. , 1898, Science.

[3]  H. Van Dyke Parunak,et al.  "Go to the ant": Engineering principles from natural multi-agent systems , 1997, Ann. Oper. Res..

[4]  Deborah A. Frincke,et al.  DualTrust: A Distributed Trust Model for Swarm-Based Autonomic Computing Systems , 2010, DPM/SETOP.

[5]  U. Netlogo Wilensky,et al.  Center for Connected Learning and Computer-Based Modeling , 1999 .

[6]  C. McCulloch,et al.  Analyzing Discrete Movement Data as a Correlated Random Walk , 1989 .

[7]  S Erol Swarm Robotics: From Sources of Inspiration to Domains of Application , 2005 .

[8]  Guy Theraulaz,et al.  Routing in Telecommunications Networks with Ant-Like Agents , 1999, IATA.

[9]  Laurent Massoulié,et al.  Epidemics and Rumours in Complex Networks: Index , 2009 .

[10]  Noga Alon,et al.  Many Random Walks Are Faster Than One , 2011, Comb. Probab. Comput..

[11]  P.-P. Grasse La reconstruction du nid et les coordinations interindividuelles chezBellicositermes natalensis etCubitermes sp. la théorie de la stigmergie: Essai d'interprétation du comportement des termites constructeurs , 1959, Insectes Sociaux.

[12]  Glenn A. Fink,et al.  Using swarming agents for scalable security in large network environments , 2011, 2011 IEEE 54th International Midwest Symposium on Circuits and Systems (MWSCAS).

[13]  Anthony Bonato,et al.  The Game of Cops and Robbers on Graphs , 2011 .

[14]  D. Aldous An introduction to covering problems for random walks on graphs , 1989 .

[15]  Glenn A. Fink,et al.  Mixed-Initiative Cyber Security: Putting humans in the right loop , 2009 .

[16]  Joshua N. Cooper,et al.  Deterministic Random Walks , 2006, ANALCO.

[17]  Ashish Ghosh,et al.  Aggregation pheromone density based data clustering , 2008, Inf. Sci..

[18]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[19]  Sven A. Brueckner,et al.  RETURN FROM THE ANT SYNTHETIC ECOSYSTEMS FOR MANUFACTURING CONTROL , 2000 .

[20]  Uriel Feige,et al.  Random Walks on Regular and Irregular Graphs , 1996, SIAM J. Discret. Math..

[21]  BRIAN C. WILLIAMS A COMPARISON OF STATIC TO BIOLOGICALLY MODELED INTRUSION DETECTION SYSTEMS , 2010 .

[22]  Ayalvadi Ganesh,et al.  Spread of Epidemics and Rumours with Mobile Agents , 2010, Progress in Industrial Mathematics at ECMI 2008.

[23]  Yuval Peres,et al.  The Evolution of the Cover Time , 2010, Combinatorics, Probability and Computing.

[24]  Colin Cooper,et al.  Random Walks, Interacting Particles, Dynamic Networks: Randomness Can Be Helpful , 2011, SIROCCO.

[25]  P. Kareiva,et al.  Analyzing insect movement as a correlated random walk , 1983, Oecologia.

[26]  Guy Theraulaz,et al.  Self-Organization in Biological Systems , 2001, Princeton studies in complexity.

[27]  S. Benhamou,et al.  Spatial analysis of animals' movements using a correlated random walk model* , 1988 .