skip to main content
10.1145/2491288.2491319acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
short-paper

Mobile social networking through friend-to-friend opportunistic content dissemination

Published: 29 July 2013 Publication History

Abstract

We focus on dissemination of content for delay tolerant applications, (i.e. content sharing, advertisement propagation, etc.) where users are geographically clustered into communities. We propose a novel architecture that addresses the issues of lack of trust, delivery latency, loss of user control, and privacy-aware distributed mobile social networking by combining the advantages of decentralized storage and opportunistic communications. The content is to be replicated on friends' devices who are likely to consume the content. The fundamental challenge is to minimize the number of replicas whilst ensuring high and timely availability. We propose a greedy heuristic algorithm for computationally hard content replication problem to replicate content in well-selected users, to maximize the content dissemination with limited number of replication. Using both real world and synthetic traces, we show the viability of the proposed scheme.

References

[1]
Crawdad:. In http://crawdad.cs.dartmouth.edu.
[2]
A. Abhari and M. Soraya. Workload generation for youtube. Multimedia Tools and Applications, 46(1):91--118, 2010.
[3]
M. Barbera, J. Stefa, A. Viana, M. de Amorim, and M. Boc. Vip delegation: Enabling vips to offload data in wireless social mobile networks. In DCOSS, 2011.
[4]
Cisco. Cisco visual networking index: Global mobile data traffic forecast update, 2011--2016.
[5]
H. Falaki, R. Mahajan, S. Kandula, D. Lymberopoulos, R. Govindan, and D. Estrin. Diversity in smartphone usage. In MobiSys '10, pages 179--194, San Francisco, California, USA, 2010.
[6]
B. Han, P. Hui, V. Kumar, M. Marathe, J. Shao, and A. Srinivasan. Mobile data offloading through opportunistic communications and social participation. Mobile Computing, IEEE Transactions on, (99):1--1, 2011.
[7]
http://joindiaspora.org.
[8]
A. Mei and J. Stefa. Swim: A simple model to generate small mobile worlds. In INFOCOM 2009, IEEE, pages 2106--2113. IEEE, 2009.
[9]
R. Sharma and A. Datta. Supernova: Super-peers based architecture for decentralized online social networks. In COMSNETS'12, pages 1--10. IEEE, 2012.
[10]
K. Thilakarathna, H. Petander, J. Mestre, and A. Seneviratne. Enabling Mobile Distributed Social Networking on Smartphones. In Proc. of ACM MSWiM'12, pages 357--366, oct 2012.
[11]
K. Thilakarathna, A. C. Viana, A. Seneviratne, and H. Petander. The Power of Hood Friendship for Opportunistic Content Dissemination in Mobile Social Networks. Technical report, INRIA, France, 2012.
[12]
J. Ugander, B. Karrer, L. Backstrom, and C. Marlow. The anatomy of the facebook social graph. Arxiv preprint arXiv:1111.4503, 2011.

Cited By

View all
  • (2023)Rendezvous Avoidance File Caching for Mobile Social NetworksIEEE Systems Journal10.1109/JSYST.2023.329315017:4(5955-5966)Online publication date: Dec-2023
  • (2021)Opportunistic Networks with Messages TrackingInformation Technology and Systems10.1007/978-3-030-68285-9_42(442-451)Online publication date: 31-Jan-2021
  • (2020)Trust-based Incentive for Mobile Offloaders in Opportunistic Networks2020 International Conference on Smart Electronics and Communication (ICOSEC)10.1109/ICOSEC49089.2020.9215264(872-877)Online publication date: Sep-2020
  • Show More Cited By

Index Terms

  1. Mobile social networking through friend-to-friend opportunistic content dissemination

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    MobiHoc '13: Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
    July 2013
    322 pages
    ISBN:9781450321938
    DOI:10.1145/2491288
    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: 29 July 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. dynamic centrality metrics
    2. mobile social networking
    3. opportunistic content dissemination
    4. user generated content sharing

    Qualifiers

    • Short-paper

    Conference

    MobiHoc '13
    Sponsor:

    Acceptance Rates

    MobiHoc '13 Paper Acceptance Rate 42 of 234 submissions, 18%;
    Overall Acceptance Rate 296 of 1,843 submissions, 16%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 28 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Rendezvous Avoidance File Caching for Mobile Social NetworksIEEE Systems Journal10.1109/JSYST.2023.329315017:4(5955-5966)Online publication date: Dec-2023
    • (2021)Opportunistic Networks with Messages TrackingInformation Technology and Systems10.1007/978-3-030-68285-9_42(442-451)Online publication date: 31-Jan-2021
    • (2020)Trust-based Incentive for Mobile Offloaders in Opportunistic Networks2020 International Conference on Smart Electronics and Communication (ICOSEC)10.1109/ICOSEC49089.2020.9215264(872-877)Online publication date: Sep-2020
    • (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
    • (2019)Simulation analysis of prefetching image content for social networking service frameworkMultimedia Tools and Applications10.1007/s11042-017-5492-178:20(28435-28452)Online publication date: 1-Oct-2019
    • (2019)Efficient interest‐aware data dissemination in mobile opportunistic networksSoftware: Practice and Experience10.1002/spe.275752:4(917-928)Online publication date: Oct-2019
    • (2018)On Exploiting Temporal Periodicity for Message Delivery in Mobile Opportunistic Networks2018 IEEE 42nd Annual Computer Software and Applications Conference (COMPSAC)10.1109/COMPSAC.2018.00131(809-810)Online publication date: Jul-2018
    • (2017)Proximity-Service Application Development FrameworkDevice-to-Device based Proximity Service10.1201/9781315120201-7(157-193)Online publication date: 5-Jul-2017
    • (2017)User Adoption of Mobile Social ServiceProceedings of the 2017 International Conference on Data Mining, Communications and Information Technology10.1145/3089871.3089889(1-6)Online publication date: 25-May-2017
    • (2017)The Power of Quasi-Shortest Paths: $\rho$ -Geodesic Betweenness CentralityIEEE Transactions on Network Science and Engineering10.1109/TNSE.2017.27087054:3(187-200)Online publication date: 1-Jul-2017
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media