Improvements in the time complexity of two message-optimal election algorithms
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
An optimal snap-stabilizing wave algorithm in arbitrary graphs
Computer Communications
Distributed Graph Traversals by Relabelling Systems with Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic flooding for efficient information dissemination in random graph topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Random walk with jumps in large-scale random geometric graphs
Computer Communications
Bandwidth reservation for bursty traffic in the presence of resource availability uncertainty
Computer Communications
Location of central nodes in time varying computer networks
Operations Research Letters
Distributed algorithms for network diameter and girth
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Self-stabilizing distributed data fusion
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
A distributed clustering algorithm for large-scale dynamic networks
Cluster Computing
Efficient distributed source detection with limited bandwidth
Proceedings of the 2013 ACM symposium on Principles of distributed computing
International Journal of Grid and Utility Computing
WSN simulation model with a complex systems approach
Proceedings of the 2013 Summer Computer Simulation Conference
| Hi-index | 754.84 |
A unified approach to the formal description and validation of several distributed protocols is presented. After introducing two basic protocols, a series of known and new protocols for connectivity test, shortest path, and path updating are described and validated. All protocols are extended to networks with changing topology.