ACM Home Page
Please provide us with feedback. Feedback
Multicasting in delay tolerant networks: a social network perspective
Full text PdfPdf (1.20 MB)
Source
International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing table of contents
New Orleans, LA, USA
SESSION: Information dissemination and location service table of contents
Pages 299-308  
Year of Publication: 2009
ISBN:978-1-60558-624-3
Authors
Wei Gao  The Pennsylvania State University, University Park, PA, USA
Qinghua Li  The Pennsylvania State University, University Park, PA, USA
Bo Zhao  The Pennsylvania State University, University Park, PA, USA
Guohong Cao  The Pennsylvania State University, University Park, PA, USA
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 71,   Downloads (12 Months): 253,   Citation Count: 1
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/1530748.1530790
What is a DOI?

ABSTRACT

Node mobility and end-to-end disconnections in Delay Tolerant Networks (DTNs) greatly impair the effectiveness of data dissemination. Although social-based approaches can be used to address the problem, most existing solutions only focus on forwarding data to a single destination. In this paper, we are the first to study multicast in DTNs from the social network perspective. We study multicast in DTNs with single and multiple data items, investigate the essential difference between multicast and unicast in DTNs, and formulate relay selections for multicast as a unified knapsack problem by exploiting node centrality and social community structures. Extensive trace-driven simulations show that our approach has similar delivery ratio and delay to the Epidemic routing, but can significantly reduce the data forwarding cost measured by the number of relays used.


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
 
2
J. Burgess, B. Gallagher, D. Jensen, and B. Levine. Maxprop: Routing for vehicle-based disruption-tolerant networks. Proc. INFOCOM, 2006.
 
3
4
5
6
 
7
P. Greenwood and M. Nikulin. A Guide to Chi-Squared Testing. Wiley-Interscience, 1996.
 
8
W. Hsu and A. Helmy. On Nodal Encounter Patterns in Wireless LAN Traces. Proc. International Workshop On Wireless Network Measurement (WiNMee), 2006.
9
10
 
11
S. Ioannidis, A. Chaintreau, and L. Massoulie. Optimal and scalable distribution of content updates over a mobile social network. Proc. INFOCOM, 2009.
 
12
U. Lee, S.-Y. Oh, K.-W. Lee, and M. Gerla. Scalable multicast routing in delay tolerant networks. Proc. ICNP, 2008.
13
 
14
P. Marsden. Egocentric and sociocentric measures of network centrality. Social Networks, 24(4):407--422, 2002.
 
15
 
16
S. Milgram. The small world problem. Psychology Today, 2(1):60--67, 1967.
17
 
18
G. Palla, I. Derényi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435(7043):814--818, 2005.
19
20
21
 
22
A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, 2000.
 
23
D. Watts and S. Strogatz. Collective dynamics of "small-world" networks. Nature, 393:440--442, 1998.
24
25
26


Collaborative Colleagues:
Wei Gao: colleagues
Qinghua Li: colleagues
Bo Zhao: colleagues
Guohong Cao: colleagues