Initializing sensor networks of non-uniform density in the weak sensor model
From MaRDI portal
Publication:494934
DOI10.1007/s00453-014-9905-5zbMath1319.68155OpenAlexW2054310477MaRDI QIDQ494934
Miguel A. Mosteiro, Martín Farach-Colton
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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic recurrent communication in restricted sensor networks
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
- Probabilistic algorithms for the wake-up problem in single-hop radio networks
- Coverage problems in sensor networks
- Bootstrapping a hop-optimal network in the weak sensor model
- Distributed connectivity of wireless networks
- Lower Bounds for Clear Transmissions in Radio Networks
- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks
- Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
- Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
This page was built for publication: Initializing sensor networks of non-uniform density in the weak sensor model