A lower bound for radio broadcast
Journal of Computer and System Sciences
Journal of Computer and System Sciences
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
The wakeup problem in synchronous broadcast systems (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
The wake-up problem in multi-hop radio networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Ad hoc networks beyond unit disk graphs
Wireless Networks
Generalized framework for selectors with applications in optimal group testing
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Lower bounds for clear transmissions in radio networks
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Leader election in shared spectrum radio networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Maximal independent sets in multichannel radio networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We investigate the complexity of basic symmetry breaking problems in multihop radio networks with multiple communication channels. We assume a network of synchronous nodes, where each node can be awakened individually in an arbitrary time slot by an adversary. In each time slot, each awake node can transmit or listen (without collision detection) on one of multiple available shared channels. The network topology is assumed to satisfy a natural generalization of the well-known unit disk graph model. We study the classic wake-up problem and a new variant we call active wake-up. For the former we prove a lower bound that shows the advantage of multiple channels disappears for any network of more than one hop. For the active version however, we describe an algorithm that outperforms any single channel solution. We then extend this algorithm to compute a constant approximation for the minimum dominating set (MDS) problem in the same time bound. Combined, these results for the increasingly relevant multi-channel model show that it is often possible to leverage channel diversity to beat classic lower bounds, but not always.