By Topic

A heuristic for k-broadcasting in arbitrary 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

2 Author(s)
H. A. Harutyunyan ; Dept. of Comput. Sci., Concordia Univ., Montreal, Que., Canada ; Bin Shao

We present a heuristic algorithm for k-broadcasting in an arbitrary network. This heuristic generates optimal k-broadcast time in grid graph when k≥2. In two-dimensional torus graph, it also generates optimal k-broadcast time when k≥3, while giving a bound of m/2+n/2+1 when k=2, where m and n are the number of rows and columns in the graph. In practice, the new heuristic outperforms best known 1-broadcast algorithm for three different network design models. The new algorithm runs fast. The time complexity of the algorithm is O(R · m), where R represents the rounds of broadcasting, and m stands for the total number of edges in the graph.

Published in:

Information Visualization, 2003. IV 2003. Proceedings. Seventh International Conference on

Date of Conference:

16-18 July 2003