Randomized Information Dissemination in Dynamic Environments

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...

Full description

Saved in:
Bibliographic Details
Published inIEEE/ACM transactions on networking Vol. 21; no. 3; pp. 681 - 691
Main Authors De Wen Soh, Wee Peng Tay, Quek, T. Q. S.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.06.2013
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Distributed algorithms
Fading
gossip
Information dissemination
Network topologies
Network topology
randomized broadcast
sensor networks
Stochastic processes
Switches
Topology
Upper bound
Wireless networks
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2012.2209676