Geodesic
Gossiping with interference in radio ring networks
Discrete mathematics & theoretical computer science, Tome 25 (2023-2024) no. 2.

Voir la notice de l'article provenant de la source Episciences

In this paper, we study the problem of gossiping with interference constraint in radio ring networks. Gossiping (or total exchange information) is a protocol where each node in the network has a message and is expected to distribute its own message to every other node in the network. The gossiping problem consists in finding the minimum running time (makespan) of a gossiping protocol and algorithms that attain this makespan. We focus on the case where the transmission network is a ring network. We consider synchronous protocols where it takes one unit of time (step) to transmit a unit-length message. During one step, a node receives at most one message only through one of its two neighbors. We also suppose that, during one step, a node cannot be both a sender and a receiver (half duplex model). Moreover communication is subject to interference constraints. We use a primary node interference model where, if a node receives a message from one of its neighbors, its other neighbor cannot send at the same time. With these assumptions we completely solve the problem for ring networks. We first show lower bounds and then give gossiping algorithms which meet these lower bounds and so are optimal. The number of rounds depends on the congruences of n modulo 12.
DOI : 10.46298/dmtcs.9399
Classification : 68Mxx 
@article{DMTCS_2024_25_2_a5,
     author = {Bermond, Jean-Claude and Kodate, Takako and Yu, Joseph},
     title = {Gossiping with interference in radio ring networks},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {25},
     number = {2},
     year = {2023-2024},
     doi = {10.46298/dmtcs.9399},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.9399/}
}
TY  - JOUR
AU  - Bermond, Jean-Claude
AU  - Kodate, Takako
AU  - Yu, Joseph
TI  - Gossiping with interference in radio ring networks
JO  - Discrete mathematics & theoretical computer science
PY  - 2023-2024
VL  - 25
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.9399/
DO  - 10.46298/dmtcs.9399
LA  - en
ID  - DMTCS_2024_25_2_a5
ER  - 
%0 Journal Article
%A Bermond, Jean-Claude
%A Kodate, Takako
%A Yu, Joseph
%T Gossiping with interference in radio ring networks
%J Discrete mathematics & theoretical computer science
%D 2023-2024
%V 25
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.9399/
%R 10.46298/dmtcs.9399
%G en
%F DMTCS_2024_25_2_a5
Bermond, Jean-Claude; Kodate, Takako; Yu, Joseph. Gossiping with interference in radio ring networks. Discrete mathematics & theoretical computer science, Tome 25 (2023-2024) no. 2. doi : 10.46298/dmtcs.9399. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.9399/

Cité par Sources :