Deterministic recurrent communication in restricted sensor networks

DOI10.1016/j.tcs.2011.10.018zbMath1254.68054OpenAlexW2160510112MaRDI QIDQ764337

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

zbMATH Keywords

lower bounddistributed algorithmsensor networkswireless broadcast

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Mathematical problems of computer architecture (68M07) Distributed systems (68M14)

Related Items (4)

Stable routing scheduling algorithms in multi-hop wireless networks ⋮ Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony ⋮ Universal stability in multi-hop radio networks ⋮ Initializing sensor networks of non-uniform density in the weak sensor model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Approximate formulas for some functions of prime numbers
• 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
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• Deterministic broadcasting in ad hoc radio networks
• On selection problem in radio networks
• An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
• Sensor Network Gossiping or How to Break the Broadcast Lower Bound
• Broadcasting algorithms in radio networks with unknown topology

This page was built for publication: Deterministic recurrent communication in restricted sensor networks