Wormhole Broadcast in Star Graph networks

We propose a new broadcasting algorithm in star graph connected networks with wormhole routing. We use the usual single-port communication model with intermediate node reception capability where a node can communicate with a single neighbor at any instant of time. Lower bound under the model is derived and efficient algorithms are developed to achieve broadcasting in O(n) communication time in a star graph Sn (with n! nodes which is sublogarithmic in the number of nodes in the network)