Download:
by Weilin Zhong, David Evans
http://www.cs.virginia.edu/~techrep/CS-2002-23.pdf
Add To MetaCart
Abstract:
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
Citations
|
461
|
Swarm Intelligence: From Natural to Artificial Systems
– Bonabeau
- 1999
|
|
262
|
Computer Networking: A Top-Down Approach Featuring the Internet
– Kurose, Ross
|
|
147
|
L.X.: Providing Robust and Ubiquitous Security Support for Mobile Ad-Hoc Networks
– Kong, Zerfos, et al.
- 2001
|
|
137
|
Network layer protocols with Byzantine robustness
– Perlman
- 1988
|
|
93
|
La reconstruction du nid et les coordinations inter-individuelles chez Bellicositermes natalensis et Cubitermes sp. La theorie de la stigmergie: Essai d'interpretation des termites constructeurs
– Grasse
- 1959
|
|
60
|
Garcia-Luna-Aceves. Securing distance-vector routing protocols
– Smith, Murphy, et al.
- 1997
|
|
43
|
Efficient protocols for signing routing messages
– Zhang
- 1998
|
|
43
|
Theraulaz Swarm Intelligence: From Natural to Artificial Systems Swarm Intelligence Oxford
– Bonabeau, Dorigo, et al.
- 1999
|
|
21
|
Emergent Algorithms: A New Method for Enhancing Survivability in Unbounded Systems
– Fisher, Lipson
- 1999
|
|
20
|
Two Ant Colony Algorithms for Best-effort Routing in Datagram Networks
– Caro, Dorigo
- 1998
|
|
15
|
Antnet: Distributed stigmergic control for communication networks
– Caro, Dorigo
- 1998
|
|
15
|
efficient and Inefficient Ant Coverage Methods
– Koenig, Szymanski, et al.
- 2001
|
|
15
|
An Experimental Study of Insider Attacks for the OSPF Routing Protocol, published
– Vetter, Wang
|
|
9
|
Anthill: a Framework for the Design and Analysis of Peer-to-Peer Systems
– Montresor
- 2001
|
|
9
|
Routing with swarm intelligence
– White
- 1997
|
|
8
|
A distributed Intrusion Detection and Response System based on mobile autonomous agents using social insects communication paradigm
– Fenet, Hassas
- 2001
|
|
3
|
Distributed Operating Systems
– Tanebaum
- 1995
|
|
3
|
Computer Vertex-Ant-Walk – A robust method for efficient exploration of faulty graph
– Yanovski, Wagner, et al.
- 2001
|
|
2
|
J.Bruten and L.Rothkrantz. Ant-based load balancing in telecommunications networks
– Schoonderwoerd
- 1996
|
|
1
|
Przygienda and Gene Tsudik. Lowering security overhead in link state routing. Computer Networks, Volume 31 Number 8
– Hauser, Tony
- 1999
|
|
1
|
OMNeT++: a discrete event simulation tool. http://www.hit.bme.hu/phd/vargaa/omnetpp .htm
– Varga
|
|
1
|
AntNet: Distributed Stigmergic Control for Communications Networks
– Care
- 1998
|
|
1
|
Two Ant Colony Algorithms for Best-effort Routing in Datagram Networks
– Care
- 1998
|
|
1
|
Hassas. A distributed Intrusion Detection and Res19onse System Based on mobile autonomous agents' using social insects' communication paradigm
– Fenet, Salima
- 2001
|
|
1
|
Reconstruction du hid et les Coordinations Inter-lndividuelles chez Bellicositermes Natalensis et Cubitermes sly. La thdorie de la Stigmergie: Essai d'interprdtation du Comportement des Termites Constructeurs
– Grass6
- 1959
|
|
1
|
An Experimental Study of lnsider Attacks for the OSPF Routing Protocol
– Vetter, Wang, et al.
- 1997
|
