Energy efficient alert in single-hop networks of extremely weak devices

DOI10.1016/J.TCS.2012.01.044zbMATH Open1247.68020OpenAlexW2079424072MaRDI QIDQ714773FDOQ714773

Authors: J. Zatopiański, Marek Klonowski, Mirosław Kutyłowski 

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.044

Recommendations

• The energy complexity of broadcast
• Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards
• Exponential separations in the energy complexity of leader election
• Efficient algorithms for leader election in radio networks
• Communication and energy efficient routing protocols for single-hop radio networks

zbMATH Keywords

sensor networkad hoc networkalert algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Cites Work

• Title not available (Why is that?)
• On selection problem in radio networks
• Probability and Computing
• Probabilistic algorithms for the wake-up problem in single-hop radio networks
• The wakeup problem in synchronous broadcast systems
• Adversary immune leader election in ad hoc radio networks
• Automata, Languages and Programming
• The Wake‐Up Problem in MultiHop Radio Networks
• A better wake-up in radio networks
• Title not available (Why is that?)

Cited In (2)

• Monitoring churn in wireless networks
• Beep-and-sleep: message and energy efficient set cover

This page was built for publication: Energy efficient alert in single-hop networks of extremely weak devices

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