Gossiping with interference in radio chain networks (upper bound algorithms)

Jean-Claude Bermond (1) , Takako Kodate (2) , Joseph Yu (3)

1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
2 TWCU - Tokyo Woman's Christian University
3 Department of Mathematics and Statistics [Fraser Valley]

In this paper, we study the problem of gossiping with interference constraint in radio chain networks. Gossiping (or total exchange information) is a protocol where each node in the network has a message and wants 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 efficient algorithms that attain this makespan.

Domaines: Algorithme et structure de données [cs.DS]; Mathématique discrète [cs.DM]; Réseaux et télécommunications [cs.NI]

Jean-Claude Bermond, Takako Kodate, Joseph Yu. Gossiping with interference in radio chain networks (upper bound algorithms). JCDCG-3 - 22th Japan Conference on Discrete and Computational Geometry, Graphs, and Games, Sep 2019, Tokyo, Japan. ⟨hal-02316854⟩