Randomized information dissemination in dynamic environments

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
Main Authors: Soh, De Wen, Tay, Wee Peng, Quek, Tony Q. S.
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2019
Subjects:
Distributed Algorithms
Gossip
DRNTU::Engineering::Electrical and electronic engineering
Online Access:https://hdl.handle.net/10356/89751
http://hdl.handle.net/10220/48059
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
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.

Similar Items