Bootstrapping a hop-optimal network in the weak sensor model

DOI10.1145/1597036.1597040zbMath1298.68040OpenAlexW2032355069MaRDI QIDQ2930263

Miguel A. Mosteiro, Martín Farach-Colton, Rohan Jude Fernandes, Rohan J. Fernandes

Publication date: 18 November 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1597036.1597040

zbMATH Keywords

ad hoc networkradio networkmaximal independent setsensor networkrandom geometric graphscontention resolutionweak sensor model

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (2)

Initializing sensor networks of non-uniform density in the weak sensor model ⋮ Deterministic recurrent communication in restricted sensor networks

This page was built for publication: Bootstrapping a hop-optimal network in the weak sensor model