Message and time efficient multi-broadcast schemes
From MaRDI portal
Publication:2513670
DOI10.1016/J.TCS.2014.12.006zbMATH Open1312.68023arXiv1310.4907OpenAlexW2104961825MaRDI QIDQ2513670FDOQ2513670
Authors: Liron Levin, Dariusz R. Kowalski, Michael Segal 
Publication date: 28 January 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Abstract: We consider message and time efficient broadcasting and multi-broadcasting in wireless ad-hoc networks, where a subset of nodes, each with a unique rumor, wish to broadcast their rumors to all destinations while minimizing the total number of transmissions and total time until all rumors arrive to their destination. Under centralized settings, we introduce a novel approximation algorithm that provides almost optimal results with respect to the number of transmissions and total time, separately. Later on, we show how to efficiently implement this algorithm under distributed settings, where the nodes have only local information about their surroundings. In addition, we show multiple approximation techniques based on the network collision detection capabilities and explain how to calibrate the algorithms' parameters to produce optimal results for time and messages.
Full work available at URL: https://arxiv.org/abs/1310.4907
Recommendations
- Time-efficient randomized multiple-message broadcast in radio networks
- Efficient distributed communication in ad-hoc radio networks
- Deterministic broadcasting in ad hoc radio networks
- Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model
- Time-efficient broadcast in radio networks
Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- Optimal deterministic broadcasting in known topology radio networks
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- The capacity of wireless networks
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- Approximation algorithms for connected dominating sets
- Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
- Faster communication in known topology radio networks
- Faster Centralized Communication in Radio Networks
- Energy efficient randomised communication in unknown AdHoc networks
- Time efficient \(k\)-shot broadcasting in known topology radio networks
- Distributed broadcast in radio networks of unknown topology.
- Distributed broadcast in unknown radio networks
- Fast broadcasting and gossiping in radio networks
- Efficient algorithms for leader election in radio networks
- Many-to-many communication in radio networks
- Lower bounds on information dissemination in dynamic networks
- Efficient distributed communication in ad-hoc radio networks
- Distributed backbone structure for algorithms in the SINR model of wireless networks
- On the effect of the deployment setting on broadcasting in Euclidean radio networks
- Broadcasting in UDG radio networks with unknown topology
- Distributed algorithms for depth-first search
- The e-mail gossip number and the connected domination number
- Optimal gossiping in geometric radio networks in the presence of dynamical faults
Cited In (11)
- Minimum-time multidrop broadcast
- Title not available (Why is that?)
- Broadcasting multiple messages in simultaneous send/receive systems
- ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS
- Labeling schemes for deterministic radio multi-broadcast
- Message Multicasting in Heterogeneous Networks
- Broadcasting multiple messages in the 1-in port model in optimal time
- Handling message semantics with Generic Broadcast protocols
- Energy-efficient broadcasting in ad hoc wireless networks
- On further reducing the cost of parallel pipelined message broadcasts
- Using adaptive timeouts to achieve at-most-once message delivery
This page was built for publication: Message and time efficient multi-broadcast schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2513670)
