The APRAM: incorporating asynchrony into the PRAM model
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Randomized distributed shortest paths algorithms
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Shortest paths and loop-free routing in dynamic networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Automatic reconfiguration in Autonet
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Adapting to asynchronous dynamic networks (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Piecemeal graph exploration by a mobile robot (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Computing almost shortest paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A faster distributed protocol for constructing a minimum spanning tree
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Computing almost shortest paths
ACM Transactions on Algorithms (TALG)
Size-restricted cluster formation and cluster maintenance technique for mobile ad hoc networks
International Journal of Network Management
Extension of pairwise broadcast clock synchronization for multicluster sensor networks
EURASIP Journal on Advances in Signal Processing
Efficient and accurate localization in multihop networks
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Secure clustering and symmetric key establishment in heterogeneous wireless sensor networks
EURASIP Journal on Wireless Communications and Networking - Special issue on security and resilience for smart devices and applications
Navigating in a Graph by Aid of Its Spanning Tree Metric
SIAM Journal on Discrete Mathematics
Distributed computation for swapping a failing edge
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Optimal clock synchronization under energy constraints in wireless ad-hoc networks
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Efficient distributed breadth-first search algorithm
Computer Communications
Distributed algorithms for the constrained routing problem in computer networks
Computer Communications
Constructing sensor barriers with minimum cost in wireless sensor networks
Journal of Parallel and Distributed Computing
On distributed file tree walk of parallel file systems
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Link failure recovery technique for greedy routing in the hyperbolic plane
Computer Communications
Network lifetime maximization for time-sensitive data gathering in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 754.84 |
A new distributed algorithm is presented for constructing breadth first search (BFS) trees. A BFS tree is a tree of shortest paths from a given root node to all other nodes of a network under the assumption of unit edge weights; such trees provide useful building blocks for a number of routing and control functions in communication networks. The order of communication complexity for the new algorithm isO(V^{1.6} + E)whereVis the number of nodes and E the number of edges. For dense networks withE geq V^{1.6}this order of complexity is optimum.