We consider broadcasting on asynchronous anonymous totally unoriented N - node hypercubes. First we generalize a technique, introduced in , for partial broadcasting and orientation. Using this technique we develop a broadcasting algorithm on unoriented hypercubes that uses only linear number of bits and runs in optimal time. This gives a positive answer to the question raised in  whether O(N) bits are sufficient for broadcasting on unoriented N-node hypercubes. It is also an improvement over the previous algorithms from [3, 1] both in time and bit complexities. As an application of broadcasting, we develop an algorithm for computing identities of all nodes in unoriented hypercubes with linear number of messages. (The question was stated in ). This allows every subset of nodes (such as covers, independent sets, etc) to be determined in O(N) messages
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.