Identifying hostile nodes in networks using mobile agents
zbMATH Open1394.68017MaRDI QIDQ4584893FDOQ4584893
Authors: Euripides Markou 
Publication date: 4 September 2018
Full work available at URL: http://eatcs.org/beatcs/index.php/beatcs/article/view/52/48
Recommendations
- Searching for a black hole in arbitrary networks, optimal mobile agent protocols
- Complexity of searching for a black hole
- Searching for a Black Hole in Synchronous Tree Networks
- Mobile search for a black hole in an anonymous ring
- Hardness and approximation results for black hole search in arbitrary networks
computational complexitynetworksdistributed algorithmsfault tolerancegraph explorationmobile agentsdeterministic finite automatablack-hole search
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)
Cited In (9)
- CADbots: algorithmic aspects of manipulating programmable matter with finite automata
- On mobile agent verifiable problems
- Improved periodic data retrieval in asynchronous rings with a faulty host
- Shape recognition by a finite automaton robot
- More agents may decrease global work: a case in butterfly decontamination
- Improved periodic data retrieval in asynchronous rings with a faulty host
- Detection method of boundary malicious nodes in computer network
- Black hole search despite Byzantine agents
- Searching for a black hole in arbitrary networks, optimal mobile agent protocols
This page was built for publication: Identifying hostile nodes in networks using mobile agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584893)
