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 neighbour at a time, broadcasting takes at least ⌈log2 N⌉ rounds in a network of N nodes. In the neighbourhood broadcasting problem, the node that is broadcasting only needs to inform its neighbours. In a binary… (More)

6 Figures and Tables


  • Presentations referencing similar topics