# Optimal gathering algorithms in multi-hop radio tree networks with interferences.

1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network, a message can only be properly received if there is no interference from another message being simultaneously transmitted. The network is modeled as a graph, where the vertices represent the nodes and the edges, the possible communications. The interference constraint is modeled by a fixed integer $d_I \geq 1$, which implies that nodes within distance $d_I$ in the graph from one sender cannot receive messages from another node. In this paper, we suppose that it takes one unit of time (slot) to transmit a unit-length message. A step (or round) consists of a set of non interfering (compatible) calls and uses one slot. We present optimal algorithms that give minimum number of steps (delay) for the gathering problem with buffering possibility, when the network is a tree, the root is the destination and $d_I =1$. In fact we study the equivalent personalized broadcasting problem instead.
Type de document :
Communication dans un congrès
Springer Verlag. AD-HocNow 08, Sep 2008, Nice, France. 5198, pp.204-217, 2008, Lecture Notes in Computer Science
Domaine :

Littérature citée [16 références]

https://hal.archives-ouvertes.fr/hal-00512281
Contributeur : Jean-Claude Bermond <>
Soumis le : dimanche 29 août 2010 - 18:12:19
Dernière modification le : lundi 30 août 2010 - 08:36:58
Document(s) archivé(s) le : mardi 23 octobre 2012 - 15:16:24

### Fichier

BeYu08-1.pdf
Fichiers produits par l'(les) auteur(s)

### Identifiants

• HAL Id : hal-00512281, version 1

### Citation

Jean-Claude Bermond, Min-Li Yu. Optimal gathering algorithms in multi-hop radio tree networks with interferences.. Springer Verlag. AD-HocNow 08, Sep 2008, Nice, France. 5198, pp.204-217, 2008, Lecture Notes in Computer Science. 〈hal-00512281〉

Consultations de
la notice

## 302

Téléchargements du document
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.7979701161384583, "perplexity": 5313.787889740264}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2017-43/segments/1508187825889.47/warc/CC-MAIN-20171023092524-20171023112524-00814.warc.gz"}