Randomized information dissemination in dynamic environments

Authors:
De Wen Soh;Wee Peng Tay;Tony Q. S. Quek
Affiliations:
Department of Electrical Engineering, Yale University, New Haven, CT and Institute for Infocomm Research, Singapore;Nanyang Technological University, Singapore;Singapore University of Technology and Design and the Institute for Infocomm Research, Singapore, Singapore
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2013

Citing 19
Cited 0

On spreading a rumor

SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Gossiping in minimal time

SIAM Journal on Computing
Broadcast in radio networks

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Randomized rumor spreading

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Gossip-Based Computation of Aggregate Information

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
A scheme for robust distributed sensor fusion based on average consensus

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Rapid rumor ramification: approximating the minimum broadcast time

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Rumor Spreading in Social Networks

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On the runtime and robustness of randomized broadcasting

Theoretical Computer Science
Distributed consensus algorithms in sensor networks with imperfect communication: link failures and channel noise

IEEE Transactions on Signal Processing
Bayesian detection in bounded height tree networks

IEEE Transactions on Signal Processing
On Mixing and Edge Expansion Properties in Randomized Broadcasting

Algorithmica - Special Issue: Algorithms and Computation; Guest Editor: Takeshi Tokuyama
Almost tight bounds for rumour spreading with conductance

Proceedings of the forty-second ACM symposium on Theory of computing
On the Impact of Node Failures and Unreliable Communications in Dense Sensor Networks

IEEE Transactions on Signal Processing
Randomized gossip algorithms

IEEE Transactions on Information Theory
Fast Distributed Algorithms for Computing Separable Functions

IEEE Transactions on Information Theory
Energy efficiency of dense wireless sensor networks: to cooperate or not to cooperate

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider randomized broadcast or information dissemination in wireless networks with switching network topologies. We show that an upper bound for the ε-dissemination time consists of the conductance bound for a network without switching, and an adjustment that accounts for the number of informed nodes in each period between topology changes. Through numerical simulations, we show that our bound is asymptotically tight.We apply our results to the case of mobile wireless networks with unreliable communication links and establish an upper bound for the dissemination time when the network undergoes topology changes and periods of communication link erasures.