We first introduce a LOCAL algorithm for finding light weight \((1+\varepsilon)\)-spanners for unit ball graphs in doubling spaces. We elaborate how it would be challenging to adjust this distributed algorithm to work in the CONGEST model, and we show how to overcome this challenge and design an algorithm with the same asymptotic round complexity in the CONGEST model.
(Joint work with David Eppstein.)