Deterministic recurrent communication in restricted sensor networks
From MaRDI portal
Publication:764337
DOI10.1016/J.TCS.2011.10.018zbMATH Open1254.68054OpenAlexW2160510112MaRDI QIDQ764337FDOQ764337
Christopher Thraves, Miguel A. Mosteiro, Antonio Fernández Anta
Publication date: 13 March 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.10.018
Recommendations
- Deterministic recurrent communication and synchronization in restricted sensor networks
- On selection problem in radio networks
- A near optimal periodic transmission schedule in bounded degree wireless sensor network
- scientific article; zbMATH DE number 2061536
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
Mathematical problems of computer architecture (68M07) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Cites Work
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On selection problem in radio networks
- Approximate formulas for some functions of prime numbers
- Broadcasting algorithms in radio networks with unknown topology
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
- Title not available (Why is that?)
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deterministic broadcasting in ad hoc radio networks
- Bootstrapping a hop-optimal network in the weak sensor model
- Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
- Single round simulation on radio networks
- Title not available (Why is that?)
- Sensor Network Gossiping or How to Break the Broadcast Lower Bound
Cited In (5)
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
- Stable routing scheduling algorithms in multi-hop wireless networks
- Universal stability in multi-hop radio networks
- Initializing sensor networks of non-uniform density in the weak sensor model
- Title not available (Why is that?)
This page was built for publication: Deterministic recurrent communication in restricted sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764337)
