When Ants Attack: Security Issues for Stigmergic Systems

Stigmergic systems solve global problems by using indirect communication mediated by an environment. Because they are localized and dynamic, stigmergic systems are self-organizing, robust and adaptive. These properties are useful for creating survivable systems, but stigmergic systems also raise new security concerns. Indirect communication makes systems more vulnerable in an open and hostile environment, and feedback mechanisms common to stigmergic algorithms can be exploited by attackers. In this paper we use AntNet, an adaptive routing algorithm inspired by biological ant foraging, to explore some of the security issues for stigmergic systems. We identify possible attacks and analyze their potency. We propose and evaluate mechanisms for defending against these attacks.

[1]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[2]  Andrew S. Tanenbaum,et al.  Distributed operating systems , 2009, CSUR.

[3]  Sandra L. Murphy,et al.  Digital signature protection of the OSPF routing protocol , 1996, Proceedings of Internet Society Symposium on Network and Distributed Systems Security.

[4]  Jiejun Kong,et al.  Providing robust and ubiquitous security support for mobile ad-hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[5]  Marco Dorigo,et al.  Swarm intelligence: from natural to artificial systems , 1999 .

[6]  Israel A. Wagner,et al.  Vertex-Ant-Walk – A robust method for efficient exploration of faulty graphs , 2004, Annals of Mathematics and Artificial Intelligence.

[7]  Marco Dorigo,et al.  Two Ant Colony Algorithms for Best-Effort Routing in Datagram Networks , 1998 .

[8]  Anthony R. White Routing with Swarm Intelligence , 1997 .

[9]  Shyhtsun Felix Wu,et al.  An experimental study of insider attacks for OSPF routing protocol , 1997, Proceedings 1997 International Conference on Network Protocols.

[10]  Gene Tsudik,et al.  Lowering security overhead in link state routing , 1999, Comput. Networks.

[11]  Léon J. M. Rothkrantz,et al.  Ant-Based Load Balancing in Telecommunications Networks , 1996, Adapt. Behav..

[12]  David A. Fisher,et al.  Emergent algorithms-a new method for enhancing survivability in unbounded systems , 1999, Proceedings of the 32nd Annual Hawaii International Conference on Systems Sciences. 1999. HICSS-32. Abstracts and CD-ROM of Full Papers.

[13]  Boleslaw K. Szymanski,et al.  Efficient and inefficient ant coverage methods , 2001, Annals of Mathematics and Artificial Intelligence.

[14]  Alberto Montresor Anthill: a Framework for the Design and the Analysis of Peer-to-Peer Systems , 2001 .

[15]  Kan Zhang,et al.  Efficient Protocols for Signing Routing Messages , 1998, NDSS.

[16]  J. J. Garcia-Luna-Aceves,et al.  Securing distance-vector routing protocols , 1997, Proceedings of SNDSS '97: Internet Society 1997 Symposium on Network and Distributed System Security.

[17]  Salima Hassas,et al.  A distributed Intrusion Detection and Response System based on mobile autonomous agents using social insects communication paradigm , 2001, Electron. Notes Theor. Comput. Sci..

[18]  Keith W. Ross,et al.  Computer networking - a top-down approach featuring the internet , 2000 .