ACM Home Page
Please provide us with feedback. Feedback
Distributed community detection in delay tolerant networks
Full text PdfPdf (287 KB)
Source
Mobility In The Evolving Internet Architecture archive
Proceedings of 2nd ACM/IEEE international workshop on Mobility in the evolving internet architecture table of contents
Kyoto, Japan
SESSION: Delay tolerant networks table of contents
Article No. 7  
Year of Publication: 2007
ISBN:978-1-59593-784-8
Authors
Pan Hui  University of Cambridge, Cambridge, United Kingdom
Eiko Yoneki  University of Cambridge, Cambridge, United Kingdom
Shu Yan Chan  University of Cambridge, Cambridge, United Kingdom
Jon Crowcroft  University of Cambridge, Cambridge, United Kingdom
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 90,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1366919.1366929
What is a DOI?

ABSTRACT

Community is an important attribute of Pocket Switched Networks (PSN), because mobile devices are carried by people who tend to belong to communities. We analysed community structure from mobility traces and used for forwarding algorithms [12], which shows significant impact of community. Here, we propose and evaluate three novel distributed community detection approaches with great potential to detect both static and temporal communities. We find that with suitable configuration of the threshold values, the distributed community detection can approximate their corresponding centralised methods up to 90% accuracy.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
A. Chaintreau et al. Impact of human mobility on the design of opportunistic forwarding algorithms. In Proc. INFOCOM, April 2006.
 
2
A. Clauset. Finding local community structure in networks. Physical Review E, 72:026132, 2005.
 
3
L. Danon, J. Duch, A. Diaz-Guilera, and A. Arenas. Comparing community structure identification, 2005.
 
4
C. Diot et al. Haggle project, http://www.haggleproject.org, 2004.
 
5
6
 
7
 
8
 
9
L. H. Hartwell, J. J. Hopfield, S. Leibler, and A. W. Murray. From molecular to modular cell biology. Nature, 402(6761 Suppl), December 1999.
10
 
11
P. Hui and J. Crowcroft. Bubble rap: Forwarding in small world dtns in ever decreasing circles. Technical Report UCAM-CL-TR-684, University of Cambridge, May 2007.
 
12
 
13
M. E. J. Newman. Analysis of weighted networks. Physical Review E, 70:056131, 2004.
14
 
15
J. Leguay et al. Evaluating mobility pattern space routing for DTNs. In Proc. INFOCOM, 2006.
16
 
17
A. Lindgren, A. Doria, and O. Schelen. Probabilistic routing in intermittently connected networks. In Proc. SAPIR, 2004.
 
18
D. Lusseau and M. E. J. Newman. Identifying the role that individual animals play in their social network. PROC. R. SOC. LONDON B, 271:S477, 2004.
19
 
20
 
21
M. Newman. Detecting community structure in networks. Eur. Phys. J. B, 38:321--330, 2004.
 
22
S. Okasha. Altruism, group selection and correlated interaction. British Journal for the Philosophy of Science, 56(4):703--725, December 2005.
 
23
G. Palla et al. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435(7043):814--818, 2005.
 
24
P. Jaccard. Bulletin de la Societe Vaudoise des Sciences Naturelles, 37:547, 1901.
25
 
26
A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, April 2000.

CITED BY  10

Collaborative Colleagues:
Pan Hui: colleagues
Eiko Yoneki: colleagues
Shu Yan Chan: colleagues
Jon Crowcroft: colleagues