ContentPlace: social-aware data dissemination in opportunistic networks

This paper deals with data dissemination in resource-constrained opportunistic networks, i.e., multi-hop ad hoc networks in which simultaneous paths between endpoints are not available, in general, for end-to-end communication. One of the main challenges is to make content available in those regions of the network where interested users are present, without overusing available resources (e.g., by avoiding flooding). These regions should be identified dynamically, only by exploiting local information exchanged by nodes upon encountering other peers. To this end, exploiting information about social users' behaviour turns out to be very efficient. In this paper we propose and evaluate ContentPlace, a system that exploits dynamically learnt information about users' social relationships to decide where to place data objects in order to optimise content availability. We define a number of social-oriented policies in the general ContentPlace framework, and compare them also with other reference policies proposed in the literature.

[1]  Jussi Kangasharju,et al.  Optimizing File Availability in Peer-to-Peer Content Distribution , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[2]  Edith Cohen,et al.  Replication strategies in unstructured peer-to-peer networks , 2002, SIGCOMM.

[3]  M. Conti,et al.  Users Mobility Models for Opportunistic Networks : the Role of Physical Locations , 2007 .

[4]  Marwan Krunz,et al.  An overview of web caching replacement algorithms , 2004, IEEE Communications Surveys & Tutorials.

[5]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .

[6]  Mostafa Ammar,et al.  Multicasting in delay tolerant networks: semantic models and routing algorithms , 2005, WDTN '05.

[7]  Pan Hui,et al.  Distributed community detection in delay tolerant networks , 2007, MobiArch '07.

[8]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[9]  Gunnar Karlsson,et al.  Wireless Ad Hoc Podcasting , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[10]  Hans Kellerer,et al.  Knapsack problems , 2004 .

[11]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[12]  Konstantinos Psounis,et al.  Contention-aware analysis of routing schemes for mobile opportunistic networks , 2007, MobiOpp '07.

[13]  Chi-Yin Chow,et al.  GroCoca: group-based peer-to-peer cooperative caching in mobile environment , 2007, IEEE Journal on Selected Areas in Communications.

[14]  Marco Conti,et al.  Exploiting users' social relations to forward data in opportunistic networks: The HiBOp solution , 2008, Pervasive Mob. Comput..

[15]  Pan Hui,et al.  A socio-aware overlay for publish/subscribe communication in delay tolerant networks , 2007, MSWiM '07.

[16]  Ying Cai,et al.  A generalized target-driven cache replacement policy for mobile environments , 2003, 2003 Symposium on Applications and the Internet, 2003. Proceedings..

[17]  Marco Conti,et al.  Opportunistic networking: data forwarding in disconnected mobile ad hoc networks , 2006, IEEE Communications Magazine.

[18]  Marco Conti,et al.  Context and resource awareness in opportunistic network data dissemination , 2008, 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[19]  Mohan Kumar,et al.  Energy-Efficient Data Caching and Prefetching for Mobile Devices Based on Utility , 2005, Mob. Networks Appl..

[20]  Guohong Cao,et al.  Supporting Cooperative Caching in Ad Hoc Networks , 2006, IEEE Trans. Mob. Comput..

[21]  Pan Hui,et al.  How Small Labels Create Big Improvements , 2006, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).