Subscribe

London, England

July 16, 2003 to July 18, 2003

ISBN: 0-7695-1988-1

pp: 287

Hovhannes A. Harutyunyan , Concordia University

Bin Shao , Concordia University

ABSTRACT

In this paper, we present a heuristic algorithm for k-broadcasting in an arbitrary network. This heuristic generates optimal k-broadcast time in grid graph when k \ge 2. In two-dimensional torus graph, it also generates optimal k-broadcast time when k \ge 3, while giving a bound of \left[ {\frac{m} {2}} \right] + \left[ {\frac{n} {2}} \right] + 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 \cdot m), where R represents the rounds of broadcasting, and m stands for the total number of edges in the graph.

INDEX TERMS

null

CITATION

Hovhannes A. Harutyunyan,
Bin Shao,
"A Heuristic for k-Broadcasting in Arbitrary Networks",

*IV*, 2003, 2013 17th International Conference on Information Visualisation, 2013 17th International Conference on Information Visualisation 2003, pp. 287, doi:10.1109/IV.2003.1217992