Initializing sensor networks of non-uniform density in the weak sensor model

DOI10.1007/S00453-014-9905-5MaRDI QIDQ494934zbMATH OpenOpenAlexFDO

Authors Martin Farach-Colton, Miguel A. Mosteiro

Publication date 3 September 2015

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-014-9905-5

zbMATH Keywords

sensor networkstopology controlradio networksnetwork initializationweak sensor model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network protocols (68M12)

Recommendations

• Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
• Algorithms – ESA 2005
• Bootstrapping a hop-optimal network in the weak sensor model
• Low computation and low latency algorithms for distributed sensor network initialization
• Dense, concentric, and non-uniform multi-hop sensor networks
• Towards a dynamical model for wireless sensor networks
• Algorithmic Aspects of Wireless Sensor Networks
• Sensor network design for the estimation of spatially distributed processes
• Coverage by randomly deployed wireless sensor networks

Cites work

• scientific article; zbMATH DE number 1857647 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 6469247 (Why is no real title available?)
• scientific article; zbMATH DE number 3195515 (Why is no real title available?)
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• Bootstrapping a hop-optimal network in the weak sensor model
• Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
• Coverage problems in sensor networks: a survey
• Deterministic recurrent communication and synchronization in restricted sensor networks
• Deterministic recurrent communication in restricted sensor networks
• Distributed connectivity of wireless networks
• Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
• Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
• Lower Bounds for Clear Transmissions in Radio Networks
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Probabilistic algorithms for the wake-up problem in single-hop radio networks
• The bin-covering technique for thresholding random geometric graph properties
• Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism

Cited in

(4)

• Bootstrapping a hop-optimal network in the weak sensor model
• Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
• Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
• Algorithms – ESA 2005

This page was built for publication: Initializing sensor networks of non-uniform density in the weak sensor model

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