research-article

ContentPlace: social-aware data dissemination in opportunistic networks

Authors:

Chiara Boldrini,

Andrea PassarellaAuthors Info & Claims

MSWiM '08: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems

Pages 203 - 210

https://doi.org/10.1145/1454503.1454541

Published: 27 October 2008 Publication History

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.

Digital Library

[2]

A. Balasubramanian, B. N. Levine, and A. Venkataramani. Dtn routing as a resource allocation problem. In Proc. of ACM SIGCOMM, 2007.

Digital Library

[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.

Digital Library

[5]

C. Boldrini, M. Conti, and A. Passarella. Exploiting users' social relations to forward data in opportunistic networks: the HiBOp solution. Pervasive and Mobile Computing (PMC), 2008.

Digital Library

[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.

Digital Library

[7]

E. Cohen and S. Shenker. Replication strategies in unstructured peer-to-peer networks. ACM Comput. Commun. Rev., 32(4):177--190, 2002.

Digital Library

[8]

P. Hui and J. Crowcroft. How small labels create big improvements. In Proc. of IEEE ICMAN, 2007.

Digital Library

[9]

P. Hui, E. Yoneki, S.-Y. Chan, and J. Crowcroft. Distributed community detection in delay tolerant networks. In Proc. of ACM MobiArch, 2007.

Digital Library

[10]

A. Jindal and K. Psounis. Contention-aware analysis of routing schemes for mobile opportunistic networks. In Proc. of ACM MobiOpp, 2007.

Digital Library

[11]

J. Kangasharju, K. W. Ross, and D. A. Turner. Optimizing file availability in peer-to-peer content distribution. Proc. of IEEE INFOCOM, 2007.

Digital Library

[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.

Digital Library

[15]

H. Shen, M. Kumar, S. K. Das, and Z. Wang. Energy-efficient data caching and prefetching for mobile devices based on utility. MONET, 10(4):475--486, 2005.

Digital Library

[16]

A. Vahdat and D. Becker. Epidemic Routing for Partially Connected Ad Hoc Networks. Tech. Rep., CS-2000-06, 2000.

[17]

D. Watts. Small Worlds: The Dynamics of Networks Between Order and Randomness. Princeton University Press, 1999.

Digital Library

[18]

L. Yin and G. Cao. Supporting cooperative caching in ad hoc networks. IEEE Trans. Mob. Comp., 5(1):77--89, 2006.

Digital Library

[19]

L. Yin, G. Cao, and Y. Cai. A generalized target-driven cache replacement policy for mobile environments. J. Parallel Distrib. Comput., 65(5):583--594, 2005.

Digital Library

[20]

E. Yoneki, P. Hui, S. Chan, and J. Crowcroft. A socio-aware overlay for publish/subscribe communication in delay tolerant networks. In Proc. of ACM MSWiM, 2007.

Digital Library

[21]

W. Zhao, M. Ammar, and E. Zegura. Multicasting in delay tolerant networks: semantic models and routing algorithms. In Proc. of ACM WDTN, 2005.

Digital Library

Cited By

Garompolo DMolinaro AIera A(2022)Bridging separate communities with common interest in distributed social networks through the use of social objectsFuture Generation Computer Systems10.1016/j.future.2021.10.028129:C(440-452)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1016/j.future.2021.10.028
Wang XChen MLeung VHan ZHwang K(2021)Integrating Social Networks with Mobile Device-to-Device ServicesIEEE Transactions on Services Computing10.1109/TSC.2018.286743714:4(1209-1223)Online publication date: 1-Jul-2021
https://doi.org/10.1109/TSC.2018.2867437
Pérez Palma NDressler FMancuso V(2021)PreciseComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2021.108556201:COnline publication date: 24-Dec-2021
https://dl.acm.org/doi/10.1016/j.comnet.2021.108556
Show More Cited By

Index Terms

ContentPlace: social-aware data dissemination in opportunistic networks
1. Networks
  1. Network protocols
  2. Network types
    1. Mobile networks
    2. Wireless access networks

Recommendations

Design and performance evaluation of ContentPlace, a social-aware data dissemination system for opportunistic networks

In this paper we present and evaluate ContentPlace, a data dissemination system for opportunistic networks, i.e., mobile networks in which stable simultaneous multi-hop paths between communication endpoints cannot be provided. We consider a scenario in ...
Energy-efficient forwarding mechanism for wireless opportunistic networks in emergency scenarios

During emergency situations, the use of mobile devices and wireless opportunistic networks as a solution of destroyed or overused communication networks are vital. In these cases, the fast and reliable delivery of emergency information, together with ...
BLESSED with Opportunistic Beacons: A Lightweight Data Dissemination Model for Smart Mobile Ad-Hoc Networks
CHANTS '15: Proceedings of the 10th ACM MobiCom Workshop on Challenged Networks

This paper introduces BLESSED, a universal opportunistic ad hoc networking model intended for smart mobile devices. It enables fast and lightweight data dissemination in wireless community networks through the complementary utilization of the IEEE ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MSWiM '08: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems

October 2008

430 pages

ISBN:9781605582351

DOI:10.1145/1454503

General Chairs:
Sotiris Nikoketseas
CTI/University of Patras, Greece
,
Nael Abu-Ghazaleh
SUNY at Binghamton, USA
,
Program Chairs:
Brahim Bensaou
University of Science and Technology, Hong Kong
,
Violet R. Syrotiuk
Arizona State University, USA

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 October 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

MSWiM '08

Sponsor:

MSWiM '08: The 11th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems

October 27 - 31, 2008

British Columbia, Vancouver, Canada

Acceptance Rates

Overall Acceptance Rate 398 of 1,577 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

116
Total Citations
View Citations
979
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Garompolo DMolinaro AIera A(2022)Bridging separate communities with common interest in distributed social networks through the use of social objectsFuture Generation Computer Systems10.1016/j.future.2021.10.028129:C(440-452)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1016/j.future.2021.10.028
Wang XChen MLeung VHan ZHwang K(2021)Integrating Social Networks with Mobile Device-to-Device ServicesIEEE Transactions on Services Computing10.1109/TSC.2018.286743714:4(1209-1223)Online publication date: 1-Jul-2021
https://doi.org/10.1109/TSC.2018.2867437
Pérez Palma NDressler FMancuso V(2021)PreciseComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2021.108556201:COnline publication date: 24-Dec-2021
https://dl.acm.org/doi/10.1016/j.comnet.2021.108556
Zhang XXu LGao M(2020)An Efficient Influence Maximization Algorithm Based on Social Relationship Priority in Mobile Social NetworksSecurity and Privacy in Social Networks and Big Data10.1007/978-981-15-9031-3_15(164-177)Online publication date: 22-Sep-2020
https://doi.org/10.1007/978-981-15-9031-3_15
Sountharrajan SSuganya EKarthiga MNandhini SVishnupriya BSathiskumar B(2020)On-the-Go Network Establishment of IoT Devices to Meet the Need of Processing Big Data Using Machine Learning AlgorithmsBusiness Intelligence for Enterprise Internet of Things10.1007/978-3-030-44407-5_8(151-168)Online publication date: 10-Jun-2020
https://doi.org/10.1007/978-3-030-44407-5_8
Zhou HWang HWang NLi DCao YLi XWu J(2019)Exploiting Mobile Social Networks From Temporal Perspective: A SurveyIEEE Access10.1109/ACCESS.2019.29589517(180818-180834)Online publication date: 2019
https://doi.org/10.1109/ACCESS.2019.2958951
Yu SZhang LLi LYan BCai ZZhang L(2019)An Efficient Interest-aware Data Dissemination Approach in Opportunistic NetworksProcedia Computer Science10.1016/j.procs.2019.01.255147(394-399)Online publication date: 2019
https://doi.org/10.1016/j.procs.2019.01.255
Yu SZhang LLi PLi LYan BCai Z(2019)Efficient interest‐aware data dissemination in mobile opportunistic networksSoftware: Practice and Experience10.1002/spe.275752:4(917-928)Online publication date: Oct-2019
https://doi.org/10.1002/spe.2757
Zhao YSong W(2018)Energy-Aware Incentivized Data Dissemination via Wireless D2D Communications With Weighted Social CommunitiesIEEE Transactions on Green Communications and Networking10.1109/TGCN.2018.28474512:4(945-957)Online publication date: Dec-2018
https://doi.org/10.1109/TGCN.2018.2847451
Kim SHan S(2018)Distinguishing social contacts and pass-by contacts in DTN routingTelecommunications Systems10.1007/s11235-017-0416-y68:4(669-685)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.1007/s11235-017-0416-y
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten