Efficient symmetry breaking in multi-channel radio networks

DOI10.1007/978-3-642-33651-5_17MaRDI QIDQ4909415zbMATH OpenOpenAlexFDO

Authors Sebastian Daum, Fabian Kuhn, Calvin Newport

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

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)

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

Cited in

(5)

• Bounded information dissemination in multi-channel wireless networks
• Contention resolution on a fading channel
• Scalable wake-up of multi-channel single-hop radio networks
• Token traversal in ad hoc wireless networks via implicit carrier sensing
• A new kind of selectors and their applications to conflict resolution in wireless multichannels 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)