Skip to Main content Skip to Navigation
Conference papers

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
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : 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.
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download

https://hal.inria.fr/hal-02316854
Contributor : Jean-Claude Bermond Connect in order to contact the contributor
Submitted on : Tuesday, October 15, 2019 - 3:58:03 PM
Last modification on : Monday, November 23, 2020 - 4:28:38 PM
Long-term archiving on: : Friday, January 17, 2020 - 12:26:05 PM

File

abstractBKY2019.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02316854, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

83

Files downloads

405