Gossiping with interference in radio chain networks - Archive ouverte HAL Access content directly
Conference Papers Year :

Gossiping with interference in radio chain networks

(1) , (2) , (3)
1
2
3

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
abstractrev.pdf (33.43 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01960744 , version 1 (19-12-2018)

Identifiers

  • HAL Id : hal-01960744 , version 1

Cite

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⟩
82 View
41 Download

Share

Gmail Facebook Twitter LinkedIn More