Dynamic multiple-message broadcast: bounding throughput in the affectance model
From MaRDI portal
Abstract: We study a dynamic version of the Multiple-Message Broadcast problem, where packets are continuously injected in network nodes for dissemination throughout the network. Our performance metric is the ratio of the throughput of such protocol against the optimal one, for any sufficiently long period of time since startup. We present and analyze a dynamic Multiple-Message Broadcast protocol that works under an affectance model, which parameterizes the interference that other nodes introduce in the communication between a given pair of nodes. As an algorithmic tool, we develop an efficient algorithm to schedule a broadcast along a BFS tree under the affectance model. To provide a rigorous and accurate analysis, we define two novel network characteristics based on the network topology and the affectance function. The combination of these characteristics influence the performance of broadcasting with affectance (modulo a logarithmic function). We also carry out simulations of our protocol under affectance. To the best of our knowledge, this is the first dynamic Multiple-Message Broadcast protocol that provides throughput guarantees for continuous injection of messages and works under the affectance model.
Cites work
- A lower bound for radio broadcast
- Adversarial queuing on the multiple access channel
- An \Omega(D\log (N/D)) Lower Bound for Broadcast in Radio Networks
- Broadcast in the Ad Hoc SINR Model
- Broadcasting algorithms in radio networks with unknown topology
- Broadcasting in undirected ad hoc radio networks
- Distributed backbone structure for algorithms in the SINR model of wireless networks
- Distributed contention resolution in wireless networks
- Distributed deterministic broadcasting in uniform-power ad hoc wireless networks
- Distributed Online and Stochastic Queuing on a Multiple Access Channel
- Dynamic packet scheduling in wireless networks
- Efficient distributed communication in ad-hoc radio networks
- Faster communication in known topology radio networks
- scientific article; zbMATH DE number 5764877 (Why is no real title available?)
- scientific article; zbMATH DE number 6917148 (Why is no real title available?)
- scientific article; zbMATH DE number 1857647 (Why is no real title available?)
- Maximum throughput of multiple access channels in adversarial environments
- Multiple Communication in Multihop Radio Networks
- On selection problem in radio networks
- Optimal deterministic broadcasting in known topology radio networks
- Randomized broadcast in radio networks with collision detection
- Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
- Spanning trees with edge conflicts and wireless connectivity
- Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
- Time-efficient randomized multiple-message broadcast in radio networks
- Wireless Communication Is in APX
Cited in
(2)
This page was built for publication: Dynamic multiple-message broadcast: bounding throughput in the affectance model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174655)
