{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T05:19:44Z","timestamp":1779254384752,"version":"3.51.4"},"reference-count":34,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T00:00:00Z","timestamp":1427846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China (973 Program)","doi-asserted-by":"crossref","award":["2012CB316004"],"award-info":[{"award-number":["2012CB316004"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China (973 Program)","doi-asserted-by":"crossref","award":["61379003"],"award-info":[{"award-number":["61379003"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2012CB316004"],"award-info":[{"award-number":["2012CB316004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61379003"],"award-info":[{"award-number":["61379003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Distributed Sensor Networks"],"published-print":{"date-parts":[[2015,4,1]]},"abstract":"<jats:p> 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 [Formula: see text] 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. <\/jats:p>","DOI":"10.1155\/2015\/276014","type":"journal-article","created":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T15:42:33Z","timestamp":1428507753000},"page":"276014","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Selection of Information Sources for Gossip Spreading"],"prefix":"10.1177","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0272-1069","authenticated-orcid":false,"given":"Wenxiang","family":"Dong","sequence":"first","affiliation":[{"name":"Department of Electronic Engineering and Information Science, University of Science and Technology of China, Hefei 230027, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3876-9515","authenticated-orcid":false,"given":"Ying","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering and Information Science, University of Science and Technology of China, Hefei 230027, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4227-0749","authenticated-orcid":false,"given":"Wenyi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Electronic Engineering and Information Science, University of Science and Technology of China, Hefei 230027, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2015,4,7]]},"reference":[{"key":"B1-2015-276014","doi-asserted-by":"publisher","DOI":"10.1080\/15501320601067725"},{"key":"B2-2015-276014","doi-asserted-by":"publisher","DOI":"10.1145\/1454503.1454541"},{"key":"B3-2015-276014","doi-asserted-by":"publisher","DOI":"10.1109\/infcom.2011.5935157"},{"key":"B4-2015-276014","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.15"},{"key":"B5-2015-276014","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/151795"},{"key":"B6-2015-276014","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/504581"},{"key":"B7-2015-276014","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892324"},{"key":"B8-2015-276014","volume-title":"Gossip Algorithms","author":"Shah D.","year":"2009"},{"key":"B9-2015-276014","doi-asserted-by":"publisher","DOI":"10.1002\/dac.1224"},{"key":"B10-2015-276014","doi-asserted-by":"publisher","DOI":"10.1002\/int.21528"},{"key":"B12-2015-276014","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2007.909171"},{"key":"B13-2015-276014","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.11.001"},{"key":"B14-2015-276014","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9245-4"},{"key":"B15-2015-276014","first-page":"1623","volume-title":"Proceedings of 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '12)","author":"Giakkoupis G."},{"key":"B16-2015-276014","doi-asserted-by":"publisher","DOI":"10.1109\/allerton.2012.6483387"},{"key":"B17-2015-276014","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"B18-2015-276014","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"B19-2015-276014","doi-asserted-by":"publisher","DOI":"10.1145\/1859934.1859943"},{"key":"B20-2015-276014","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"B21-2015-276014","first-page":"333","volume-title":"Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '98)","author":"Wilfong G."},{"key":"B22-2015-276014","first-page":"1107","volume-title":"Proceedings of the 31st IEEE International Conference on Computer Communications (INFOCOM '12)","author":"Golrezaei N."},{"key":"B23-2015-276014","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.03.001"},{"key":"B24-2015-276014","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"B25-2015-276014","doi-asserted-by":"publisher","DOI":"10.1007\/bf01588971"},{"key":"B26-2015-276014","volume-title":"Facility Location: Applications and Theory","author":"Drezner Z.","year":"2004"},{"issue":"1","key":"B27-2015-276014","first-page":"235","volume":"9","author":"Krause A.","year":"2008","journal-title":"Journal of Machine Learning Research"},{"key":"B28-2015-276014","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.110903"},{"key":"B29-2015-276014","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"B30-2015-276014","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"B31-2015-276014","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"B32-2015-276014","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"B33-2015-276014","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.021544898"},{"key":"B34-2015-276014","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"B35-2015-276014","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478"}],"container-title":["International Journal of Distributed Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1155\/2015\/276014","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/full-xml\/10.1155\/2015\/276014","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1155\/2015\/276014","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T06:30:49Z","timestamp":1620282649000},"score":1,"resource":{"primary":{"URL":"http:\/\/journals.sagepub.com\/doi\/10.1155\/2015\/276014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,1]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,4,1]]}},"alternative-id":["10.1155\/2015\/276014"],"URL":"https:\/\/doi.org\/10.1155\/2015\/276014","relation":{},"ISSN":["1550-1477","1550-1477"],"issn-type":[{"value":"1550-1477","type":"print"},{"value":"1550-1477","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,1]]}}}