## Multiple Communication in Multi-Hop Radio Networks (1993)

Venue: | SIAM Journal on Computing |

Citations: | 65 - 1 self |

### BibTeX

@ARTICLE{Bar-yehuda93multiplecommunication,

author = {Reuven Bar-yehuda and Amos Israeli and Alon Itai},

title = {Multiple Communication in Multi-Hop Radio Networks},

journal = {SIAM Journal on Computing},

year = {1993},

volume = {22},

pages = {875--887}

}

### Years of Citing Articles

### OpenURL

### Abstract

Two tasks of communication in a multi-hop synchronous radio network are considered: point-to-point communication and broadcast (sending a message to all nodes of a network). Efficient protocols for both problems are presented. Even though the protocols are probabilistic, it is shown how to acknowledge messages deterministically. Let n, D, and Δ be the number of nodes, the diameter and the maximum degree of our network, respectively. Both protocols require a setup phase in which a BFS tree is constructed. This phase takes O ((n + Dlogn)logΔ) time. After the setup, k point-to-point transmissions require O ((k +D)logΔ) time on the average. Therefore the network allows a new transmission every O (logΔ) time slots. Also, k broadcasts require an average of O ((k +D)logΔlogn) time. Hence the average throughput of the network is a broadcast every O(logΔlogn) time slots. Both protocols pipeline the messages along the BFS tree. They are always successful on the graph spanned by the BFS tree. Their probabilistic behavior refers only to the running time. Using the above protocols the ranking problem is solved in O (nlognlogΔ) time. The performance analysis of both protocols constitutes a new application of queueing theory.

### Citations

263 |
Queueing Systems Volume 1: Theory
- Kleinrock
- 1975
(Show Context)
Citation Context ...obability λ that a new message appears at node D. The last model we introduce (model 4) is identical to the third but we assume that it is already in steady state in the sense of Queueing Theory (see =-=[14]-=-) and we define the expected completion time to be the expected . �stime for k additional messages to arrive at node D and then proceed to the root (node 0). 4.2.3 A tandem queue of Bernoulli servers.... |

243 |
Comparison Methods for Queues and Other Stochastic Models
- Stoyan
- 1983
(Show Context)
Citation Context ...T(b,M) ≤ t}. Taking probabilities P({M : T(a,M) ≤ t}) ≥ P({M : T(b,M) ≤ t}). In other words, j =0 Σt pj(a) ≥ Σ j =0 t p j(b). The last condition defines that T (a) is stochastically greater than T(b) =-=[15]-=-. In this case, �sE(T(a)) = Σ t =1 ∞ Σ j =t ∞ pj(a) ≤ Σ t =1 ∞ Σ j =t ∞ p j(b) = E (T (b)). Lemma 4.10 The expected completion time of model 3 is less than or equal to that of model 4. 13 Proof: In mo... |

167 |
A Perspective on Multiaccess Channels
- Gallager
- 1985
(Show Context)
Citation Context ...have also shown an Ω(n) lower bound for deterministic protocols. Thus, for this problem there exist randomized protocols that are much more efficient than any deterministic one. For D =2, Alon et al. =-=[1]-=- showed an Ω(log 2 n) lower bound, which matches the upper bound of [8] and [3]. In [4] Bar-Yehuda et al. discuss several models of radio communication and show how to detect conflicts and simulate a ... |

134 | A lower bound for radio broadcast
- ALON, BAR-NOY, et al.
- 1991
(Show Context)
Citation Context ...have also shown an Ω(n) lower bound for deterministic protocols. Thus, for this problem there exist randomized protocols that are much more efficient than any deterministic one. For D =2, Alon et al. =-=[1]-=- showed an Ω(log 2 n) lower bound, which matches the upper bound of [8] and [3]. In [4] Bar-Yehuda et al. discuss several models of radio communication and show how to detect conflicts and simulate a ... |

100 |
The wave expansion approach to broadcasting in multi-hop radio networks
- Chlamtac, Weinstein
- 1987
(Show Context)
Citation Context ...ents". Their acknowledgments are conducted in the absence of conflicts, which is achieved at the cost of increasing the time of a single point-to-point communication to O (DΔ). Chlamtac and Weinstein =-=[8]-=- presented a polynomial-time (centralized) algorithm for constructing a broadcast schedule which uses O (Dlog 2 n) time-slots. This centralized algorithm can be implemented in a ¤s3 distributed system... |

89 |
On broadcasting in radio networks problem analysis and protocol design
- Chlamtac, Kutten
- 1985
(Show Context)
Citation Context ... tree. Their probabilistic behavior refers only to the running time. The performance analysis of both protocols constitutes a new application of queueing theory. 1.3 Previous Work Chlamtac and Kutten =-=[7]-=- showed that, given a network and a designated source, finding an optimal broadcast schedule (i.e., broadcasting schedule which uses the minimum number of time-slots) is NP-Hard. They also routed mess... |

84 |
A.: On the time-complexity of broadcast in radio networks: an exponential gap between determinism and randomization
- Bar-Yehuda, Goldreich, et al.
- 1987
(Show Context)
Citation Context ...se in which radio networks can be initiated and the flexibility and modularity of their operation. A new approach for controlling the activity in multi-hop radio networks was presented in the work of =-=[3]-=-, where an efficient broadcast protocol is presented. Their method gives a new way of looking at radio networks. However, they do not provide protocols for many important network tasks. In the present... |

66 | Log-logarithmic selection resolution protocols in a multiple access channel - Willard - 1986 |

59 | The multi-tree approach to reliability in distributed networks
- Itai, Rodeh
- 1984
(Show Context)
Citation Context ...−1 messages, i.e., O ((n −1+D)logΔ) = O (nlogn) time. To record all this information each node must have sufficient storage to keep O (n) IDs. To save space (and time) we propose the following scheme =-=[13]-=-: After the BFS tree is completed, a depth-first-search (DFS) is conducted on the BFS tree. Henceforth, each node uses its DFS number as its ��� � �s16 address. Since the DFS numbers of the descendant... |

54 | Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
- Bar-Yehuda, Goldreich, et al.
- 1991
(Show Context)
Citation Context ...rks appear in Section 8. 2. The Setup Phase Our protocols require the existence of a basic communication subnetwork. This network consists of a leader which is a root of a BFS tree. Bar-Yehuda et al. =-=[4]-=- described how to find a leader in O ((loglogn) . n (D + ©§© log )logΔ) time. ε ¨s5 In [3] Bar-Yehuda et al. describe how to find a BFS tree. Their algorithm assumes that all nodes n wake up at time 0... |

25 |
Generalized TDMA: the multi-accessing tree protocol
- Capetanakis
- 1979
(Show Context)
Citation Context ... discuss several models of radio communication and show how to detect conflicts and simulate a single hop network. Thus they show how to use protocols designed for the ETHERNET in a multi-hop network =-=[6, 1]-=-. 1.4 Protocol Outline Both protocols depend on the existence of a BFS tree of the graph which is constructed in a setup phase. In the beginning of the setup part, a leader is chosen. Once the leader ... |

13 | Behavior of tandem buffers with geometric input and Markovian output - Hsu, Burke - 1976 |

10 | The Output of a Queuing System - Burke - 1956 |

5 |
A feedback-less distributed broadcast algorithm for multihop radio networks with time-varying structure
- Hofri
- 1987
(Show Context)
Citation Context ... −1 ), we get the following theorem Theorem 4.4 The expected number of time slots for k messages to reach the root is bounded by 32.27(k +D)logΔ. This constant can be improved using the techniques of =-=[11]-=-. 4.2.4 The expected completion time of model 3 is not greater than model 4. The difference between model 3 and 4 is that model 3 stipulates that initially all queues are empty, whereas in model 4 the... |

3 | Concurrent Communication among Multi-Transceiver Stations via Shared Media
- Birk
- 1986
(Show Context)
Citation Context ...em assuming the availability of special control channels, but the number of control messages sent may be quadratic in the number of nodes of the network [16]. to ours. In a different context, Y. Birk =-=[2]-=- independently discovered an acknowledgement mechanism similar Bar-Yehuda et al. [3] described a randomized single-source broadcast protocol. To ensure that with n probability 1−ε all nodes receive th... |

3 | The Ethernet data link layer and physical layer specification 1.0 - Digital-Intel-Xerox - 1980 |