Gossiping with interference in radio ring networks
In this paper, we study the problem of gossiping with interference constraint in radio ring networks. Gossiping (or total exchange information) is a protocol where each node in the network has a message and is expected to distribute its own message to every other node in the network. The gossiping p...
Saved in:
| Main Authors: | Jean-Claude Bermond, Takako Kodate, Joseph Yu |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2023-10-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | http://dmtcs.episciences.org/9399/pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
From branchings to flows: a study of an Edmonds' like property to arc-disjoint branching flows
by: Cláudio Carvalho, et al.
Published: (2023-05-01) -
About the determinant of complete non-ambiguous trees
by: Jean-Christophe Aval
Published: (2024-11-01) -
Adapting vs. Pre-training Language Models for Historical Languages
by: Enrique Manjavacas, et al.
Published: (2022-06-01) -
A Comparison: The Science of Mathematics vs. The Science of Math
by: Georgia Southern University
Published: (2025-01-01) -
Generic HTR Models for Medieval Manuscripts. The CREMMALab Project
by: Ariane Pinche
Published: (2023-10-01)