Bootstrapping a hop-optimal network in the weak sensor model

DOI10.1145/1597036.1597040MaRDI QIDQ2930263zbMATH OpenOpenAlexFDO

Authors Martin Farach-Colton, Rohan Jude Fernandes, Miguel A. Mosteiro, 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

maximal independent setrandom geometric graphssensor networkcontention resolutionad hoc networkweak sensor modelradio network

Mathematics Subject Classification ID

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

Recommendations

• Algorithms – ESA 2005
• Initializing sensor networks of non-uniform density in the weak sensor model
• Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
• SOFSEM 2006: Theory and Practice of Computer Science
• Algorithmic Aspects of Wireless Sensor Networks

Cited in

(4)

• Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
• Initializing sensor networks of non-uniform density in the weak sensor model
• Algorithms – ESA 2005
• Deterministic recurrent communication in restricted sensor networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930263)