ACM Home Page
Please provide us with feedback. Feedback
DL HomeProceedingsMobiComCHANTS '08Citation
Why neighbourhood matters: interests-driven opportunistic data diffusion schemes
Full text PdfPdf (232 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 81-88  
Year of Publication: 2008
ISBN:978-1-60558-186-6
Authors
Iacopo Carreras  Create-net, Trento, Italy
Francesco De Pellegrini  Create-net, Trento, Italy
Daniele Miorandi  Create-net, Trento, Italy
David Tacconi  Create-net, Trento, Italy
Imrich Chlamtac  Create-net, trento, 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): 33,   Downloads (12 Months): 33,   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.1410001
What is a DOI?

ABSTRACT

Opportunistic communications have been extensively studied in the last few years, with special emphasis on the optimal trade-offs between the resources needed to operate such systems and the performance experienced by the end-users. We focus in this work on application scenarios, in which users exploit opportunistic communications to exchange and diffuse data of potential interest. We assume a data-centric architecture, in which users would like to receive messages whose content matches a set of interests they expressed. We propose a data diffusion scheme based on the combination of two features: (i) interest-driven one-hop data exchange (upon a transmission opportunity, a node requests data matching a set of interests) (ii) neighbourhood-based data conveyance (each node maintains a list of the most interesting contents for its nearest neighbours and looks actively for such kind of data). An algorithmic solution is proposed, together with a protocol implementing it. The performance of the proposed scheme is evaluated by simulating the data diffusion process, exploiting contact traces and interests lists gathered through real-life experiments.


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, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Impact of human mobility on the design of opportunistic forwarding algorithms. In Proc. of INFOCOM, Barcelona, Spain, April 23-29, 2006.
 
2
P. Costa, C. Mascolo, M. Musolesi, and G. P. Picco. Socially-aware Routing for Publish-Subscribe in Delay-tolerant Mobile Ad Hoc Networks. IEEE JSAC, 26(5), June 2008.
 
3
A. E. Fawal, J.-Y. L. Boudec, and K. Salamatian. Performance analysis of self limiting epidemic forwarding. Technical Report LCA-REPORT-2006-127, EPFL, 2006.
 
4
K. Harras, K. Almeroth, and E. Belding-Royer. Delay tolerant mobile networks (DTMNs): Controlled flooding schemes in sparse mobile networks. In Proc. of IFIP Netwoking, Waterloo, Canada, May, 2005.
 
5
P. Hui and J. Crowcroft. Bubble rap: Forwarding in small world dtns in ever decreasing circles. Technical Report UCAM-CL-TR-684, Univ. of Cambridge, Computer Laboratory, May 2007.
 
6
A. Khelil, C. Becker, J. Tian, and K. Rothermel. An epidemic model for information di usion in MANETs. In Proc. of ACM MSWiM, pages 54--60, Atlanta, Georgia, Sept. 28, 2002.
 
7
V. Lenders, M. May, G. Karlsson, and C. Wacha. Wireless ad hoc podcasting. ACM/Sigmobile Mobile Computing and Communications Review, Feb. 2008.
 
8
A. G. Miklas, K. K. Gollu, S. Saroiu, K. P. Gummadi, and E. de Lara. Exploiting social interactions in mobile systems. In Proc. of UBICOMP, Innsbruck, Austria, Sept 2007.
 
9
M. Musolesi and C. Mascolo. Controlled Epidemic-style Dissemination Middleware for Mobile Ad Hoc Networks. In Proc. of ACM Mobiquitous, July 2006.
 
10
M. Musolesi and C. Mascolo. Designing mobility models based on social network theory. ACM SIGMOBILE Mobile Computing and Communication Review, 11(3), July 2007.
 
11
L. Pelusi, A. Passarella, and M. Conti. Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Comm. Mag., 44(11), Nov. 2006.
 
12
Reality Mining. Machine perception and learning of complex social systems. http://reality.media.mit.edu/.
 
13
J. Su, J. Scott, P. Hui, J. Crowcroft, E. de Lara, C. Diot, A. Goel, M. Lim, and E. Upton. Haggle: Seamless networking for mobile applications. In Proc. of Ubicomp, pages 391--408, Sept. 2007.
 
14
A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-2000-06, Duke University, 2000.
 
15
X. Zhang, G. Neglia, J. Kurose, and D. Towsley. Performance modeling of epidemic routing. Comput. Netw., 51(10):2867--2891, 2007.

Collaborative Colleagues:
Iacopo Carreras: colleagues
Francesco De Pellegrini: colleagues
Daniele Miorandi: colleagues
David Tacconi: colleagues
Imrich Chlamtac: colleagues