TY - GEN
T1 - Dynamic Multiple-Message broadcast
T2 - 2014 10th ACM International Workshop on Foundations of Mobile Computing, FOMC 2014
AU - Kowalski, Dariusz R.
AU - Mosteiro, Miguel A.
AU - Rouse, Tevin
N1 - Publisher Copyright:
Copyright 2014 ACM.
PY - 2014/8/11
Y1 - 2014/8/11
N2 - 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, the affectance function and the chosen BFS tree. The combination of these characteristics influence the performance of broadcasting with affectance (modulo a polylogarithmic function). We also carry out simulations of our protocol instantiating affectance in the Radio Network model. 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.
AB - 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, the affectance function and the chosen BFS tree. The combination of these characteristics influence the performance of broadcasting with affectance (modulo a polylogarithmic function). We also carry out simulations of our protocol instantiating affectance in the Radio Network model. 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.
KW - Affectance
KW - Multiple-Message Broadcast
KW - Radio Network
UR - http://www.scopus.com/inward/record.url?scp=84937679674&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84937679674&partnerID=8YFLogxK
U2 - 10.1145/2634274.2634279
DO - 10.1145/2634274.2634279
M3 - Conference contribution
AN - SCOPUS:84937679674
T3 - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
SP - 39
EP - 46
BT - FOMC 2014 - Proceedings of the 10th ACM International Workshop on Foundations of Mobile Computing, co-located with MobiHoc 2014
PB - Association for Computing Machinery
Y2 - 11 August 2014
ER -