Neighbourhood Broadcasting in Hypercubes - Archive ouverte HAL Access content directly
Journal Articles SIAM Journal on Discrete Mathematics Year : 2007

Neighbourhood Broadcasting in Hypercubes


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.
Fichier principal
Vignette du fichier
BFPP07.pdf (377.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00429191 , version 1 (01-11-2009)


  • HAL Id : hal-00429191 , version 1


Jean-Claude Bermond, Afonso Ferreira, Stéphane Pérennes, Joseph Peters. Neighbourhood Broadcasting in Hypercubes. SIAM Journal on Discrete Mathematics, 2007, 21 (4), pp.823-843. ⟨hal-00429191⟩
185 View
114 Download


Gmail Facebook Twitter LinkedIn More