ContentPlace: social-aware data dissemination in opportunistic networks

ABSTRACT

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.

REFERENCES

• 1: A. Balamash and M. Krunz. An overview of web caching replacement algorithms. IEEE Comm. Surv., 6(2):44--56, 2004.
• 2: Aruna Balasubramanian , Brian Levine , Arun Venkataramani, DTN routing as a resource allocation problem, Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications, August 27-31, 2007, Kyoto, Japan
• 3: C. Boldrini, M. Conti, and A. Passarella. Users mobility models for opportunistic networks: the role of physical locations. In Proc. of IEEE WRECOM, 2007.
• 4: C. Boldrini, M. Conti, and A. Passarella. Context and resource awareness in opportunistic network data dissemination. In Proc. of IEEE AOC, 2008.
• 5: Chiara Boldrini , Marco Conti , Andrea Passarella, Fast track article: Exploiting users' social relations to forward data in opportunistic networks: The HiBOp solution, Pervasive and Mobile Computing, v.4 n.5, p.633-657, October, 2008 [doi>10.1016/j.pmcj.2008.04.003]
• 6: C.-Y. Chow, H. V. Leong, and A. T. Chan. Grococa: group-based peer-to-peer cooperative caching in mobile environment. IEEE JSAC, 25(1):179--191, 2007.
• 7: Edith Cohen , Scott Shenker, Replication strategies in unstructured peer-to-peer networks, ACM SIGCOMM Computer Communication Review, v.32 n.4, October 2002
• 8: P. Hui and J. Crowcroft. How small labels create big improvements. In Proc. of IEEE ICMAN, 2007.
• 9: Pan Hui , Eiko Yoneki , Shu Yan Chan , Jon Crowcroft, Distributed community detection in delay tolerant networks, Proceedings of 2nd ACM/IEEE international workshop on Mobility in the evolving internet architecture, August 27-30, 2007, Kyoto, Japan [doi>10.1145/1366919.1366929]
• 10: Apoorva Jindal , Konstantinos Psounis, Contention-aware analysis of routing schemes for mobile opportunistic networks, Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking, June 11-11, 2007, San Juan, Puerto Rico [doi>10.1145/1247694.1247696]
• 11: J. Kangasharju, K. W. Ross, and D. A. Turner. Optimizing file availability in peer-to-peer content distribution. Proc. of IEEE INFOCOM, 2007.
• 12: H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, 2004.
• 13: V. Lenders, G. Karlsson, and M. May. Wireless Ad hoc Podcasting. In Proc. of IEEE SECON, 2007.
• 14: L. Pelusi, A. Passarella, and M. Conti. Opportunistic Networking: data forwarding in disconnected mobile ad hoc networks. IEEE Comm. Magazine, 44(11), Nov. 2006.
• 15: Huaping Shen , Mohan Kumar , Sajal K. Das , Zhijun Wang, Energy-efficient data caching and prefetching for mobile devices based on utility, Mobile Networks and Applications, v.10 n.4, p.475-486, August 2005 [doi>10.1145/1160162.1160171]
• 16: A. Vahdat and D. Becker. Epidemic Routing for Partially Connected Ad Hoc Networks. Tech. Rep., CS-2000-06, 2000.
• 17: Duncan J. Watts, Small worlds: the dynamics of networks between order and randomness, Princeton University Press, Princeton, NJ, 1999
• 18: Liangzhong Yin , Guohong Cao, Supporting Cooperative Caching in Ad Hoc Networks, IEEE Transactions on Mobile Computing, v.5 n.1, p.77-89, January 2006 [doi>10.1109/TMC.2006.15]
• 19: Liangzhong Yin , Guohong Cao , Ying Cai, A generalized target-driven cache replacement policy for mobile environments, Journal of Parallel and Distributed Computing, v.65 n.5, p.583-594, May 2005 [doi>10.1016/j.jpdc.2004.12.002]
• 20: Eiko Yoneki , Pan Hui , ShuYan Chan , Jon Crowcroft, A socio-aware overlay for publish/subscribe communication in delay tolerant networks, Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems, October 22-26, 2007, Chania, Crete Island, Greece [doi>10.1145/1298126.1298166]
• 21: Wenrui Zhao , Mostafa Ammar , Ellen Zegura, Multicasting in delay tolerant networks: semantic models and routing algorithms, Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, p.268-275, August 26-26, 2005, Philadelphia, Pennsylvania, USA [doi>10.1145/1080139.1080145]

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Wireless communication

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.2 Network Protocols

General Terms:
Algorithms, Design, Performance

Keywords:
data dissemination, opportunistic networks, performance evaluation, social-oriented networking