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

agentsRandom walksDistributed algorithmsMobile networksMobile computingAd hoc wireless networksMobileRandom spanning treeSelf-stabilizing algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)

Related Items (1)

Self-stabilizing algorithm for high service availability in spite of concurrent topology changes in ad hoc mobile networks

This page was built for publication: A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks.