Search

Mobile crowd computing (MCC) that utilizes public-owned (crowd’s) smart mobile devices (SMDs) collectively can give adequate computing power without any additional financial and ecological cost. However, the major challenge is to cope with the mobility (or availability) issue of SMDs. User’s unpredicted mobility makes the SMDs really unstable resources. Selecting such erratic resources for job schedule would result in frequent job offloading and, in the worst case, job loss, which would affect the overall performance and the quality of service of MCC. In a Local MCC, generally, a set of users are available for a certain period regularly. Based on this information, the chances of a user being available for a certain duration from a given point of time can be predicted. In this paper, we provide an effective model to predict the availability of the users (i.e., their SMDs) in such an MCC environment. We argue that before submitting a job to an SMD, the stability of it is to be assessed for the duration of execution of the job to be assigned. If the predicted availability period is greater than the job size, then only the job should be assigned to the SMD. An accurate prediction will minimize the unnecessary job offloading or job loss due to the early departure of the designated SMD. We propose an advanced convolutional feature extraction mechanism that is applied to LSTM and GRU-based time-series prediction models for predicting SMD availability. To collect user mobility data, we considered a research lab scenario, where real mobility traces were recorded with respect to a Wi-Fi access point. We compared the prediction performances of convolutional LSTM and GRU with the basic LSTM and GRU and ARIMA in terms of MAE, RMSE, R2, accuracy, and perplexity. In all the measurements, the proposed convolutional LSTM exhibited considerably better prediction performance.

Resource owners in mobile grids, with financial motivations in mind, provide their clients with the resources they possess. The clients can, on the other hand, obtain what they seek through the payments they make. Mobile grid users may also demand cost- and time-optimizing strategies as part of their service quality. As a result, the scheduling system, through making use of a proper algorithm, should allocate resources to users’ independent tasks in such a way that would minimize time and cost parameters. Hence, in this paper, two scheduling algorithms are introduced with regard to user needs based upon Particle Swarm Optimization (PSO), which, through mutation and population expanding, are able to find the best scheduling scheme for user tasks, while preventing quick algorithm convergence.

In mobile crowd computing (MCC), smart mobile devices (SMDs) are utilized as computing resources. To achieve satisfactory performance and quality of service, selecting the most suitable resources (SMDs) is crucial. The selection is generally made based on the computing capability of an SMD, which is defined by its various fixed and variable resource parameters. As the selection is made on different criteria of varying significance, the resource selection problem can be duly represented as an MCDM problem. However, for the real-time implementation of MCC and considering its dynamicity, the resource selection algorithm should be time-efficient. In this paper, we aim to find out a suitable MCDM method for resource selection in such a dynamic and time-constraint environment. For this, we present a comparative analysis of various MCDM methods under asymmetric conditions with varying selection criteria and alternative sets. Various datasets of different sizes are used for evaluation. We execute each program on a Windows-based laptop and also on an Android-based smartphone to assess average runtimes. Besides time complexity analysis, we perform sensitivity analysis and ranking order comparison to check the correctness, stability, and reliability of the rankings generated by each method.

Mobile devices have evolved from single purpose devices, such as mobile phone, into general purpose multi-core computers with considerable unused capabilities. Therefore, several researchers have considered harnessing the power of these battery-powered devices for distributed computing. Despite their ever-growing capabilities, using battery as power source for mobile devices represents a major challenge for applying traditional distributed computing techniques. Particularly, researchers aimed at using mobile devices as resources for executing computationally intensive task. Different job scheduling algorithms were proposed with this aim, but many of them require information that is unavailable or difficult to obtain in real-life environments, such as how much energy would require a job to be finished. In this context, Simple Energy Aware Scheduler (SEAS) is a scheduling technique for computational intensive Mobile Grids that only require easily accessible information. It was proposed in 2010 and it has been the base for a range of research work. Despite being described as easily implementable in real-life scenarios, SEAS and other SEAS-improvements works have always been evaluated using simulations. In this work, we present a distributed computing platform for mobile devices that support SEAS and empirical evaluation of the SEAS scheduler. This evaluation followed the methodology of the original SEAS evaluation, in which Random and Round Robin schedulers were used as baselines. Although the original evaluation was performed by simulation using notebooks profile instead of smartphones and tablets, results confirms that SEAS outperforms the baseline schedulers.