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 : In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbor at a time, broadcasting takes at least $\lceil \log_2 N \rceil$ rounds in a network of $N$ nodes. In the neighborhood broadcasting problem, the node that is broadcasting needs to inform only its neighbors. In a binary hypercube with $N$ nodes, each node has $\log_2 N$ neighbors, so neighborhood broadcasting takes at least $\lceil \log_2 \log_2 (N+1) \rceil$ rounds. In this paper, we present asymptotically optimal neighborhood broadcast protocols for binary hypercubes.
Keywords :
Type de document :
Article dans une revue
Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2007, 21 (4), pp.823-843
Domaine :

https://hal.archives-ouvertes.fr/hal-00429191
Contributeur : Jean-Claude Bermond <>
Soumis le : dimanche 1 novembre 2009 - 20:21:02
Dernière modification le : dimanche 1 novembre 2009 - 22:01:22
Document(s) archivé(s) le : jeudi 17 juin 2010 - 18:56:13

### Fichier

BFPP07.pdf
Fichiers produits par l'(les) auteur(s)

### Identifiants

• HAL Id : hal-00429191, version 1

### Citation

Jean-Claude Bermond, Afonso Ferreira, Stéphane Pérennes, Joseph Peters. Neighbourhood Broadcasting in Hypercubes. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2007, 21 (4), pp.823-843. <hal-00429191>

Consultations de
la notice

## 276

Téléchargements du document