Name
Abstract | ||
|---|---|---|
Information diffusion is efficient via gossip or rumor spreading in many of the next generation networks. It is of great importance to select some seed nodes as information sources in a network so as to maximize the gossip spreading. In this paper, we deal with the issue of the selection of information sources, which are initially informed nodes (i.e., seed nodes) in a network, for pull-based gossip protocol. We prove that the gossip spreading maximization problem (GSMP) is NP-hard. We establish a temporal mapping of the gossip spreading process using virtual coupon collectors by leveraging the concept of temporal network, further prove that the gossip spreading process has the property of submodularity, and consequently propose a greedy algorithm for selecting the information sources, which yields a suboptimal solution within (1 - 1/e) of the optimal value for GSMP. Experiments are carried out to study the spreading performance, illustrating the significant superiority of the greedy algorithm over heuristic and random algorithms. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1155/2015/276014 | INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS |
Field | DocType | Volume |
Heuristic,Next-generation network,Computer science,Rumor,Gossip,Computer network,Greedy algorithm,Gossip protocol,Maximization,Distributed computing | Journal | 11 |
ISSN | Citations | PageRank |
1550-1329 | 1 | 0.36 |
References | Authors | |
21 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| dong wenxiang | 1 | 103 | 7.55 |
| ying yang | 2 | 2 | 0.71 |
| Wenyi Zhang | 3 | 705 | 62.34 |