LocalCom: A community-based epidemic forwarding scheme in disruption-tolerant networks

2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2009

Volumn , Issue , 2009, Pages

  Li, Feng ^a   Wu, Jie ^a  

^a Florida Atlantic Univ   (United States)

Author keywords

Community detection; Disruption tolerant networks (DTNs); Forwarding process; Gateways; Localized algorithms; Social network analysis

Indexed keywords

COMMUNITY DETECTION; DISRUPTION-TOLERANT NETWORKS (DTNS); FORWARDING PROCESS; GATEWAYS; LOCALIZED ALGORITHMS; SOCIAL NETWORK ANALYSIS;

AD HOC NETWORKS; COMMUNICATION; ELECTRIC NETWORK ANALYSIS; ELECTRIC NETWORK TOPOLOGY; PARALLEL ALGORITHMS; SENSOR NETWORKS; SENSORS; SOCIAL SCIENCES;

GATEWAYS (COMPUTER NETWORKS);

EID: 70449556569     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SAHCN.2009.5168942     Document Type: Conference Paper

References (17)

1. J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau. CRAWDAD data set cambridge/haggle (v. 2006-09-15). http://crawdad.cs.dartmouth. edu/cambridge/haggle, September 2006.
2. N. Eagle and A. Pentland. CRAWDAD data set MIT/reality (v. 2005- 07-01). http://crawdad.cs.dartmouth.edu/mit/reality, July 2005.
3. A. Chaintreau, P. Hui, C. Diot, R. Gass, and J. Scott. Impact of human mobility on opportunistic forwarding algorithms. IEEE Transactions on Mobile Computing, 6(6):606-620, 2007.
4. E. Daly and M. Haahr. Social network analysis for routing in disconnected delay-tolerant MANETs. In Proc. of ACM MobiHoc, 2007.
5. P. Hui, J. Crowcroft, and E. Yoneki. Bubble rap: Social-based forwarding in delay tolerant networks. In Proc. of ACM MobiHoc, 2008.
6. U. Luxburg. A tutorial on spectral clustering. Statistics and Computing, 17(4):395-416, 2007.
7. A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. In Technical Report CS-200006, Duke University, 2000.
8. T. Spyropoulos, K. Psounis, and C. Raghavendra. Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In Proc. of ACM SIGCOMM Workshop on DTNs, 2005.
9. J. Burgess, B. Gallagher, D. Jensen, and B. Levine. Maxprop: Routing for vehicle-based disruption-tolerant networks. In Proc. of IEEE INFOCOM, 2006.
10. A. Lindgren and A. Doria. Probabilistic routing protocol for intermittently connected networks. draft-lindgren-dtnrg-prophet-03, 2007.
11. W. Hsu, T. Spyropoulos, K. Psounis, and A. Helmy. Modeling timevariant user mobility in wireless mobile networks. In Proc. of IEEE INFOCOM, 2007.
12. N. Djukic, M. Piorkowski, and M. Grossglauser. Island hopping: Efficient mobility-assisted forwarding in partitioned networks. In Proc. of IEEE SECON, 2006.
13. P. Hui, E. Yoneki, S. Chan, and J. Crowcroft. Distributed community detection in delay tolerant networks. In Proc. of MobiArch, 2007.
14. F. Chung. Spectral Graph Theory. AMS Press, 1997.
15. J. Bondy and U. Murty. Graph theory with applications. American Elsevier Publishing Company, 1976.
16. L. Lovasz. Random walks on graphs: a survey. Combinatorics, Paul Erdos is eighty, 2:353-397, 1993.
17. P. Marsden. Egocentric and sociocentric measures of network centrality. Social Networks, 24(4):407-422, October 2002.