1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - 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 :
Document type :
Journal articles
Domain :

Cited literature [17 references]

https://hal.archives-ouvertes.fr/hal-00429191
Contributor : Jean-Claude Bermond <>
Submitted on : Sunday, November 1, 2009 - 8:21:02 PM
Last modification on : Tuesday, November 17, 2020 - 11:18:04 PM
Long-term archiving on: : Thursday, June 17, 2010 - 6:56:13 PM

### File

BFPP07.pdf
Files produced by the author(s)

### Identifiers

• 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⟩

Record views