Message and time efficient multi-broadcast schemes
From MaRDI portal
Publication:2513670
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.
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
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Approximation algorithms for connected dominating sets
- Broadcasting in UDG radio networks with unknown topology
- Distributed algorithms for depth-first search
- Distributed backbone structure for algorithms in the SINR model of wireless networks
- Distributed broadcast in radio networks of unknown topology.
- Distributed broadcast in unknown radio networks
- Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
- Efficient algorithms for leader election in radio networks
- Efficient distributed communication in ad-hoc radio networks
- Energy efficient randomised communication in unknown AdHoc networks
- Fast broadcasting and gossiping in radio networks
- Faster Centralized Communication in Radio Networks
- Faster communication in known topology radio networks
- Lower bounds on information dissemination in dynamic networks
- Many-to-many communication in radio networks
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- On the effect of the deployment setting on broadcasting in Euclidean radio networks
- Optimal deterministic broadcasting in known topology radio networks
- Optimal gossiping in geometric radio networks in the presence of dynamical faults
- The capacity of wireless networks
- The e-mail gossip number and the connected domination number
- Time efficient \(k\)-shot broadcasting in known topology radio networks
Cited in
(11)- ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS
- On further reducing the cost of parallel pipelined message broadcasts
- Broadcasting multiple messages in simultaneous send/receive systems
- Message Multicasting in Heterogeneous Networks
- Broadcasting multiple messages in the 1-in port model in optimal time
- scientific article; zbMATH DE number 1292975 (Why is no real title available?)
- Using adaptive timeouts to achieve at-most-once message delivery
- Handling message semantics with Generic Broadcast protocols
- Labeling schemes for deterministic radio multi-broadcast
- Energy-efficient broadcasting in ad hoc wireless networks
- Minimum-time multidrop broadcast
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)
