Mobile Grid Environment Research Articles

An Efficient Fault Tolerant Mechanism for Mobile Grid Environment

In mobile grid environment, the existing fault tolerance techniques are not feasible and proficient. The present techniques lack to achieve the maximum profit associated with successful execution of the tasks and is deemed to be costly. Hence, we propose a fault tolerance mechanism for scheduling in mobile grid environment. In this technique, we consider failures that occurs during the execution of computing-focused and communication-focused jobs. In order to detect the failure, a novel structured data packet is sent to the destination. The destination acknowledges with a specific type of data packet corresponding to the received packet. The sender analyses the acknowledgement data packet identifies the place and nature of error. Finally, a fault recovery action is performed using the FTMS technique. By simulation results, we show that the proposed technique is reliable and efficient.

Resource availability prediction using semi-Markov model in mobile grid environment

Integration of mobile resources in grid environment increases the complexity of resource prediction owing to heterogeneity, dynamic nature of resources, mobility pattern and uncertainty in the availability. The mobile grid has geographically distributed autonomous resources and is composed of hardware and software resources that need to be located. The existing resource prediction approaches in mobile grid treat resources equally. These approaches face problems in terms of resource prediction times. This can be reduced by predicting the availability of resources based on its characteristics. The dynamic characteristics of mobile resources increase complexities in resource prediction and filtering process, which in turn increases resource prediction time. In this paper, a semi-Markov model based availability prediction mechanism is proposed for the mobile grid environment. This mechanism uses a semi-Markov model to predict the resources availability and a mapper to filter the resources based on task requirement, which reduces resource prediction time.

Resource availability prediction using semi-Markov model in mobile grid environment

Integration of mobile resources in grid environment increases the complexity of resource prediction owing to heterogeneity, dynamic nature of resources, mobility pattern and uncertainty in the availability. The mobile grid has geographically distributed autonomous resources and is composed of hardware and software resources that need to be located. The existing resource prediction approaches in mobile grid treat resources equally. These approaches face problems in terms of resource prediction times. This can be reduced by predicting the availability of resources based on its characteristics. The dynamic characteristics of mobile resources increase complexities in resource prediction and filtering process, which in turn increases resource prediction time. In this paper, a semi-Markov model based availability prediction mechanism is proposed for the mobile grid environment. This mechanism uses a semi-Markov model to predict the resources availability and a mapper to filter the resources based on task requirement, which reduces resource prediction time.

A scheduling algorithm with dynamic properties in mobile grid

Mobile grid is a branch of grid computing that incorporates mobile devices into the grid infrastructure. It poses new challenges because mobile devices are typically resource-constrained and exhibit unique characteristics such as instability in network connections. New scheduling strategies are imperative in mobile grid to efficiently utilize the devices. This paper presents a scheduling algorithm that considers dynamic properties of mobile devices such as availability, reliability, maintainability, and usage pattern in mobile grid environments. In particular, usage patterns caused by voluntarily or involuntarily losing a connection, such as switching off the device or a network interruption could be important criteria for choosing the best resource to execute a job. The experimental results show that our scheduling algorithm provides superior performance in terms of execution time, as compared to the other methods that do not consider usage pattern. Throughout the experiments, we found it essential to consider usage pattern for improving performance in the mobile grid.

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

Mobility Aware Load Balanced Scheduling Algorithm for Mobile Grid Environment

The Present Grid community is trying to incorporate mobile devices such as PDA, Laptops, and sensor devices supporting abile functionalities in to their Grid network. The most challenging aspect in mobile Grid are job scheduling and load balancing under the unreliable communication environment. The existing job scheduling algorithms lag to verify the node’s capability and to optimize the job execution time. This deficiency leads to increased network overhead causing poor network performance. To overcome these issues, we propose a mobility aware load balanced scheduling algorithm. Our approach categories the jobs into Computing-focused and Communication-focused jobs. The computing-intensive jobs are allocated to the resources with shorter round-trip-time, high CPU speed and capacity. The communication-intensive jobs are allocated to resources with low mobility and high reliability. The outcome of this approach results in most excellent balanced job allocation across the mobile nodes. By simulation results, we show that the proposed approach gives optimized results compared to existing techniques

Performance modelling and analysis of mobile grid computing systems

Mobile grid computing has gained immense importance with academics, industry and the military. The performance issues such as load balancing, fault tolerance and reliability are quite important in mobile grid environments. In this paper, a decentralised load balancing model with fault tolerance for mobile grid computing system is proposed. Two algorithms are proposed: one for decentralised load balancing and the other for fault tolerance. The efficiency and time complexity of the proposed algorithms are found better compared to the existing works. The paper also proposes a method for modelling the reliability of mobile grid. Two terminal reliability of mobile grid computing system has been evaluated using the proposed model. The simulation results are presented.

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.

Distributed Pipes Enforcement in Mobile Grid Environment - A Novel Approach for Task Scheduling

The Mobile Grid Environment has the dynamic structure in which the position and location of grid changes vigorously. It compounds the pervasive ingression methods of mobile computing and coalition of computational resources from multiple domains to attain a common task. Due to mobility, failure of nodes, disconnection and network partitioning in networks, resource allocation and scheduling is being the demanding problems. We endow with solutions to the above-mentioned problems by implementing pipes in the Mobile grid environment. It is conspicuous that pipes are the collection of segments or processes that are connected in a series which can execute its process concurrently with the other segments or processes in a successive manner. We contrive temporal clusters in our Distributed Pipes Enforcement (DPE) methodology with the determination of demand bound functions and induce master/slave conceits with that in order to augment the efficiency in task completion and abate the resource dissipation. With this, the chances to get erroneous result can be probably avoided. Our approach caters for performance optimization, flexible deployment and consistency. Index Terms—Deadline analysis, demand bound function, master/slave, mobile grid, pipes, scheduling.

Zone Based Job Scheduling In Mobile Grid Environment

Recent advances in mobile computing, and strong interest of the scientific community in the Grid have led to research into the Mobile Grid. One primary issue associated with the efficient and effective utilization of mobile resources in a mobile grid is scheduling of tasks. In this paper, a task scheduling algorithm is proposed based on the dynamic prediction of resource mobility and battery power in the mobile grid environment. The mobility is predicted based on the movement type, movement pattern and movement direction of the mobile resource within the zone. The battery power is predicted based the C-rate of the mobile resource. The availability prediction of a mobile resource is evaluated during the task submission and this allows the system to consider run-time parameters prior to execution. The evaluation study employs a number of experiments with various simulation settings. The simulation results point to the efficacy of the proposed work.

A Fault Tolerant Resource Allocation Architecture for Mobile Grid

Problem statement: In order to achieve high level of reliability and availability, the grid infrastructure should be fault tolerant. Since the failure of resources affects job execution fatally, fault tolerance service is essential to satisfy QoS requirement in grid computing with respect to mobile nodes. Approach: We propose a fault tolerant technique for improving reliability in mobile grid environment considering the node mobility. The Cluster head and monitoring agent was designed in such a way it addresses both resource and network failure and present recovery techniques for overcoming the faults. Results: The proposed model achieves a identifiable performance when compared to the previous model (HRAA). By simulation results, we analyze the node and link failures on parameters such as delivery ratio, throughput and delay against the rate of success. Conclusion: The proposed fault tolerant approach checks for availability of the nodes with least work load for transferring the executed job to cluster head providing an alternate path in case of failure thereby enhancing the reliability of the grid environment.

A Multi-Agent Based Data Replication Mechanism for Mobile Grid

Problem statement: In Mobile grid, the mobile devices can be effectively incorporated in to the Grid. It enables both the mobility of the users requesting access to a fixed grid and the resources that are themselves as part of the grid. There are number challenging issues for mobile grid; such as connectivity, availability, maintainability, consistency and fault tolerance. This study addresses the issue of data replication solution that maintains consistency, which improves the availability of replicated data in a small scale mobile grid environment. Approach: In this study we propose a structural design that improves the availability in a mobile grid environment by placing the replica in an optimized manner so that the performance of the mobile grid environment can be improved and a multi agent based approach to maintain the consistency between the replicated data effectively by propagating the latest updates intelligently. Results: The study presents the results depicting the advantageous of using agents in data replication, which includes reduction in data communication cost under different circumstances like change in mobility of nodes, read write ratio of nodes and replication schema. Conclusion: The proposed method will select the optimum number of locations to place the replica such that the maintenance overhead such as update propagation, consistency maintenance, storage cost and communication cost will be reduced.

Dynamic Policy Management in Mobile Grid Environments

Mobile Grid Services has given the ability to move jobs, data and application software from nodes to nodes during jobs execution in the grid environment. These migrations depend on the grid’s users and the grid’s nodes policies. The heterogeneity, diversity of policies and attributes leads to a need for policy management tools that can handle these problems. Also, before the users can submit their jobs or run their applications on a certain resource or system they may need to guarantee that this resource or system has not been compromised, which could result in their own application or data being stolen or asking for certain users to be allowed to access the service. To date, not enough attention has been paid to policies that deal with such concerns. Most existing grid systems have support only limited types of policies (e.g. CPU resources). A few designs consider enforcing data policies in their architecture. Therefore, we propose a dynamic policy framework that addresses these issues (user-submitted policy, data policy and multiple Virtual Organizations (VOs).

Fuzzy Based Task Scheduling for Hierarchical Resource Allocation in Mobile Grid Environment

Fuzzy Based Task Scheduling for Hierarchical Resource Allocation in Mobile Grid Environment

A Cooperative Cell Model in Computational Mobile Grid

Computation in the mobile grid nodes under the cellular network environment requires an efficient management of wireless channels along with the user mobility. Due to random movement of the mobile devices, the load over the cells in terms of initiation of new computation or carryover computation (handoff) may vary dynamically. This may result in non-availability of free channels for Inter-task communication leading in the drop of carryover computation or to initiate the new computation in the current cell. The proposed work designs a model by instigating substantive cooperation among underutilized and the overloaded cells, considering importance to the frequency reuse and assigning priority to the on-going computation in the computational mobile grid. The model seeks cooperation by grouping the cells in different sizes to reduce the blocking and dropping of the computation. Blocking of the communication is very serious in computational mobile grid environment as the drop may result in the termination of the computation. The model aims at minimizing the Call Block Probability (CBP) and Call Drop Probability (CDP) in the mobile grid by making the clusters of different sizes. A simulation experiment to evaluate the performance of the proposed model reveals the effectiveness of this model.

Performance Evaluation of Reactive Routing in Mobile Grid Environment

Grid computing came into existence as a manner of sharing heavy computational loads among multiple computers to be able to compute highly complex mathematical problems. The grid topology is highly flexible and easily scalable, allowing users to join and leave the grid without the hassle of time and resource-hungry identification procedures, having to adjust their devices or install additional software. The goal of grid computing is described as “to provide flexible, secure and coordinated resource sharing among dynamic collections of individuals, institutions and resources”. AODV is an on-demand (reactive) algorithm capable of both unicast and multicast routing. In this paper, AODV has been modified by varying some of the configuration parameters used in this algorithm to improve its performance. This modified protocol i.e. A-AODV (advanced ad hoc on demand distance vector) has been compared with AODV in grid environment. The simulations have shown that A-AODV is able to achieve high throughput and packet delivery ratio and average end-to-end delay is reduced.

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.

Device Resource Allocation in Context-Aware Mobile Grid

This paper presents device resource allocation in context-aware mobile grid. Context information in mobile grid includes device capabilities, network status and user preferences. The objective of the paper is to efficiently allocate mobile device resource under the contexts of mobile grid environment. The paper uses utility to express values for the device resource allocation. Device resource allocation was formulated by utility optimization in mobile grid. Device resource allocation algorithm (DRAA) is proposed which decomposes optimization problem into sub-problems. In the simulation, DRAA in context-aware mobile grid was compared with other related work.

An adaptive fault tolerance approach to enhance the execution of applications on multi-cluster grid configurations from mobile grid interfaces in wireless networks

Mobile grid environments can be broadly divided into two different types of configurations. In the first case, devices are used as grid interfaces. In the second configuration, mobile devices are considered to be grid resources. However, the interaction between mobile devices and wired networks still has to overcome several difficulties before it can produce an operational mobile grid infrastructure, in either type of configuration. Examples of these challenges include the submission of distributed applications to execute tasks in a coordinated manner, frequent disconnections, restrictions on power consumption and the selection of suitable grid resources for application executions. In this paper, a research study is conducted involving an adaptive fault tolerance approach for grid interfaces in wireless networks to enhance the submission and execution of distributed applications. The approach examines submission, monitoring and management functions through the use of fault tolerance and workflow mechanisms, especially when disconnections occur and the mobile devices are executing an application. The empirical results show that the proposed approach can achieve a satisfactory level to support grid interfaces in a wireless network, and provide a more robust environment for application executions with less power.

Context aware service provisioning in mobile grid

In mobile grid, it is necessary to maintain end users’ needs while addressing issues such as rapid, unpredictable changes of highly mobile contexts in which wireless mobile devices operate. Context-aware mobile grid services that exploit information about user and device context are becoming one of the core components in mobile grid environment. This paper presents a contexts aware service provisioning in mobile grid. The paper describes device context information for context-aware services in the mobile device collaboration. An algorithm is proposed to dynamically deliver services to mobile grid users according to both user needs and current contexts. The algorithm decomposes global optimization problem into sub-optimizations. In the experiment, the performance evaluation of context aware service provisioning algorithm is conducted.