Transient community detection and its application to data forwarding in delay tolerant networks

Proceedings - International Conference on Network Protocols, ICNP

Volumn , Issue , 2013, Pages

  Zhang, Xiaomei ^a   Cao, Guohong ^a  

^a The Center for Nanotechnology Education and Utilization   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELAY TOLERANT NETWORKS; POPULATION DYNAMICS; WIRELESS NETWORKS;

CLUSTERING METHODS; COMMUNITY DETECTION; COMMUNITY-BASED; EVALUATION RESULTS; ITS APPLICATIONS; NETWORK OVERHEAD; PRACTICAL PROBLEMS; TEMPORAL INFORMATION;

NETWORK PROTOCOLS;

EID: 84896795580     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2013.6733594     Document Type: Conference Paper

References (28)

1. K. Fall, "A delay-tolerant network architecture for challenged internets," in Proc. ACM SIGCOMM. ACM, 2003, pp. 27-34.
2. E. Daly and M. Haahr, "Social network analysis for routing in disconnected delay-tolerant manets," in Proc. ACM MobiHoc. ACM, 2007, pp. 32-40.
3. W. Gao, G. Cao, T. La Porta, and J. Han, "On exploiting transient social contact patterns for data forwarding in delay tolerant networks," IEEE Transactions on Mobile Computing, vol. 12, no. 1, pp. 151-165, 2013.
4. W. Gao and G. Cao, "User-centric data dissemination in disruption tolerant networks," in INFOCOM, 2011 Proceedings IEEE, 2011, pp. 3119-3127.
5. P. Hui, J. Crowcroft, and E. Yoneki, "Bubble rap: Social-based forwarding in delay-tolerant networks," IEEE Transactions on Mobile Computing, vol. 10, no. 11, pp. 1576-1589, 2011.
6. P. Hui and J. Crowcroft, "How small labels create big improvements," in PerCom Workshops. IEEE, 2007, pp. 65-70.
7. N. Nguyen, T. Dinh, S. Tokala, and M. Thai, "Overlapping communities in dynamic networks: their detection and mobile applications," in Proc. ACM MobiCom. ACM, 2011, pp. 85-96.
8. W. Gao, Q. Li, B. Zhao, and G. Cao, "Multicasting in delay tolerant networks: a social network perspective," in Pro ACM MobiHoc. ACM, 2009, pp. 299-308.
9. M. McPherson, L. Smith-Lovin, and J. Cook, "Birds of a feather: Homophily in social networks," Annual review of sociology, pp. 415-444, 2001.
10. B. Han and A. Srinivasan, "Your friends have more friends than you do: identifying influential mobile users through random walks," in Proc. ACM MobiHoc. ACM, 2012, pp. 5-14.
11. Y. Zhang, W. Gao, G. Cao, T. La Porta, B. Krishnamachari, and A. Iyengar, "Social-aware data diffusion in delay tolerant manets," in Handbook of Optimization in Complex Networks: Communication and Social Networks. Springer, 2012, pp. 457-481.
12. Z. Zhu, G. Cao, S. Zhu, S. Ranjan, and A. Nucci, "A social network based patching scheme for worm containment in cellular networks," in INFOCOM 2009, IEEE, 2009, pp. 1476-1484.
13. S. Fortunato and C. Castellano, "Community structure in graphs," arXiv preprint arXiv:0712.2716, 2007.
14. S. Asur, S. Parthasarathy, and D. Ucar, "An event-based framework for characterizing the evolutionary behavior of interaction graphs," in Proc. ACM SIGKDD. ACM, 2007, pp. 913-921.
15. M. Newman, "Analysis of weighted networks," Physical Review E, vol. 70, no. 5, p. 056131, 2004.
16. Z. Lu, Y. Wen, and G. Cao, "Community detection in weighted networks: Algorithms and applications," in PerCom 2013, IEEE, 2013, pp. 179-184.
17. U. Raghavan, R. Albert, and S. Kumara, "Near linear time algorithm to detect community structures in large-scale networks," Physical Review E, vol. 76, no. 3, p. 036106, 2007.
18. G. Palla, I. Derényi, I. Farkas, and T. Vicsek, "Uncovering the overlapping community structure of complex networks in nature and society," Nature, vol. 435, no. 7043, pp. 814-818, 2005.
19. T. Henderson, D. Kotz, and I. Abyzov, "The changing usage of a mature campus-wide wireless network," in Proc. ACM MobiCom. ACM, 2004, pp. 187-201.
20. N. Eagle and A. Pentland, "Reality mining: sensing complex social systems," Personal and Ubiquitous Computing, vol. 10, no. 4, pp. 255-268, 2006.
21. M. McNett and G. Voelker, "Access and mobility of wireless pda users," ACM SIGMOBILE CCR, vol. 9, no. 2, pp. 40-55, 2005.
22. J. Hartigan and M. Wong, "Algorithm as 136: A k-means clustering algorithm," Applied statistics, pp. 100-108, 1979.
23. I. Dhillon, Y. Guan, and B. Kulis, "Kernel k-means: spectral clustering and normalized cuts," in Proc. ACM SIGKDD. ACM, 2004, pp. 551-556.
24. J. Friedman, T. Hastie, and R. Tibshirani, The elements of statistical learning. Springer Series in Statistics, 2001, vol. 1.
25. A. Vahdat, D. Becker et al., "Epidemic routing for partially connected ad hoc networks," Technical Report CS-200006, Duke University, Tech. Rep., 2000.
26. M. Newman and M. Girvan, "Finding and evaluating community structure in networks," Physical review E, vol. 69, no. 2, p. 026113, 2004.
27. G. Palla, A. Barabasi, and T. Vicsek, "Quantifying social group evolution," Nature, vol. 446, no. 7136, pp. 664-667, 2007.
28. A. Pietilänen and C. Diot, "Dissemination in opportunistic social networks: the role of temporal communities," in Proc. ACM MobiHoc. ACM, 2012, pp. 165-174.