Erasure Coding Vs. Replication: A Quantitative Comparison
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
High-throughput routing for multi-hop wireless networks
High-throughput routing for multi-hop wireless networks
Using Erasure Codes Efficiently for Storage in a Distributed System
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
The Case for VM-Based Cloudlets in Mobile Computing
IEEE Pervasive Computing
MAUI: making smartphones last longer with code offload
Proceedings of the 8th international conference on Mobile systems, applications, and services
CloneCloud: elastic execution between mobile device and cloud
Proceedings of the sixth conference on Computer systems
Serendipity: enabling remote computing among intermittently connected mobile devices
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
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.