Efficient symmetry breaking in multi-channel radio networks

DOI10.1007/978-3-642-33651-5_17zbMATH Open1377.68019OpenAlexW1797332061MaRDI QIDQ4909415FDOQ4909415

Fabian Kuhn, Calvin Newport, Sebastian Daum

Publication date: 13 March 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33651-5_17

Recommendations

• Scalable wake-up of multi-channel single-hop radio networks
• A better wake-up in radio networks
• Maximal independent sets in multichannel radio networks
• Automata, Languages and Programming
• The Wake‐Up Problem in MultiHop Radio Networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cited In (6)

• Bounded information dissemination in multi-channel wireless networks
• Contention resolution on a fading channel
• Token traversal in ad hoc wireless networks via implicit carrier sensing
• Scalable wake-up of multi-channel single-hop radio networks
• A new kind of selectors and their applications to conflict resolution in wireless multichannels networks
• Leveraging multiple channels in ad hoc networks

This page was built for publication: Efficient symmetry breaking in multi-channel radio networks

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