Deterministic M2M multicast in radio networks (extended abstract)

Leszek Ga̧sieniec, Evangelos Kranakis, Andrzej Pelc, Qin Xin

Research output: Chapter in Book/Report/Conference proceedingChapter

16 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsJosep Díaz, Juhani Karhumäki, Arto Lepistö, Donald Sannella
PublisherSpringer Verlag
Pages670-682
Number of pages13
ISBN (Print)3540228497
DOIs
StatePublished - 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3142
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Deterministic M2M multicast in radio networks (extended abstract)'. Together they form a unique fingerprint.

Cite this