Effective Algorithms for Scheduling Workflow Tasks on Mobile Clouds

2020 ◽  
Vol 29 (16) ◽  
pp. 2050255
Author(s):  
Heng Li ◽  
Yaoqin Zhu ◽  
Meng Zhou ◽  
Yun Dong
Keyword(s):  
Mobile Devices ◽  
Solution Space ◽  
Iterated Local Search ◽  
Mobile Cloud ◽  
Local Optimum ◽  
Perturbation Operator ◽  
Evolutionary Mechanisms ◽  
Local Optima ◽  
Np Hard Problem ◽  
Workflow Tasks

In mobile cloud computing, the computing resources of mobile devices can be integrated to execute complicated applications, in order to tackle the problem of insufficient resources of mobile devices. Such applications are, in general, characterized as workflows. Scheduling workflow tasks on a mobile cloud system consisting of heterogeneous mobile devices is a NP-hard problem. In this paper, intelligent algorithms, e.g., particle swarm optimization (PSO) and simulated annealing (SA), are widely used to solve this problem. However, both PSO and SA suffer from the limitation of easily being trapped into local optima. Since these methods rely on their evolutionary mechanisms to explore new solutions in solution space, the search procedure converges once getting stuck in local optima. To address this limitation, in this paper, we propose two effective metaheuristic algorithms that incorporate the iterated local search (ILS) strategy into PSO and SA algorithms, respectively. In case that the intelligent algorithm converges to a local optimum, the proposed algorithms use a perturbation operator to explore new solutions and use the newly explored solutions to start a new round of evolution in the solution space. This procedure is iterated until no better solutions can be explored. Experimental results show that by incorporating the ILS strategy, our proposed algorithms outperform PSO and SA in reducing workflow makespans. In addition, the perturbation operator is beneficial for improving the effectiveness of scheduling algorithms in exploring high-quality scheduling solutions.

scholarly journals Optimization on Vehicle Routing Problem Based on Immune Clonal Selection Algorithm

2012 ◽  
Vol 6-7 ◽  
pp. 256-260
Author(s):  
Hai Hua Li ◽  
Zong Yan Xu ◽  
Fei Fei Zhou
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Clonal Selection ◽  
Solution Space ◽  
Genetic Mutation ◽  
Initial Population ◽  
Local Optimum ◽  
Clonal Selection Algorithm ◽  
Routing Problem ◽  
Optimum Solution

Vehicle routing problem is a typical NP-hard problem and is difficult to get an optimum solution. Aiming at the shortages of the existing methods, this paper proposed an algorithm based on immune clonal selection to solve vehicle routing problem. In the algorithm, expressed antibody with matrix, generated the initial population of antibodies randomly, and employed the operations such as clonal selection, genetic mutation iteratively to search optimum solution in solution space. The experimental results show that the algorithm presented here can converge to the global optimum solution rapidly, overcoming such disadvantages of the genetic algorithm as slower convergent velocity and the convergence to a local optimum solution.

Missile Guidance Algorithm Design Using Particle Swarm Optimization

2013 ◽  
Vol 284-287 ◽  
pp. 2411-2415
Author(s):  
Chien Chun Kung ◽  
Kuei Yi Chen
Keyword(s):  
Objective Function ◽  
Fitness Function ◽  
Equations Of Motion ◽  
Algorithm Design ◽  
Solution Space ◽  
Pso Algorithm ◽  
Local Optimum ◽  
Missile Guidance ◽  
Pursuit Evasion ◽  
Guidance Algorithm

This paper presents a technique to design a PSO guidance algorithm for the nonlinear and dynamic pursuit-evasion optimization problem. In the PSO guidance algorithm, the particle positions of the swarm are initialized randomly within the guidance command solution space. With the particle positions to be guidance commands, we predict and record missiles’ behavior by solving point-mass equations of motion during a defined short-range period. Taking relative distance to be the objective function, the fitness function is then evaluated according to the objective function. As the PSO algorithm proceeds, these guidance commands will migrate to a local optimum until the global optimum is reached. This paper implements the PSO guidance algorithm in two pursuit-evasion scenarios and the simulation results show that the proposed design technique is able to generate a missile guidance law which has satisfied performance in execution time, terminal miss distance, time of interception and robust pursuit capability.

scholarly journals Sales Growth Rate Forecasting Using Improved PSO and SVM

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Xibin Wang ◽  
Junhao Wen ◽  
Shafiq Alam ◽  
Xiang Gao ◽  
Zhuo Jiang ◽  
...  
Keyword(s):  
Growth Rate ◽  
Decisive Role ◽  
Convergence Speed ◽  
Classification Model ◽  
Support Vector ◽  
Local Optimum ◽  
Sales Growth ◽  
Local Optima ◽  
Proposed Model ◽  
Forecasting Performance

Accurate forecast of the sales growth rate plays a decisive role in determining the amount of advertising investment. In this study, we present a preclassification and later regression based method optimized by improved particle swarm optimization (IPSO) for sales growth rate forecasting. We use support vector machine (SVM) as a classification model. The nonlinear relationship in sales growth rate forecasting is efficiently represented by SVM, while IPSO is optimizing the training parameters of SVM. IPSO addresses issues of traditional PSO, such as relapsing into local optimum, slow convergence speed, and low convergence precision in the later evolution. We performed two experiments; firstly, three classic benchmark functions are used to verify the validity of the IPSO algorithm against PSO. Having shown IPSO outperform PSO in convergence speed, precision, and escaping local optima, in our second experiment, we apply IPSO to the proposed model. The sales growth rate forecasting cases are used to testify the forecasting performance of proposed model. According to the requirements and industry knowledge, the sample data was first classified to obtain types of the test samples. Next, the values of the test samples were forecast using the SVM regression algorithm. The experimental results demonstrate that the proposed model has good forecasting performance.

scholarly journals Enabling Efficient Decentralized and Privacy Preserving Data Sharing in Mobile Cloud Computing

2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Jiawei Zhang ◽  
Ning Lu ◽  
Teng Li ◽  
Jianfeng Ma
Keyword(s):  
Cloud Computing ◽  
Access Control ◽  
Mobile Devices ◽  
Data Sharing ◽  
Mobile Cloud Computing ◽  
High Efficiency ◽  
Mobile Cloud ◽  
User Privacy ◽  
Access Policy ◽  
Fine Grained

Mobile cloud computing (MCC) is embracing rapid development these days and able to provide data outsourcing and sharing services for cloud users with pervasively smart mobile devices. Although these services bring various conveniences, many security concerns such as illegally access and user privacy leakage are inflicted. Aiming to protect the security of cloud data sharing against unauthorized accesses, many studies have been conducted for fine-grained access control using ciphertext-policy attribute-based encryption (CP-ABE). However, a practical and secure data sharing scheme that simultaneously supports fine-grained access control, large university, key escrow free, and privacy protection in MCC with expressive access policy, high efficiency, verifiability, and exculpability on resource-limited mobile devices has not been fully explored yet. Therefore, we investigate the challenge and propose an Efficient and Multiauthority Large Universe Policy-Hiding Data Sharing (EMA-LUPHDS) scheme. In this scheme, we employ fully hidden policy to preserve the user privacy in access policy. To adapt to large scale and distributed MCC environment, we optimize multiauthority CP-ABE to be compatible with large attribute universe. Meanwhile, for the efficiency purpose, online/offline and verifiable outsourced decryption techniques with exculpability are leveraged in our scheme. In the end, we demonstrate the flexibility and high efficiency of our proposal for data sharing in MCC by extensive performance evaluation.

Accelerating Mobile-Cloud Computing

2015 ◽  
pp. 1933-1955
Author(s):  
Tolga Soyata ◽  
He Ba ◽  
Wendi Heinzelman ◽  
Minseok Kwon ◽  
Jiye Shi
Keyword(s):  
Cloud Computing ◽  
Mobile Devices ◽  
High Speed ◽  
Mobile Cloud Computing ◽  
Response Times ◽  
State Of The Art ◽  
The State ◽  
Mobile Cloud ◽  
Computational Resources ◽  
Traditional Approaches

With the recent advances in cloud computing and the capabilities of mobile devices, the state-of-the-art of mobile computing is at an inflection point, where compute-intensive applications can now run on today's mobile devices with limited computational capabilities. This is achieved by using the communications capabilities of mobile devices to establish high-speed connections to vast computational resources located in the cloud. While the execution scheme based on this mobile-cloud collaboration opens the door to many applications that can tolerate response times on the order of seconds and minutes, it proves to be an inadequate platform for running applications demanding real-time response within a fraction of a second. In this chapter, the authors describe the state-of-the-art in mobile-cloud computing as well as the challenges faced by traditional approaches in terms of their latency and energy efficiency. They also introduce the use of cloudlets as an approach for extending the utility of mobile-cloud computing by providing compute and storage resources accessible at the edge of the network, both for end processing of applications as well as for managing the distribution of applications to other distributed compute resources.

Mobile Cloud Computing

2018 ◽  
pp. 105-123
Author(s):  
Parkavi R ◽  
Priyanka C ◽  
Sujitha S. ◽  
Sheik Abdullah A
Keyword(s):  
Cloud Computing ◽  
Mobile Computing ◽  
Mobile Devices ◽  
Mobile Cloud Computing ◽  
Cloud Services ◽  
Mobile Cloud ◽  
Mobile Service ◽  
Service Users ◽  
Security Issues ◽  
Mobile Computing Environment

Mobile Cloud Computing (MCC) which combines mobile computing and cloud computing, has become one of the industry ring words and a major conversation thread in the IT world with an explosive development of the mobile applications and emerging of cloud computing idea, the MCC has become a possible technology for the mobile service users. The concepts of Cloud computing are naturally meshed with mobile devices to allow on-the-go functionalities and benefits. The mobile cloud computing is emerging as one of the most important branches of cloud computing and it is expected to expand the mobile ecosystems. As more mobile devices enter the market and evolve, certainly security issues will grow as well. Also, enormous growth in the variety of devices connected to the Internet will further drive security needs. MCC provides a platform where mobile users make use of cloud services on mobile devices. The use of MCC minimizes the performance, compatibility, and lack of resources issues in mobile computing environment.

Fuzziness in Ant Colony Optimization and Their Applications

2018 ◽  
pp. 363-376
Author(s):  
Deepthi P. Hudedagaddi ◽  
B. K. Tripathy
Keyword(s):  
Ant Colony Optimization ◽  
Early Stage ◽  
Solution Space ◽  
Fuzzy Linear Programming ◽  
Ant Colony ◽  
Local Optima ◽  
Local Improvement ◽  
Nature Inspired Algorithm ◽  
Solution Methods ◽  
Nature Inspired Algorithms

Nature-inspired algorithms are still at a very early stage with a relatively short history, comparing with many traditional, well-established methods. Metaheuristics, in their original definition, are solution methods that orchestrate an interaction between local improvement procedures and higher level strategies to create a process capable of escaping from local optima and performing a robust search of a solution space. One major algorithm is Ant Colony Optimization which has been applied in varied domains to better the performance. Fuzzy Linear Programming models and methods has been one of the most and well-studied topics inside the broad area of Soft Computing. Its applications as well as practical realizations can be found in all the real-world areas. Here we wish to introduce how fuzziness can be included in a nature inspired algorithm like ant colony optimization and thereby enhance its functionality. Several applications of ACO with fuzzy concepts will be introduced in the chapter.

Local Best Particle Swarm Optimization Using Crown Jewel Defense Strategy

2018 ◽  
pp. 27-52 ◽  
Author(s):  
Jiarui Zhou ◽  
Junshan Yang ◽  
Ling Lin ◽  
Zexuan Zhu ◽  
Zhen Ji
Keyword(s):  
Particle Swarm Optimization ◽  
High Efficiency ◽  
Particle Swarm ◽  
Global Optimum ◽  
Population Diversity ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Local Optima ◽  
Von Neumann ◽  
Swarm Intelligence Algorithm

Particle swarm optimization (PSO) is a swarm intelligence algorithm well known for its simplicity and high efficiency on various problems. Conventional PSO suffers from premature convergence due to the rapid convergence speed and lack of population diversity. It is easy to get trapped in local optima. For this reason, improvements are made to detect stagnation during the optimization and reactivate the swarm to search towards the global optimum. This chapter imposes the reflecting bound-handling scheme and von Neumann topology on PSO to increase the population diversity. A novel crown jewel defense (CJD) strategy is introduced to restart the swarm when it is trapped in a local optimum region. The resultant algorithm named LCJDPSO-rfl is tested on a group of unimodal and multimodal benchmark functions with rotation and shifting. Experimental results suggest that the LCJDPSO-rfl outperforms state-of-the-art PSO variants on most of the functions.

Cloud and Mobile

2016 ◽  
pp. 1-20 ◽  
Author(s):  
Antonio Miguel Rosado da Cruz ◽  
Sara Paiva
Keyword(s):  
Cloud Computing ◽  
Mobile Computing ◽  
Mobile Devices ◽  
Mobile Apps ◽  
Mobile Technologies ◽  
Future Research ◽  
Mobile Cloud ◽  
Research Projects ◽  
Research Directions ◽  
Future Research Directions

Mobile computing and Cloud computing are two of the most growing technologies in number of users, practitioners and research projects. This chapter surveys mobile technologies and applications, along with cloud computing technologies and applications, presenting their evolution and characteristics. Then, building on mobile devices limitations and mobile apps increasing need of resources, and on the cloud computing ability to overcome those limitations, the chapter presents mobile cloud computing, and characterizes it by addressing approaches to augment mobile devices capabilities. The chapter is settled after some views about future research directions and some concluding remarks.

Sign in / Sign up

Export Citation Format

Share Document