Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
Yet another distributed depth-first-search algorithm
Information Processing Letters
A modular technique for the design of efficient distributed leader finding algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time and message bounds for election in synchronous and asynchronous complete networks
SIAM Journal on Computing
Elections in anonymous networks
Information and Computation
Introduction to distributed algorithms
Introduction to distributed algorithms
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Comparison of initial conditions for distributed algorithms on anonymous networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Exploring unknown undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Assigning labels in unknown anonymous networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Exploring Unknown Environments
SIAM Journal on Computing
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Mobile Agent Rendezvous in a Ring
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Tree exploration with little memory
Journal of Algorithms
Efficient Leader Election in Complete Networks
PDP '05 Proceedings of the 13th Euromicro Conference on Parallel, Distributed and Network-Based Processing
Optimal graph exploration without good maps
Theoretical Computer Science
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction
Theory of Computing Systems
The power of team exploration: two robots can learn unlabeled directed graphs
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Label-guided graph exploration by a finite automaton
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Distributed exploration of an unknown graph
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Space lower bounds for graph exploration via reduced automata
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
The problem of constructing a labeled map of an anonymous and asynchronous network is addressed. We present an algorithm that explores and maps the network by using k identical agents that have no prior knowledge of the network topology. An algorithm of Das, Flocchini, Nayak and Santoro for mapping of the network requires that n and k are co-prime. Our improved algorithm, presented here, requires at most O(m·logk) edge traversals, while theirs uses O(m·k) edge traversals (m is the number of edges in the network). The size of the whiteboard memory needed in our algorithm is the same as that used in DFNS algorithm O(logn). We employ techniques utilized in solutions to the Leader Election task, and introduce a modification to resolve issues of electing first “local leaders” among adjacent candidates, which otherwise may deadlock the process.