Broadcasting in dynamic radio networks

Authors:
Andrea E. F. Clementi;Angelo Monti;Francesco Pasquale;Riccardo Silvestri
Affiliations:
Dipartimento di Matematica, Università di Roma “Tor Vergata”, I-00133 Rome, Italy;Dipartimento di Informatica, “La Sapienza” Università di Roma, I-00133 Rome, Italy;Dipartimento di Matematica, Università di Roma “Tor Vergata”, I-00133 Rome, Italy;Dipartimento di Informatica, “La Sapienza” Università di Roma, I-00133 Rome, Italy
Venue:
Journal of Computer and System Sciences
Year:
2009

Citing 16
Cited 11

Scheduling algorithms for multihop radio networks

IEEE/ACM Transactions on Networking (TON)
On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization

Journal of Computer and System Sciences
Efficient communication strategies for ad-hoc wireless networks (extended abstract)

Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks

SIAM Journal on Computing
Deterministic broadcasting in unknown radio networks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Fast broadcasting and gossiping in radio networks

Journal of Algorithms
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Models and Techniques for Communication in Dynamic Networks

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Distributed broadcast in radio networks of unknown topology

Theoretical Computer Science
Simple Routing Strategies for Adversarial Systems

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Round Robin is optimal for fault-tolerant broadcasting on wireless networks

Journal of Parallel and Distributed Computing
Feasibility and complexity of broadcasting with random transmission failures

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Information dissemination in highly dynamic graphs

DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Reliable Broadcast in Wireless Mobile Ad Hoc Networks

HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 09
Radio communication in random graphs

Journal of Computer and System Sciences - Special issue on network algorithms 2005
Broadcasting algorithms in radio networks with unknown topology

Journal of Algorithms

Distributed computation in dynamic networks

Proceedings of the forty-second ACM symposium on Theory of computing
Broadcasting in unreliable radio networks

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Dynamic networks: models and algorithms

ACM SIGACT News
Coordinated consensus in dynamic networks

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Parsimonious flooding in geometric random-walks

DISC'11 Proceedings of the 25th international conference on Distributed computing
Flooding Time of Edge-Markovian Evolving Graphs

SIAM Journal on Discrete Mathematics
Optimal gossiping in geometric radio networks in the presence of dynamical faults

Networks
Distributed data possession checking for securing multiple replicas in geographically-dispersed clouds

Journal of Computer and System Sciences
Information spreading in dynamic graphs

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Bounded-contention coding for wireless networks in the high SNR regime

DISC'12 Proceedings of the 26th international conference on Distributed Computing
Lower bounds on information dissemination in dynamic networks

DISC'12 Proceedings of the 26th international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is reasonable to claim that almost all major questions related to radio broadcasting can be considered closed as far as static networks are considered: the network never changes during the entire protocol's execution. On the other hand, theoretical results on communication protocols in any scenario where the network topology may change during protocol's execution (i.e. a dynamic radio network) are very few. In this paper, we present a theoretical study of broadcasting in radio networks having dynamic unknown topology. The dynamic network is modeled by means of adversaries: we consider two of them. We first analyze an oblivious, memoryless random adversary that can be seen as the dynamic version of the average-case study presented by Elsasser and Gasieniec in JCSS, 2006. We then consider the deterministic worst-case adversary that, at each time slot, can make any network change (thus the strongest adversary). This is the dynamic version of the worst-case study provided by Bar-Yehuda, Goldreich and Itai in JCSS, 1992. In both cases we provide tight bounds on the completion time of randomized broadcast protocols.