By Topic

A novel broadcasting scheme for WK-recursive networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Jywe-Fei Fang ; Dept. of Comput. Sci. & Inf. Eng., St. John's & St. Mary's Inst. of Technol., Taiwan ; Guan-Joe Lai ; Yu-Chin Liu ; Sheau-Tyng Fang

Broadcasting which is a primitive communication problem is to distribute the same message from a source node to all other nodes. The topology considered in this paper is the WK-recursive network that demonstrates many attractive properties, such as high degree of regularity, symmetry and efficient communication. Particularly, for any specified number of degree, it can be expanded to arbitrary size level without reconfiguring the links. A stack-base broadcasting algorithm has been proposed for WK-recursive networks. To perform this algorithm, a stack of O(log N), where N is the number of nodes, to keep the labels of links is included in each message. Moreover, when a node receives a message, a series of pop and push operations on this stack of O(log N) time complexity are required. In this paper, we present a novel broadcasting scheme for WK-recursive networks, which is much simpler and requires only constant data included in each message and constant time to determine the neighbors to forward the message.

Published in:

Communications, Computers and signal Processing, 2003. PACRIM. 2003 IEEE Pacific Rim Conference on  (Volume:2 )

Date of Conference:

28-30 Aug. 2003