On the stability of the Ethernet
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
Journal of the ACM (JACM)
Analysis of backoff protocols for multiple access channels
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Data Transfers in Broadcast Networks
IEEE Transactions on Computers
Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
Secure hypergraphs: privacy from partial broadcast
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Gossiping in a Distributed Network
IEEE Transactions on Computers
Consensus and collision detectors in wireless Ad Hoc networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Efficient broadcasting using network coding
IEEE/ACM Transactions on Networking (TON)
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
Radio network distributed algorithms in the unknown neighborhood model
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Radio networks with reliable communication
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Algorithms for channel assignment in mobile wireless networks using temporal coloring
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
| Hi-index | 0.01 |
A radio network is a synchronous network of processors that communicate by transmitting messages to their neighbors. A processor receives a message in a given step if and only if it is silent then and precisely one of its neighbors transmits. This stringent rule poses serious difficulties in performing even the simplest tasks. This is true even under the overly optimistic assumptions of centralized coordination and complete knowledge of the network topology. This paper is concerned with lower and upper bounds for the complexity of realizing various communication primitives for radio networks.Our first result deals with the broadcast operation. We prove the existence of a family of radius-2 networks on n vertices for which any broadcast schedule requires at least &OHgr;(log2 n) rounds of transmissions. This matches an upper bound of O(log2 n) rounds for networks of radius 2 proved earlier by Bar-Yehuda, Goldreich and Itai [BGI]. It is worth mentioning that this lower bound holds even under optimal centralized coordination, while the (randomized) algorithm of [BGI] is distributed.We then look at the question of simulating two of the standard message-passing models on a radio network. Both models can easily simulate the radio model with no overhead. In the other direction, we propose and study a primitive called the single-round simulation (SRS), enabling the simulation of a single round of an algorithm designed for the standard message models. We give lower bounds for the length of SRS schedules for both models, and supply constructions or existence proofs for schedules of matching (or almost matching) lengths.Finally we give tight bounds for the length of schedules for computing census functions on a radio network.