@inbook{d2b634a6da4e4dfabdda7a3544de915f,
title = "Deterministic M2M multicast in radio networks (extended abstract)",
abstract = "We study the problem of exchanging messages within a fixed group of k nodes, in an n-node multi-hop radio network, also known as the problem of Multipoint-to-Multipoint (M2M) multicasting. While the radio network topology is known to all nodes, we assume that the participating nodes are not aware of each other's positions. We give a new fully distributed deterministic algorithm for the M2M multicasting problem, and analyze its complexity. We show that if the maximum distance between any two out of fc participants is d then this local information exchange problem can be solved in time O(d log2 n + k log3 n). Hence our algorithm is linear in the size of the subnetwork induced by the participating nodes and only polylogarithmic in the size of the entire radio network.",
author = "Leszek G{\c a}sieniec and Evangelos Kranakis and Andrzej Pelc and Qin Xin",
note = "Copyright: Copyright 2020 Elsevier B.V., All rights reserved.",
year = "2004",
doi = "10.1007/978-3-540-27836-8_57",
language = "English (US)",
isbn = "3540228497",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "670--682",
editor = "Josep D{\'i}az and Juhani Karhum{\"a}ki and Arto Lepist{\"o} and Donald Sannella",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
}