Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2980147.2980151acmotherconferencesArticle/Chapter ViewAbstractPublication PagesmobicomConference Proceedingsconference-collections
research-article

Cloud storage for mobile users using pre-positioned storage facilities

Published: 03 October 2016 Publication History

Abstract

We propose a cloud-like file storage and sharing system designed for mobile users. Our system relies on a collection of strategically pre-positioned repositories within which files are replicated without relying on a conventional infrastructure-based network. Once stored in the first encountered repository, copies of the files are carried by the initial uploader or subsequent users and distributed among the other repositories. Having multiple copies available at different repositories thus increases the likelihood of finding the requested files in a timely fashion. Files can later be retrieved by other users at different locations. We are interested in processing user storage and retrieval requests before their deadlines expire. We design an algorithm to place the repositories such that they serve a maximum number of requests before their deadlines expire. We evaluate our system using mobility traces of San Francisco city buses. We show the impact of the number and placement of repositories on request success rate. We also show the benefits of mobility-leveraged file distribution.

References

[1]
B. Baron, P. Spathis, H. Rivano, and M. D. de Amorim. Offloading massive data onto passenger vehicles: Topology simplification and traffic assignment. IEEE/ACM Transactions on Networking, 2015.
[2]
R. Church and C. R. Velle. The maximal covering location problem. Papers in regional science, 1974.
[3]
M. J. Demmer, B. Du, and E. A. Brewer. Tierstore: A distributed filesystem for challenged networks in developing regions. In FAST, 2008.
[4]
K. Fall. A delay-tolerant network architecture for challenged internets. In ACM SIGCOMM, 2003.
[5]
A. Getis and J. K. Ord. The analysis of spatial association by use of distance statistics. Geographical analysis, 1992.
[6]
A. Keränen, J. Ott, and T. Kärkkäinen. The one simulator for dtn protocol evaluation. In ACM Simutools, 2009.
[7]
N. Megiddo, E. Zemel, and S. L. Hakimi. The maximum coverage location problem. SIAM Journal on Algebraic Discrete Methods, 1983.
[8]
J. Ott and M. J. Pitkänen. Dtn-based content storage and retrieval. In IEEE WoWMoM, 2007.
[9]
R. C. Shah, S. Roy, S. Jain, and W. Brunette. Data mules: Modeling and analysis of a three-tier architecture for sparse sensor networks. Elsevier Ad Hoc Networks, 1(2):215--233, 2003.
[10]
W. Zhao, Y. Chen, M. Amma, M. Corner, B. Levine, and E. Zegura. Capacity enhancement using throw-boxes in dtns. In IEEE MASS, 2006.

Cited By

View all
  • (2022)Storage Capacity of Opportunistic Information Dissemination SystemsIEEE Transactions on Mobile Computing10.1109/TMC.2021.305725921:10(3773-3788)Online publication date: 1-Oct-2022
  • (2018)Vehicular CloudsVehicular Cloud Computing for Traffic Management and Systems10.4018/978-1-5225-3981-0.ch001(1-29)Online publication date: 2018
  1. Cloud storage for mobile users using pre-positioned storage facilities

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    SmartObjects '16: Proceedings of the 2nd Workshop on Experiences in the Design and Implementation of Smart Objects
    October 2016
    63 pages
    ISBN:9781450342544
    DOI:10.1145/2980147
    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]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 03 October 2016

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. opportunistic networks
    2. placement algorithm
    3. vehicular cloud storage and sharing system

    Qualifiers

    • Research-article

    Funding Sources

    • NSF NETS

    Conference

    MobiCom'16

    Acceptance Rates

    SmartObjects '16 Paper Acceptance Rate 5 of 10 submissions, 50%;
    Overall Acceptance Rate 15 of 41 submissions, 37%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 13 Nov 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)Storage Capacity of Opportunistic Information Dissemination SystemsIEEE Transactions on Mobile Computing10.1109/TMC.2021.305725921:10(3773-3788)Online publication date: 1-Oct-2022
    • (2018)Vehicular CloudsVehicular Cloud Computing for Traffic Management and Systems10.4018/978-1-5225-3981-0.ch001(1-29)Online publication date: 2018

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    ePub

    View this article in ePub.

    ePub

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media