A general broadcasting scheme for recursive networks with complete connection

Abstract

A recursive network can be constructed with basic building blocks in a recursive manner. For example the hypercube is a recursive network because an n-dimensional hypercube consists of two (n-1)-dimensional hypercubes. A recursive network is said to be with complete connection if the subnetwork that constitute it are connected as a complete graph. A general broadcasting scheme is proposed for recursive networks with complete connection. The scheme is simple, efficient, and easy to be implemented. Moreover, no redundant message will be generated. Four networks: WK-recursive networks, hypercomplete networks, hypernet networks, and star networks, are taken as examples to show the effectiveness of the scheme.