On the complexity of radio communication
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The Wakeup Problem in Synchronous Broadcast Systems
SIAM Journal on Discrete Mathematics
Deterministic Broadcasting Time in Radio Networks of Unknown Topology
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Broadcasting in undirected ad hoc radio networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
Round Robin is optimal for fault-tolerant broadcasting on wireless networks
Journal of Parallel and Distributed Computing
Distributed construction of connected dominating set in wireless ad hoc networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
SIAM Journal on 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
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Zigzag decoding: combating hidden terminals in wireless networks
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Neighbor discovery in mobile ad hoc networks using an abstract MAC layer
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Decomposing broadcast algorithms using abstract MAC layers
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Reliable neighbor discovery for mobile ad hoc networks
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Regional consecutive leader election in mobile ad-hoc networks
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Chameleon-MAC: adaptive and self-algorithms for media access control in mobile ad hoc networks
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Self organization and self maintenance of mobile ad hoc networks through dynamic topology control
Architecting dependable systems VII
MAC design for analog network coding
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Optimal regional consecutive leader election in mobile ad-hoc networks
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Leveraging channel diversity to gain efficiency and robustness for wireless broadcast
DISC'11 Proceedings of the 25th international conference on Distributed computing
Asynchronous leader election and MIS using abstract MAC layer
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
Bounds on contention management in 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
Decomposing broadcast algorithms using abstract MAC layers
Ad Hoc Networks
Reliable neighbor discovery for mobile ad hoc networks
Ad Hoc Networks
Hi-index | 0.00 |
A diversity of possible communication assumptions complicates the study of algorithms and lower bounds for radio networks. We address this problem by defining an Abstract MAC Layer. This service provides reliable local broadcast communication, with timing guarantees stated in terms of a collection of abstract delay functions applied to the relevant contention. Algorithm designers can analyze their algorithms in terms of these functions, independently of specific channel behavior. Concrete implementations of the Abstract MAC Layer over basic radio network models generate concrete definitions for these delay functions, automatically adapting bounds proven for the abstract service to bounds for the specific radio network under consideration. To illustrate this approach, we use the Abstract MAC Layer to study the new problem of Multi-Message Broadcast, a generalization of standard single-message broadcast, in which any number of messages arrive at any processes at any times. We present and analyze two algorithms for Multi-Message Broadcast in static networks: a simple greedy algorithm and one that uses regional leaders. We then indicate how these results can be extended to mobile networks.