The interconnection network considered in this paper is the complete WK-Recursive network that
demonstrates many attractive properties, such as high degree of regularity, symmetry and efficient
communication. Chen and Duh have proposed a distributed stack-base broadcasting algorithm for the
complete WK-Recursive networks [Networks, 24 (1994) 303-317]. To perform this algorithm, a stack of
O(log N) elements, where N is the number of nodes, to keep the labels of links is included in each
message. Moreover, as a node receives the message, a series of O(log N) pop and push operations on
the stack is required. In this paper, we present a novel broadcasting algorithm for the complete WKRecursive
network, which is much simpler and requires only constant data included in each message
and constant time to determine the neighbors to forward the message.
