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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 13-23 |
| Number of pages | 11 |
| Journal | Theoretical Computer Science |
| Volume | 569 |
| Issue number | C |
| DOIs | |
| State | Published - Jan 1 2015 |
| Externally published | Yes |
Fingerprint
Keywords
- Ad-hoc networks
- Broadcast and multi-broadcast
- Distributed algorithms
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)
Cite this
Message and time efficient multi-broadcast schemes. / Levin, Liron; Kowalski, Dariusz R.; Segal, Michael.
In: Theoretical Computer Science, Vol. 569, No. C, 01.01.2015, p. 13-23.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Message and time efficient multi-broadcast schemes
AU - Levin, Liron
AU - Kowalski, Dariusz R.
AU - Segal, Michael
PY - 2015/1/1
Y1 - 2015/1/1
N2 - 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.
AB - 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.
KW - Ad-hoc networks
KW - Broadcast and multi-broadcast
KW - Distributed algorithms
UR - http://www.scopus.com/inward/record.url?scp=84926363648&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84926363648&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2014.12.006
DO - 10.1016/j.tcs.2014.12.006
M3 - Article
AN - SCOPUS:84926363648
VL - 569
SP - 13
EP - 23
JO - Theoretical Computer Science
JF - Theoretical Computer Science
SN - 0304-3975
IS - C
ER -