Name
Abstract | ||
|---|---|---|
In this paper the problem of broadcasting in networks with weighted nodes is considered. This model is defined on networks in which nodes are assigned some weights representing the internal process or delay that they should perform before sending data to their neighboring nodes. This model has real world applications in parallel computation and satellite terrestrial networks. The problem is shown to be NP-complete. In this paper we present three algorithms to find near optimal broadcast time of an arbitrary network with weighted nodes. We also present our simulation results to compare the performance of these algorithms. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/ICPADS.2008.27 | ICPADS |
Keywords | Field | DocType |
weighted node,internal process,efficient broadcasting,neighboring node,simulation result,parallel computation,satellite terrestrial network,weighted nodes,optimal broadcast time,arbitrary network,real world application,satellites,computational complexity,computational modeling,np complete problem,broadcasting,parallel computer,greedy algorithms,algorithm design and analysis,networks | Broadcasting,NP-complete,Algorithm design,Computer science,Computer network,Greedy algorithm,Hierarchical network model,Satellite broadcasting,Computational complexity theory,Distributed computing | Conference |
Citations | PageRank | References |
2 | 0.41 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hovhannes A. Harutyunyan | 1 | 206 | 28.18 |
| Shahin Kamali | 2 | 112 | 15.41 |