A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
A lower bound for radio broadcast
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Jamming-resistant Key Establishment using Uncoordinated Frequency Hopping
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
A log-star distributed maximal independent set algorithm for growth-bounded graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Secure communication over radio channels
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Efficient uncoordinated FHSS anti-jamming communication
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Reliable distributed computing on unreliable radio channels
Proceedings of the 2009 MobiHoc S3 workshop on MobiHoc S3
The wireless synchronization problem
Proceedings of the 28th ACM symposium on Principles of distributed computing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Structuring unreliable radio networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Leveraging channel diversity to gain efficiency and robustness for wireless broadcast
DISC'11 Proceedings of the 25th international conference on Distributed computing
Fast deterministic distributed maximal independent set computation on growth-bounded graphs
DISC'05 Proceedings of the 19th international conference on Distributed Computing
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
DISC'07 Proceedings of the 21st international conference on Distributed Computing
The Locality of Distributed Symmetry Breaking
FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
Efficient symmetry breaking in multi-channel radio networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Hi-index | 0.00 |
We present new upper bounds for fundamental problems in multichannel wireless networks. These bounds address the benefits of dynamic spectrum access, i.e., to what extent multiple communication channels can be used to improve performance. In more detail, we study a multichannel generalization of the standard graph-based wireless model without collision detection, and assume the network topology satisfies polynomially bounded independence. Our core technical result is an algorithm that constructs a maximal independent set (MIS) in O(log2 n/F)+ Õ(logn) rounds, in networks of size n with F channels, where the Õ-notation hides polynomial factors in log log n. Moreover, we use this MIS algorithm as a subroutine to build a constant-degree connected dominating set in the same asymptotic time. Leveraging this structure, we are able to solve global broadcast and leader election within O(D + log2 n/F + Õ(logn) rounds, where D is the diameter of the graph, and k-message multi-message broadcast in O(D + k + log2 n/F}\big)+Õ(logn) rounds for unrestricted message size (with a slow down of only a log factor on the k term under the assumption of restricted message size). In all five cases above, we prove: (a) our results hold with high probability (i.e., at least 1--1/n); (b) our results are within polyloglog factors of the relevant lower bounds for multichannel networks; and (c) our results beat the relevant lower bounds for single channel networks. These new (near) optimal algorithms significantly expand the number of problems now known to be solvable faster in multichannel versus single channel wireless networks.