MINT: Maximizing information propagation in predictable delay-tolerant network

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn , Issue , 2013, Pages 253-256

  Tang, Shaojie ^a   Yuan, Jing ^b   Li, Xiang Yang ^c   Wang, Yu ^d   Wang, Cheng ^e   Liu, Xuefeng ^f  

^a Temple University   (United States)

^b University of Illinois   (United States)

^c Illinois Institute of Technology   (United States)

^d University of North Carolina at Charlotte   (United States)

^e TONGJI UNIVERSITY   (China)

^f HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

DTN; Propagation; Submodular; Temporal

Indexed keywords

BUDGET CONSTRAINT; DELAY-TOLERANT NETWORK; DTN; INFLUENCE MAXIMIZATIONS; INFORMATION PROPAGATION; INTERACTING PROCESS; SUBMODULAR; TEMPORAL;

COSTS; MOBILE AD HOC NETWORKS; WAVE PROPAGATION;

DELAY TOLERANT NETWORKS;

EID: 84883046514     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2491288.2491317     Document Type: Conference Paper

References (15)

1. D. Kempe, J. Kleinberg, and É. Tardos, "Maximizing the spread of influence through a social network," in KDD. ACM, 2003, pp. 137-146.
2. S. Tang, J. Yuan, X. Mao, X.-Y. Li, W. Chen, and G. Dai, "Relationship classification in large scale online social networks and its impact on information propagation," in INFOCOM 2011. IEEE, 2011, pp. 2291-2299.
3. P. Domingos and M. Richardson, "Mining the network value of customers," in KDD. ACM, 2001, pp. 57-66.
4. A. Chaintreau, P. Fraigniaud, and E. Lebhar, "Opportunistic spatial gossip over mobile social networks," in Proceedings of the first workshop on Online social networks. ACM, 2008, pp. 73-78.
5. F. Chierichetti, S. Lattanzi, and A. Panconesi, "Gossiping (via mobile?) in social networks," in Proceedings of the fifth international workshop on Foundations of mobile computing. ACM, 2008, pp. 27-28.
6. W. Zhao, M. Ammar, and E. Zegura, "Multicasting in delay tolerant networks: semantic models and routing algorithms," in Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking. ACM, 2005, pp. 268-275.
7. W. Gao, Q. Li, B. Zhao, and G. Cao, "Multicasting in delay tolerant networks: a social network perspective," in Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing. ACM, 2009, pp. 299-308.
8. T. Y. Berger-Wolf, "Maximizing the extent of spread in a dynamic network," 2007.
9. B. Han, P. Hui, V. A. Kumar,M. V. Marathe, J. Shao, and A. Srinivasan, "Mobile data offloading through opportunistic communications and social participation," TMC, vol. 11, no. 5, pp. 821-834, 2012.
10. Q. Yuan, I. Cardei, and J. Wu, "Predict and relay: an efficient routing in disruption-tolerant networks," in Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing. ACM, 2009, pp. 95-104.
11. X. Zhang, J. Kurose, B. N. Levine, D. Towsley, and H. Zhang, "Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing," in Proceedings of the 13th annual ACM international conference on Mobile computing and networking. ACM, 2007, pp. 195-206.
12. J. Goldenberg, B. Libai, and E. Muller, "Talk of the network: A complex systems look at the underlying process of word-of-mouth," Marketing letters, vol. 12, no. 3, pp. 211-223, 2001.
13. G. etal., "Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata," Academy of Marketing Science Review, vol. 9, no. 3, pp. 1-18, 2001.
14. S. Khullera, A. Mossb, and J. Naor, "The budgeted maximum coverage problem," Information Processing Letters, vol. 70, pp. 39-45, 1999.
15. V. Srinivasan, M. Motani, and W. T. Ooi, "Analysis and implications of student contact patterns derived from campus schedules," in MobiCom. ACM, 2006, pp. 86-97.