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

Energy-efficient fault-tolerant data storage & processing in dynamic networks

Published:29 July 2013Publication History

ABSTRACT

With the advance of mobile devices, cloud computing has enabled people to access data and computing resources without spatiotemporal constraints. A common assumption is that mobile devices are well connected to remote data centers and the data centers securely store and process data. However, for systems like mobile cloud deployed in infrastructureless dynamic networks (i.e., with frequent topology changes because of node failure/unavailability and mobility), reliability and energy efficiency remain largely unaddressed challenges. To address these issues, we develop the first 'k-out-of-n computing' framework that ensures nodes retrieve or process data stored in mobile cloud with minimum energy consumption as long as k out of n storage/processing nodes are accessible. We demonstrate the feasibility and performance of our framework through both hardware implementation and extensive simulations.

References

  1. M.K. Aguilera, R. Janakiraman, and Lihao Xu. Using erasure codes efficiently for storage in a distributed system. In Proceedings of Dependable Systems and Networks}, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Byung-Gon Chun, Sunghwan Ihm, Petros Maniatis, Mayur Naik, and Ashwin Patti. Clonecloud: elastic execution between mobile device and cloud. In Proceedings of EuroSys, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Douglas S. J. De Couto. High-Throughput Routing for Multi-Hop Wireless Networks. {PhD} dissertation, MIT, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Eduardo Cuervo, Aruna Balasubramanian, Dae-ki Cho, Alec Wolman, Stefan Saroiu, Ranveer Chandra, and Paramvir Bahl. Maui: making smartphones last longer with code offload. In Proceedings of MobiSys, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Jiachen Liu David W. Coit. System reliability optimization with k-out-of-n subsystems. Int. Journal of Reliability, Quality and Safety Engineering, 7(2):129--142, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  6. A.G. Dimakis, K. Ramchandran, Y. Wu, and Changho Suh. A survey on network codes for distributed storage. Proceedings of the IEEE, 99:476--489, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  7. S. Huchton, G. Xie, and R Beverly. Building and evaluating a k-resilient mobile distributed file system resistant to device compromise. In Proceedings of Military Communications Conference, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  8. S. Kosta, A. Aucinas, Pan Hui, R. Mortier, and Xinwen Zhang. Thinkair: Dynamic resource allocation and parallel execution in the cloud for mobile code offloading. In Proceedings of INFOCOM, 2012.Google ScholarGoogle ScholarCross RefCross Ref
  9. D. Leong, A.G. Dimakis, and Tracey Ho. Distributed storage allocation for high reliability. In Proceedings of ICC, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  10. M. Satyanarayanan, P. Bahl, R. Caceres, and N. Davies. The case for vm-based cloudlets in mobile computing. Pervasive Computing, IEEE, 8:14--23, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Cong Shi, Vasileios Lakafosis, Mostafa H. Ammar, and Ellen W. Zegura. Serendipity: enabling remote computing among intermittently connected mobile devices. In Proceedings of MobiHoc, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A Shokrollahi. Raptor codes. Information Theory, 52:2551--2567, 2006.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Hakim Weatherspoon and John Kubiatowicz. Erasure coding vs. replication: A quantitative comparison. In Proceedings of Peer-to-Peer Systems, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Energy-efficient fault-tolerant data storage & processing in dynamic networks

        Recommendations

        Comments

        Login options

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

        Sign in
        • 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

          Copyright © 2013 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]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 29 July 2013

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • short-paper

          Acceptance Rates

          MobiHoc '13 Paper Acceptance Rate42of234submissions,18%Overall Acceptance Rate296of1,843submissions,16%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader