Mobile Grid Computing Research Articles

Application Checkpointing Technique for Self-Healing From Failures in Mobile Grid Computing

A mobile grid (MG) consists of interconnected mobile devices which are used for high performance computing. Fault tolerance is an important property of mobile computational grid systems for achieving superior arrangement reliability and faster recovery from failures. Since the failure of the resources affects task execution fatally, fault tolerance service is essential to achieve QoS requirement in MG. The faults which occur in MG are link failure, node failure, task failure, limited bandwidth etc. Detecting these failures can help in better utilisation of the resources and timely notification to the user in a MG environment. These failures result in loss of computational results and data. Many algorithms or techniques were proposed for failure handling in traditional grids. The authors propose a checkpointing based failure handling technique which will improve arrangement reliability and failure recovery time for the MG network. Experimentation was conducted by creating a grid of ubiquitously available Android-based mobile phones.

Heuristic Search Based Localization in Mobile Computational Grid

In recent years, the number of cell phones in society has increased drastically and they are getting popular due to their computational ability and adaptability. Resource provisioning is important, but still remains NP-hard problem in mobile computational grid (MCG). Once the jobs are assigned to the MCG, the main challenge is how to identify the correct resource according to the job's requirement and use them to execute the sub-jobs. The heuristic methods such as Min-Min, Max-Min, and HEFT can be used to select appropriate resources from the MCG that is assigned for job execution. Since the computational nodes are static and mobile in nature, the performance of such heuristics is not as expected. Such heuristics suffers from low throughput and low speedup. The process of localization is used in a wireless sensor network with good results. The proposed model uses heuristics and localization process for optimizing the quality of service parameter localization, normalized speedup, and throughput in MCG, with the concept of grid nodes available in MCG. The observation shows significant improvement in the quality of service parameter localization, normalized speedup, and throughput in MCG. The proposed model HGLA and MIN-MIN, MAX-MIN, and HEFT are compared with respect to localization, speedup, and throughput. The results reveal that the proposed model shows better performance over MIN-MIN, MAX-MIN, and HEFT.

SaW: Video Analysis in Social Media with Web-Based Mobile Grid Computing

The burgeoning capabilities of Web browsers to exploit full-featured devices can turn the huge pool of social connected users into a powerful network of processing assets. HTML5 and JavaScript stacks support the deployment of social client-side processing infrastructure, while WebGL and WebCL fill the gap to gain full GPU and multi-CPU performance. Mobile Grid and Mobile Cloud Computing solutions leverage smart devices to relieve the processing tasks to be performed by the service infrastructure. Motivated to gain cost-efficiency, a social network service provider can outsource the video analysis to elements of a mobile grid as an infrastructure to complement an elastic cloud service. As long as users access to videos, batch image analysis tasks are dispatched from the server, executed in the background of the client-side hardware, and finally, results are consolidated by the server. This paper presents SaW (Social at Work) to provide a pure Web-based solution as a mobile grid to complement a cloud media service for image analysis on videos.

Recent Advances in Mobile Grid and Cloud Computing

Grid and cloud computing systems have been extensively used to solve large and complex problems in science and engineering areas. These systems include powerful computing resources connected through high-speed networks. Due to recent advances in mobile computing and networking technologies, it has become feasible to integrate various mobile devices such as robots, aerial vehicles, sensors, and smartphones with grid and cloud computing systems. This integration enables design and development of next generation of applications through sharing of resources in mobile environments and also introduces several challenges due to dynamic and unpredictable network. This paper discusses applications, research challenges involved in design and development of mobile grid and cloud computing systems, and recent advances in the field.

Optimized Application Level Checkpoint Based Load Sharing Model for Heterogeneous Mobile Grid Computing

Optimized Application Level Checkpoint Based Load Sharing Model for Heterogeneous Mobile Grid Computing

Optimized Application Level Checkpoint Based Load Sharing Model for Heterogeneous Mobile Grid Computing

Objectives: Recent technical advances have fueled the popularity of mobile grid computing. Mobile devices such as cellular phones and PDAs are becoming more common due to the diminution in their size and increase of computational power. In addition, wireless networks are also beginning to fill the environment. With these advances, mobile devices are becoming available to act as service providers in Grid. But the mobile environment presents a number of challenges. Analysis: The range of mobile execution platforms now available which introduces the problem of heterogeneity. Heavy weight checkpoints also provide hindrance to achieve this integration. At present, Grid Computing standards, neither state any load sharing architecture and model that integrates mobile devices in Grid computing nor does it provide any policy that hides heterogeneity and overcome memory limitations of mobile devices thus it is still an open research problem. Findings: Mobile Grid computing solutions must be developed that are lightweight, independent of specific platform and a load sharing model for mobile grid computing that distributes computational tasks on heterogeneous mobile devices. Our simulation results show the effectiveness of data optimization techniques for mobile devices, interoperability and proxy performance in heterogeneous mobile environment. Novelty: We propose a novel layered architecture that adjusts the data size of checkpoints at the minimum possible level and a load sharing Mobile Proxy algorithm.

A quantum‐inspired binary gravitational search algorithm–based job‐scheduling model for mobile computational grid

SummaryOwing to the advancements in low‐power consumption processors and high‐power storage in a small‐sized battery, the cost of handheld mobile devices, eg, mobiles, tabs, or personal digital assistants, have reduced to a great extent. This has enabled people to have at least 1 smartphone in general with this number increasing exponentially. However, the increasing use of these mobile devices results in an equal increase in the underused processing capacity of these devices too. This encourages the research aiming to use this processing power by forming a mobile computational grid. Because of the inherent limitations of bandwidth, battery, and computational power, job scheduling on these devices demands an efficient scheduling approach to harness the true potential of the grid. The problem becomes even more challenging considering the dynamic nature of these mobile devices. Job scheduling being nondeterministic polynomial time–complete allows the use of evolutionary approaches by exploring and exploiting the search space efficiently. The exploration gets boosted even more with the use of quantum‐computing concepts. This work proposes a quantum‐inspired Newtonian approach of attraction based on gravitational search algorithm for scheduling the jobs on mobile computational grid. Simulation study has been performed to evaluate the performance of the model over various dimensions. A comparative study has been performed with quantum‐genetic algorithm. Simulation result establishes the effectiveness of model under various test conditions.

FAULT TOLERANCE IN MOBILE GRID COMPUTING

This paper proposes a novel model for Surrogate Object based paradigm in mobile grid environment for achieving a Tolerance. Basically Mobile Grid Computing Model focuses on Service Composition and Resource Sharing Process. In order to increase the performance of the system, Recovery plays a vital role. In our Proposed System for Recovery point, Surrogate Object Based Checkpoint Recovery Model is introduced. This Checkpoint Recovery model depends on the Surrogate Object and the Recovery is handled by means of Replication Approach. The mobility problem is overcome based on Distributed Surrogate Object model. In our comparison, our proposed fault recovery model proves its efficiency and reliability in Grid Environment. To cite this document: Aghila Rajagopal and M.A. Maluk Mohamed, Fault tolerance in mobile GRID computing, International Journal of Electronic Commerce Studies, Vol.5, No.1, pp. 115-122, 2014. Permanent link to this document: http://dx.doi.org/10.7903/ijecs.1107

An Optimized Parallel Computing Paradigm for Mobile Grids Based on DSPOM

Parallel computing methods decrease the processing time in mobile distributed systems compared to the conventional sequential computing techniques. But as they are developed from smaller mobile clusters to extensive mobile grids, they are prone to issues like high latency/jitter, processing speed, communication overhead, and low data transfer rate. So, an efficient and optimized parallel computing paradigm known as Distributed Shared Proxy Object Model (DSPOM) is developed based on Surrogate Object Model (SOM) integrated with Distributed Shared Object (DSO) for mobile grid. SOM is chosen to enhance the resource sharing of mobile grid computing, while DSO is chosen to reduce the computational complexity. The unused computing determinant is utilized by SOM to save the processing time. The transparency of the DSO model in terms of distribution and heterogeneity reduces the computational complexity. DSO also enhances the load adaptability and fault-tolerance to parallel programs on the mobile grid. The DSPO model performs better in terms of query time, query latency, packet loss, load adaptability, and fault-tolerance.

ASAMO: Authentication and Secure Communication using Abstract Monitoring Objects for Mobile Grid Computing

The prominent feature of mobile grid computing is the collaboration of multiple entities to perform collaborative tasks using mobile devices. Currently, most of the security solutions for mobile grid environment use static set of algorithms and protocols. Despite the increased usage of mobile computing, exploiting its full potential is difficult due to its inherent problems such as resource scarcity, frequent disconnections, and mobility. Our focus is to provide security and efficient power management. In this paper, a framework of dynamic secure routing protocol called Select Successive Hop Routing (SSHR) algorithm using Abstract Monitoring Objects (AMOs), Secure Service Certificates (SSC) and layer based encryption for each data transfers to improve the security level, anonymity and dynamicity of the data are proposed. This includes (i) Authentication of the mobile node (ii) Security flow between mobile nodes (iii) Saving battery power (iv) Hand-over of authentication information. The proposed framework solves the issues like asymmetry in network connectivity, computing power and mobility. The outcome is compared with certain existing security protocols and demonstrates how the proposed protocol is able to adapt itself over different conditions of the mobile device, and how it can provide a performance gain in the execution.

A Resource-Aware Task Scheduling Algorithm on Mobile Computational Grid

This paper proposes a Resource-Aware Task Scheduling algorithm, named RATS, on mobile computational grid environment for scheduling tasks of mobile computing applications. Based on RATS, a proper order of tasks can be found out and the tasks can be scheduled to mobile grid nodes effectively and efficiently without taking account of resources, such as bandwidth and remaining energy, the cooperated grid nodes have. Some experiments have been conducted to evaluate the performance and reliability of RATS and to make a comparison with existing approaches. The results show that the RATS is superior to the others in term of efficiency, survival rate and reliability.

Systematic design of secure Mobile Grid systems

Grid computing has arisen as an evolution of distributed systems mainly focused on the sharing of and remote access to resources in a uniform, transparent, secure, efficient and reliable manner. It is possible to join Grid technology and mobile technology in order to create one of the most promising technologies and developments to appear in recent years, in that they enrich one another and provide new solutions that solve many of the limitations and problems found in different technologies. Security is a very important factor in Mobile Grid Computing and is also difficult to achieve owing to the open nature of wireless networks and heterogeneous and distributed environments. Success in obtaining a secure system originates in incorporating security from the first stages of the development process. It has therefore been necessary to define a development process for this kind of systems in which security is incorporated in all stages of the development and the features and particularities of the Mobile Grid systems are taken into consideration. This paper presents one of the activities of this development process, the design activity, which consists of defining and designing a security software architecture. This architecture will be built from a security architecture, defined as reference architecture, in which security services, interfaces and operations are defined with the purpose of defining a reference security architecture which covers the majority of security requirements identified in the analysis activity. The design activity will build the system architecture that will be the input artefact for the subsequent activity in the process, which is the construction activity.

Utility-based scheduling for grid computing under constraints of energy budget and deadline

With recent advances in computing and communication technologies enabling mobile devices more powerful, the scope of Grid computing has been broadened to include mobile and pervasive devices. Energy has become a critical resource in such devices. So, battery energy limitation is the main challenge towards enabling persistent mobile grid computing. In this paper, we address the problem of energy constrained scheduling scheme for the grid environment. There is a limited energy budget for grid applications. The paper investigates both energy minimization for mobile devices and grid utility optimization problem. We formalize energy aware scheduling using nonlinear optimization theory under constraints of energy budget and deadline. The paper also proposes distributed pricing based algorithm that is used to tradeoff energy and deadline to achieve a system wide optimization based on the preference of the grid user. The simulations reveal that the proposed energy constrained scheduling algorithms can obtain better performance than the previous approach that considers both energy consumption and deadline.