A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks.

DOI10.1016/S0743-7315(02)00028-XzbMath1048.68012WikidataQ58221875 ScholiaQ58221875MaRDI QIDQ1398776

D. Massart

Publication date: 7 August 2003

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

agents; Random walks; Distributed algorithms; Mobile networks; Mobile computing; Ad hoc wireless networks; Mobile; Random spanning tree; Self-stabilizing algorithms

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68W10: Parallel algorithms in computer science