Gossiping with interference in radio chain networks (upper bound algorithms) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

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

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.
Fichier principal
Vignette du fichier
abstractBKY2019.pdf (133.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02316854 , version 1 (15-10-2019)

Identifiers

  • HAL Id : hal-02316854 , version 1

Cite

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⟩
48 View
77 Download

Share

Gmail Facebook X LinkedIn More