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
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
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
On efficient gossiping in radio networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Hi-index | 0.00 |
In much of the theoretical literature on global broadcast algorithms for wireless networks, 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 more difficult communication problems. In this paper, we present results aimed at simplifying such algorithms and analysis by decomposing the treatment into two levels, using abstract ''MAC layer'' specifications to encapsulate contention management. We use two different abstract MAC layers: the basic layer of [1,2] and a new probabilistic layer. We first present a typical randomized contention-management algorithm for a standard graph-based radio network model and show that it implements both abstract MAC layers. Then we combine this algorithm with greedy algorithms for single-message and multi-message global broadcast and analyze the combinations, using both abstract MAC layers as intermediate layers. Using the basic MAC layer, we prove a bound of ODlogn@?log(@D) 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 @D is the maximum node degree. Using the probabilistic layer, we prove a bound of OD+logn@?log(@D), 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@D)logn@?log(@D) using the basic layer and OD+k@Dlogn@?log(@D) using the probabilistic layer, for the time to deliver a message everywhere in the presence of at most k concurrent messages.