Information dissemination in highly dynamic graphs
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Complexity of Searching for a Black Hole
Fundamenta Informaticae
Searching for a Black Hole in Synchronous Tree Networks¶
Combinatorics, Probability and Computing
Mobile Search for a Black Hole in an Anonymous Ring
Algorithmica
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Hardness and approximation results for Black Hole Search in arbitrary networks
Theoretical Computer Science
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Map construction and exploration by mobile agents scattered in a dangerous network
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Scalable Routing in Cyclic Mobile Networks
IEEE Transactions on Parallel and Distributed Systems
Locating a Black Hole without the Knowledge of Incoming Link
Algorithmic Aspects of Wireless Sensor Networks
Synchronization Helps Robots to Detect Black Holes in Directed Graphs
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Exploration of Periodically Varying Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Locating and repairing faults in a network with mobile agents
Theoretical Computer Science
Searching for black-hole faults in a network using multiple agents
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
IEEE Communications Surveys & Tutorials
Rendezvous of mobile agents in unknown graphs with faulty links
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Time-varying graphs and dynamic networks
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
On the power of waiting when exploring public transportation systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Distributed computing in fault-prone dynamic networks
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
| Hi-index | 0.00 |
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where the local residents are not enthusiastic about the process and there is a limited ability to communicate amongst the mappers. More precisely, we study the problem of a team of asynchronous computational entities (the mapping agents) determining the location of black holes in a highly dynamic graph, whose edges are defined by the asynchronous movements of mobile entities (the subway carriers). We present and analyze a solution protocol. The algorithm solves the problem with the minimum number of agents possible. We also establish lower bounds on the number of carrier moves in the worst case, showing that our protocol is also move-optimal.