672 research outputs found

    SCCOF: smart cooperative computation offloading framework for mobile cloud computing services

    Get PDF
    Virtual reality games and image processing Apps are examples of mobile cloud computing services (MCCS) common on Smartphones (SPs) nowadays, requiring intensive processing and/or wireless networking. The consequences are slow execution and huge battery consumption. Offloading the intensive computations of such Apps to a cloud based server can overcome such consequences. However, such offloading will introduce time delay and communication overheads. This paper proposes to do the offloading to nearby computing resources in a cooperative computation sharing network via short-range wireless connectivity. The proposed SCCOF reduces offloading response time and energy consumption overheads. SCCOF is supported by an intelligent cloud located controller that will form the cooperative resource sharing network on the go when needed, based on available devices in the vicinity, and will use the cloud if necessary. Upon the initiation of the MCCS service via the App, our controller will devise the offloaded VMs as well as the offloading network. A study test scenario was performed to evaluate the performance of SCCOF, resulting in saving of up to 16.2x in execution time and 57.25% energy

    Live Prefetching for Mobile Computation Offloading

    Get PDF
    The conventional designs of mobile computation offloading fetch user-specific data to the cloud prior to computing, called offline prefetching. However, this approach can potentially result in excessive fetching of large volumes of data and cause heavy loads on radio-access networks. To solve this problem, the novel technique of live prefetching is proposed in this paper that seamlessly integrates the task-level computation prediction and prefetching within the cloud-computing process of a large program with numerous tasks. The technique avoids excessive fetching but retains the feature of leveraging prediction to reduce the program runtime and mobile transmission energy. By modeling the tasks in an offloaded program as a stochastic sequence, stochastic optimization is applied to design fetching policies to minimize mobile energy consumption under a deadline constraint. The policies enable real-time control of the prefetched-data sizes of candidates for future tasks. For slow fading, the optimal policy is derived and shown to have a threshold-based structure, selecting candidate tasks for prefetching and controlling their prefetched data based on their likelihoods. The result is extended to design close-to-optimal prefetching policies to fast fading channels. Compared with fetching without prediction, live prefetching is shown theoretically to always achieve reduction on mobile energy consumption.Comment: To appear in IEEE Trans. on Wireless Communicatio

    A Self-Aware and Scalable Solution for Efficient Mobile-Cloud Hybrid Robotics

    Get PDF
    Backed by the virtually unbounded resources of the cloud, battery-powered mobile robotics can also benefit from cloud computing, meeting the demands of even the most computationally and resource-intensive tasks. However, many existing mobile-cloud hybrid (MCH) robotic tasks are inefficient in terms of optimizing trade-offs between simultaneously conflicting objectives, such as minimizing both battery power consumption and network usage. To tackle this problem we propose a novel approach that can be used not only to instrument an MCH robotic task but also to search for its efficient configurations representing compromise solution between the objectives. We introduce a general-purpose MCH framework to measure, at runtime, how well the tasks meet these two objectives. The framework employs these efficient configurations to make decisions at runtime, which are based on: (1) changing of the environment (i.e., WiFi signal level variation), and (2) itself in a changing environment (i.e., actual observed packet loss in the network). Also, we introduce a novel search-based multi-objective optimization (MOO) algorithm, which works in two steps to search for efficient configurations of MCH applications. Analysis of our results shows that: (i) using self-adaptive and self-aware decisions, an MCH foraging task performed by a battery-powered robot can achieve better optimization in a changing environment than using static offloading or running the task only on the robot. However, a self-adaptive decision would fall behind when the change in the environment happens within the system. In such a case, a self-aware system can perform well, in terms of minimizing the two objectives. (ii) The Two-Step algorithm can search for better quality configurations for MCH robotic tasks of having a size from small to medium scale, in terms of the total number of their offloadable modules
    • …
    corecore