Linear Broadcasting and N loglog N Election in Unoriented Hypercubes

In this paper, we provide eecient broadcasting and election algorithms in unoriented hypercubes. First, O(N) broadcasting and traversing algorithms are introduced, where N is the number of hy-percube vertices. This answers aarmatively the open question stated in Tel95a] whether linear-message broadcasting and traversing can be achieved on hypercubes without sense of direction. Moreover, by exploiting new techniques we designed an O(N log log N) leader election algorithm. This is the rst known solution being able to exploit graph-theoretic properties of unoriented hypercubes such that it outperforms algorithms designed for general graphs GHS83].