We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a deterministic algorithm for the gossiping problem that works in at most n units of time in any radio network of size n. This is an optimal algorithm in the sense that there exist radio network topologies, such as: a line, a star and a complete graph in which the radio gossiping cannot be completed in less then n units of time. Furthermore, we show that there isn't any radio network topology in which the gossiping task can be solved in time
CITATION STYLE
Ga̧sieniec, L., Potapov, I., & Xin, Q. (2004). Time efficient gossiping in known radio networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3104, 173–184. https://doi.org/10.1007/978-3-540-27796-5_16
Mendeley helps you to discover research relevant for your work.