Maximal independent sets in multichannel radio networks

DOI10.1145/2484239.2484257zbMath1323.68418OpenAlexW2162438988MaRDI QIDQ5176112

Seth Gilbert, Calvin Newport, Mohsen Ghaffari, Sebastian Daum, Fabian Kuhn

Publication date: 2 March 2015

Published in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2484239.2484257

zbMATH Keywords

wireless networksconnected dominating setmaximal independent setmultichannelshared spectrum

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (8)

Bounded information dissemination in multi-channel wireless networks ⋮ Deterministic multi-channel information exchange ⋮ Leveraging multiple channels in ad hoc networks ⋮ Uniting General-Graph and Geometric-Based Radio Networks via Independence Number Parametrization ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Information exchange with collision detection on multiple channels ⋮ Dynamic networks of finite state machines ⋮ Fault-Tolerant Consensus with an Abstract MAC Layer.

This page was built for publication: Maximal independent sets in multichannel radio networks