Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
On the stability of the Ethernet
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Analysis of backoff protocols for multiple access channels
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A lower bound for radio broadcast
Journal of Computer and System Sciences
Journal of Computer and System Sciences
On optimal solutions to the firing squad synchronization problem
Theoretical Computer Science - Special issue on universal machines and computations
SIAM Journal on Computing
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
Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection
IEEE Transactions on Parallel and Distributed Systems
Oblivious gossiping in ad-hoc radio networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Assigning labels in an unknown anonymous network with a leader
Distributed Computing
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of 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
Brief announcement: efficient clustering in unstructured 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
Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
On selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Constant density spanners for wireless ad-hoc networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Adversarial queuing on the multiple-access channel
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Faster deterministic wakeup in multiple access channels
Discrete Applied Mathematics
Broadcasting in udg radio networks with unknown topology
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Communication in dynamic radio networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Local broadcasting in the physical interference model
Proceedings of the fifth international workshop on Foundations of mobile computing
Acknowledged broadcasting in ad hoc radio networks
Information Processing Letters
Broadcasting in dynamic radio networks
Journal of Computer and System Sciences
The wireless synchronization problem
Proceedings of the 28th ACM symposium on Principles of distributed computing
Coloring unstructured wireless multi-hop networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Self-stabilizing routing algorithms for wireless ad-hoc networks
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Consensus and mutual exclusion in a multiple access channel
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Decomposing broadcast algorithms using abstract MAC layers
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
On alarm protocol in wireless sensor networks
ADHOC-NOW'10 Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks
What is the use of collision detection (in wireless networks)?
DISC'10 Proceedings of the 24th international conference on Distributed computing
Improved lower bound for deterministic broadcasting in radio networks
Theoretical Computer Science
Adversarial Queuing on the Multiple Access Channel
ACM Transactions on Algorithms (TALG)
Beeping a maximal independent set
DISC'11 Proceedings of the 25th international conference on Distributed computing
Faster deterministic wakeup in multiple access channels
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
On the wake-up problem in radio networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Waking up anonymous ad hoc radio networks
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
Towards tight bounds for local broadcasting
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
Bounded-contention coding for wireless networks in the high SNR regime
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Efficient symmetry breaking in multi-channel radio networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Maximal independent sets in multichannel radio networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Connectivity and aggregation in multihop wireless networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Decomposing broadcast algorithms using abstract MAC layers
Ad Hoc Networks
| Hi-index | 0.00 |
We consider the problem of waking up n processors of a completely broadcast system. We analyze this problem in both globally and locally synchronous models, with or without n being known to processors and with or without labeling of processors. The main question we answer is: how fast we can wake all the processors up with probability 1 - 驴 in each of these eight models. In [10] a logarithmic waking algorithm for the strongest set of assumptions is described, while for weaker models only linear and quadratic algorithms were obtained. We prove that in the weakest model (local synchronization, no knowledge of n or labeling) the best waking time is O(n/ log n). We also show logarithmic or poly-logarithmic waking algorithms for all stronger models, which in some cases gives an exponential improvement over previous results.