Deterministic recurrent communication in restricted sensor networks

DOI10.1016/J.TCS.2011.10.018MaRDI QIDQ764337zbMATH OpenOpenAlexFDO

Authors Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves

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

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

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

Cites work

• scientific article; zbMATH DE number 1670865 (Why is no real title available?)
• scientific article; zbMATH DE number 3831842 (Why is no real title available?)
• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 2038701 (Why is no real title available?)
• scientific article; zbMATH DE number 2089989 (Why is no real title available?)
• scientific article; zbMATH DE number 2119730 (Why is no real title available?)
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
• Approximate formulas for some functions of prime numbers
• Bootstrapping a hop-optimal network in the weak sensor model
• Broadcasting algorithms in radio networks with unknown topology
• Deterministic broadcasting in ad hoc radio networks
• Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
• On selection problem in radio networks
• 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)
• Sensor Network Gossiping or How to Break the Broadcast Lower Bound
• Single round simulation on radio networks

Cited in

(7)

• Deterministic recurrent communication and synchronization in restricted sensor networks
• A near optimal periodic transmission schedule in bounded degree wireless sensor network
• 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
• scientific article; zbMATH DE number 2061536 (Why is no real title available?)

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)