Skip to Main content Skip to Navigation
Conference papers

Gossiping with interference in radio chain networks

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 metadatas

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-01960744
Contributor : Jean-Claude Bermond <>
Submitted on : Wednesday, December 19, 2018 - 3:21:42 PM
Last modification on : Monday, November 23, 2020 - 4:30:38 PM
Long-term archiving on: : Wednesday, March 20, 2019 - 11:18:12 PM

File

abstractrev.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01960744, version 1

Collections

Citation

Jean-Claude Bermond, Takako Kodate, Joseph Yu. Gossiping with interference in radio chain networks. 21th Japan Conference on Discrete and Computational Geometry, Graphs, and Games, Sep 2018, Manila, Philippines. ⟨hal-01960744⟩

Share

Metrics

Record views

98

Files downloads

53