Multiple communication im multihop radio networks
SIAM Journal on Computing
Journal of Computer and System Sciences
A mutual exclusion algorithm for ad hoc mobile networks
Wireless Networks
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
A verification framework for hybrid systems
A verification framework for hybrid systems
Algorithmic aspects of radio communication
Proceedings of the fifth international workshop on Foundations of mobile computing
Zigzag decoding: combating hidden terminals in wireless networks
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
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
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Reliable neighbor discovery for mobile ad hoc networks
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
On efficient gossiping in radio networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Time-efficient randomized multiple-message broadcast in radio networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
MAC design for analog network coding
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
Stochastic restricted broadcast process theory
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
Asynchronous leader election and MIS using abstract MAC layer
FOMC '12 Proceedings of the 8th International Workshop on Foundations of Mobile Computing
Distributed multiple-message broadcast in wireless ad-hoc networks under the SINR model
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Bounded-contention coding for wireless networks in the high SNR regime
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Bounds on contention management in radio networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
The cost of radio network broadcast for different models of unreliable links
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 |
In much of the theoretical literature on wireless algorithms, issues of message dissemination are considered together with issues of contention management. This combination leads to complicated algorithms and analysis, and makes it difficult to extend the work to harder communication problems. In this paper, we present results of a current project aimed at simplifying such algorithms and analysis by decomposing the treatment into two levels, using abstract "MAC layer" specifications to encapsulate the contention management. We use two different abstract MAC layers: the basic one of [14, 15] and a new probabilistic layer. We first present a typical randomized contention-manageent algorithm for a standard graph-based radio network model We show that it implements both abstract MAC layers. We combine this algorithm with greedy algorithms for single-message and multi-message global broadcast and analyze the combination, using both abstract MAC layers as intermediate layers. Using the basic MAC layer, we prove a bound of O(D log(n/∈) log Δ) for the time to deliver a single message everywhere with probability 1 -- ∈, where D is the network diameter, n is the number of nodes, and Δ is the maximum node degree. Using the probabilistic layer, we prove a bound of O((D + log(n/∈)) log Δ), which matches the best previously-known bound for single-message broadcast over the physical network model. For multi-message broadcast, we obtain bounds of O((D + kΔ) log(n/∈) log Δ) using the basic layer and O((D + kΔ log(n/∈)) log Δ) using the probabilistic layer, for the time to deliver a message everywhere in the presence of at most k concurrent messages.