A Survey and Taxonomy of Cyber Foraging of Mobile Devices

IEEE Communications Surveys &amp Tutorials (Impact Factor: 6.49). 01/2012; 14(4):1232-1243. DOI: 10.1109/SURV.2011.111411.00016

ABSTRACT With the ever-increasing advancement of mobile device technology and their pervasive usage, users expect to run their applications on mobile devices and get the same performance as if they used to run their applications on powerful non-mobile computers.
There is a challenge though in that mobile devices deliver lower performance than
traditional less-constrained and non-mobile computers because they are constrained by
weight, size, and mobility in spite of all their advancements in recent years. One of the ...

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Mobile cloud computing (MCC) enables the development of computational intensive mobile applications by leveraging the application processing services of computational clouds. Contemporary distributed application processing frameworks use runtime partitioning of elastic applications in which additional computing resources are occurred in runtime application profiling and partitioning. A number of recent studies have highlighted the different aspects of MCC. Current studies, however, have overlooked into the mechanism of application partitioning for MCC. We consider application partitioning to be an independent aspect of dynamic computational offloading and therefore we review the current status of application partitioning algorithms (APAs) to identify the issues and challenges. To the best of our knowledge, this paper is the first to propose a thematic taxonomy for APAs in MCC. The APAs are reviewed comprehensively to qualitatively analyze the implications and critical aspects. Furthermore, the APAs are analyzed based on partitioning granularity, partitioning objective, partitioning model, programming language support, presence of a profiler, allocation decision, analysis technique, and annotation. This paper also highlights the issues and challenges in partitioning of elastic application to assist in selecting appropriate research domains and exploring lightweight techniques of distributed application processing in MCC.
    Journal of Network and Computer Applications 01/2014; · 1.77 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Migrating computational intensive tasks from mobile devices to more resourceful cloud servers is a promising technique to increase the computational capacity of mobile devices while saving their battery energy. In this paper, we consider a MIMO multicell system where multiple mobile users (MUs) ask for computation offloading to a common cloud server. We formulate the offloading problem as the joint optimization of the radio resources-the transmit precoding matrices of the MUs-and the computational resources-the CPU cycles/second assigned by the cloud to each MU-in order to minimize the overall users' energy consumption, while meeting latency constraints. The resulting optimization problem is nonconvex (in the objective function and constraints). Nevertheless, in the single-user case, we are able to express the global optimal solution in closed form. In the more challenging multiuser scenario, we propose an iterative algorithm, based on a novel successive convex approximation technique, converging to a local optimal solution of the original nonconvex problem. Then, we reformulate the algorithm in a distributed and parallel implementation across the radio access points, requiring only a limited coordination/signaling with the cloud. Numerical results show that the proposed schemes outperform disjoint optimization algorithms.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The increasing capabilities of mobile devices (MDs) enable users to run desktoplevel applications and tasks anywhere. However, the local execution of resource-demanding mobile tasks, such as real-time rendering in 3D gaming, may result in poor performance and short battery lifetime on MDs. One solution to the resource scarcity problem on MDs is to offload resource-demanding mobile tasks to surrogates, which are remote servers with stronger capabilities. When multiple MDs in the same cell attempt to offload mobile tasks to surrogates through a cellular network, the communication latencies for data transmissions may be high due to limited radio resources. To improve the offloading performance of mobile tasks, the limited radio resources should be carefully scheduled to reduce the communication latencies of data transmissions. As motivated, we pose the optimal radio resource allocation problem for the mobile task offloading in cellular networks, and solve the problem. Moreover, extensive numerical results show the performance comparison of the optimal radio resource allocation plan and two baseline plans.
    IEEE Network 10/2014; 28(5):68 - 73. · 3.72 Impact Factor


Available from
May 19, 2014