ACM Home Page
Please provide us with feedback. Feedback
DL HomeProceedingsMobiComCHANTS '08Citation
Modelling data dissemination in opportunistic networks
Full text PdfPdf (225 KB)
Source
International Conference on Mobile Computing and Networking archive
Proceedings of the third ACM workshop on Challenged networks table of contents
San Francisco, California, USA
SESSION: Data and information forwarding table of contents
Pages 89-96  
Year of Publication: 2008
ISBN:978-1-60558-186-6
Authors
Chiara Boldrini  National Research Council (CNR), Pisa, Italy
Marco Conti  National Research Council (CNR), Pisa, Italy
Andrea Passarella  National Research Council (CNR), Pisa, Italy
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): 48,   Downloads (12 Months): 48,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1409985.1410002
What is a DOI?

ABSTRACT

In opportunistic networks data dissemination is an important, although not widely explored, topic. Since opportunistic networks topologies are very challenged and unstable, data-centric approaches are an interesting direction to pursue. Data should be proactively and cooperatively disseminated from sources towards possibly interested receivers, as sources and receivers might not be aware of each other, and never get in touch directly. In this paper we consider a utility-based cooperative data dissemination system in which the utility of data is defined based on the social relationships between users. Specifically, we study the performance of this system through an analytical model. Our model allows us to completely characterise the data dissemination process, as it describes both its stationary and transient regimes. After validating the model, we study the system's behaviour with respect to key parameters such as the definition of the data utility function, the initial data allocation on nodes, the number of users in the system, and the data popularity.


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. Balamash and M. Krunz. An overview of web caching replacement algorithms. IEEE Comm. Surv., 6(2):44--56, 2004.
 
2
A. Balasubramanian, B. N. Levine, and A. Venkataramani. Dtn routing as a resource allocation problem. ACM SIGCOMM, 2007.
 
3
C. Boldrini, M. Conti, and A. Passarella. Context and resource awareness in opportunistic network data dissemination. In IEEE AOC, 2008.
 
4
C. Boldrini, M. Conti, and A. Passarella. Modelling data dissemination in opportunistic networks. Tech. Rep., IIT-CNR, http://cnd.iit.cnr.it/andrea/tr/model-dd-tr.pdf, 2008.
 
5
R. Friedman, D. Gavidia, L. Rodrigues, A. C. Viana, and S. Voulgaris. Gossiping on MANETs: the beauty and the beast. SIGOPS Oper. Syst. Rev., 41(5):67--74, 2007.
 
6
H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, 2004.
 
7
M. Law and D. Kelton. Simulation Modeling and Analysis. McGraw-Hill, 2nd Ed., 1991.
 
8
V. Lenders, G. Karlsson, and M. May. Wireless Ad hoc Podcasting. In IEEE SECON, 2007.
 
9
L. Pelusi, A. Passarella, and M. Conti. Opportunistic Networking: data forwarding in disconnected mobile ad hoc networks. IEEE Comm. Magazine, 44(11), Nov. 2006.
 
10
H. Shen, M. Kumar, S. K. Das, and Z. Wang. Energy-efficient data caching and prefetching for mobile devices based on utility. Mob. Netw. Appl., 10(4):475--486, 2005.
 
11
L. Yin and G. Cao. Supporting cooperative caching in ad hoc networks. IEEE Trans. Mob. Comp., 5(1):77--89, 2006.
 
12
E. Yoneki, P. Hui, S. Chan, and J. Crowcroft. A socio-aware overlay for publish/subscribe communication in delay tolerant networks. In ACM MSWiM '07, pages 225--234, 2007.
 
13
W. Zhao, M. Ammar, and E. Zegura. Multicasting in delay tolerant networks: semantic models and routing algorithms. In ACM WDTN, 2005.

Collaborative Colleagues:
Chiara Boldrini: colleagues
Marco Conti: colleagues
Andrea Passarella: colleagues