A multiple random walks based self-stabilizingk-exclusion algorithm in ad hoc networks

DOI10.1080/17445760903313415zbMath1200.68031OpenAlexW1972523234MaRDI QIDQ3557561

Olivier Flauzac, Alain Bui, Thibault Bernard, Florent Nolot

Publication date: 23 April 2010

Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17445760903313415

zbMATH Keywords

random walkdistributed algorithmad hoc networkself-stabilization

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Token-based self-stabilizing uniform algorithms
• Self-stabilizing dynamic mutual exclusion for mobile ad hoc networks
• Self-stabilizing systems in spite of distributed control
• A tight upper bound on the cover time for random walks on graphs
• Self-Stabilization by Counter Flushing
• A tight lower bound on the cover time for random walks on graphs
• On a random walk problem arising in self-stabilizing token management
• Principles of Distributed Systems
• A mutual exclusion algorithm for ad hoc mobile networks