Ad Hoc Grid Research Articles

A Mobile Ad Hoc Grid is Simulated Using Three Basic Conquering Protocols

An ad hoc grid mightsubsistamixture containing cellular movable nodes dynamically forming a brief grid while not affecting employment containing any occur grid infrastructure or centralized administration. Variety was containing conquering protocols like aggressive supply conquering (DSR), Adhoc On-Demand Distance Vector conquering (AODV) including Destination-Sequenced Distance- Vector (DSDV) grip enforced.During aforementioned paper, a trial acquire persist created en route being check affecting act containing 2 outstanding on-demand hastydirection-finding obligation being fixed spontaneous networks: DSR including AODV, at affecting side containing affecting standard proactive DSDV protocol.Affectingreproductions were administered through NS2 machine.Affectingperformances containing affecting steering obligation were evaluated via matrices conquering overhead, suspension plus container transmission magnitude relation being various traffic densities including knob mobility’s. Once counterfeit including elaborated search containing affecting consequences, it absolutely found that DSR outperforms higher than unusualdirection-findingset containing rules.

Ad Hoc Grid Resource Management: Grid Security

The purpose of security in ad hoc grid environments is to support secure execution of tasks on shared resources and to protect the resources from malicious user actions. The concept of trust management is capable to solve the security issues by incorporating trust into the process of decision making. The quality of the decisions is dependent on a correct assessment and representation of trustworthiness assigned to the potentially collaborating parties. In most cases the value of trustworthiness is derived at least from direct trust and recommendations, but other factors as risk, uncertainty, context dependent information and attributes characterizing the task and the shared resource should be included in the derived value as well. This paper presents a specification of parameters relevant for an accurate trust evaluation.

A Survey on Trust Aware Security and Scheduling in Traditional and Ad Hoc Grids

A Survey on Trust Aware Security and Scheduling in Traditional and Ad Hoc Grids

Specification of Parameters Relevant for Trust Evaluation in an Adhoc Grid Environment

Specification of Parameters Relevant for Trust Evaluation in an Adhoc Grid Environment

A Context-aware Task Scheduling in Ad-hoc Desktop Grids

Abstract To harvest idle, unused computational resources in networked environments, researchers have proposed different architectures for desktop grid infrastructure. In this paper, we present one such infrastructure, called the Mini-Grid Framework for resource management in ad hoc grids using market-based scheduling and context-based resource and application modeling. The framework proposes peer-to-peer architecture that supports several futures: decentralized task distribution, small scale ad hoc grid formation, and symmetric resource. Furthermore, users can model and specify non-performance based parameters that influence resource allocation. Different types of resources can provide similar capabilities but with varying degrees of quality of service. Hence, the resource capabilities are required to be presented in such a way that resource providers can evaluate their capabilities against the requested capabilities for task execution, and the resource consumers can find optimal resources.

Reliability of Resource Allocation in Mobile Ad Hoc Grid with Tasks Replication

In the interest of achieving higher reliability, mobile ad hoc grid should apply a fault tolerance in resource allocation scheme. Resource allocation plays a critical role in mobile ad hoc grids due to the dynamic nature of nodes connection. Allocating appropriate resources for the tasks can avoid uncompleted tasks and ensure service reliability. We propose two approaches for avoiding tasks failure due to nodes mobility. They are selecting resource nodes, which have corresponding mobility with resource management system, and implementing task replication strategy. Task replication is expected to increase service reliability. In this paper, we study the reliability of the resource allocation scheme which considers mobile ad hoc grids with centralized architecture with the presence of dependent tasks. Eventually, numerical examples are given to illustrate resulting equations. The result shows that assigning tasks replication provides superior reliability in mobile ad hoc grid, and tasks replication could also minimize the required service time of completing the tasks.

A Novel Approach of Service Discovery Based on Tree Di-Rectory Architecture in Ad-Hoc Grid

Grid computing is a new technology that using communication infrastructure facilities of computer networks and distributed systems features are able to connect to heterogeneous computing resources, so that the whole structure seems as an integrated virtual machine. One of the important problems in ad hoc grid environment is service discovery. In this paper, we propose tree directory architecture for service discovery in ad hoc grid environment, So that we used directory technique for implement of service discovery mechanism. We’ll show that having a directory in ad hoc gird network isn’t useful, so we need to have a set of directories. Therefore, the geographical area of ad hoc network divide into a 2-D logical hierarchical grid and each cell in the grid, select a directory as agent cell. By using tree architecture, the whole directory is designed as a multi-layer tree. Then, the request of requestor can be search for service discovery from bottom to top. We show using the simulation results that tree architecture for directories to raise the discovery success ratio.

Improvement of Service Discovery Algorithm Using Tree-based Architecture in Ad-hoc Grid Environment

Grid computing is a new technology that using communication infrastructure facilities of computer networks and distributed systems features are able to connect to heterogeneous computing resources, so that the whole structure seems as an integrated virtual machine. One of the important problems in ad hoc grid environment is service discovery. In this paper, we propose tree directory architecture for service discovery in ad hoc grid environment, So that we used directory technique for implement of service discovery mechanism. We’ll show that having a directory in ad hoc gird network isn’t useful, so we need to have a set of directories. Therefore, the geographical area of ad hoc network divide into a 2-D logical hierarchical grid and each cell in the grid, select a directory as agent cell. By using tree architecture, the whole directory is designed as a multi-layer tree. Then, the request of requestor can be search for service discovery from bottom to top. We show using the simulation results that tree architecture for directories to raise the discovery success ratio.

Information systems frontiers editorial December 2012

Information Systems Frontiers (ISF) has crossed its first decade. We would like to thank all the Advisory Editors, the Executive Editors, the special issue editors and the various referees from across the world and of course Springer, the publishers, who have made this journal a success. In this last issue of 2012, ISF brings to you, nine articles which span the various topics at the frontiers of information systems. The lead article by Nobel Laureate, Arrow (2012) is a thought piece on economic theory and the financial crisis. In this article, Profesor Arrrow probes the role of the market in allocating resources. He suggests that the failure of markets for various kinds of derivative securities to perform properly is an essential element of the current financial crisis. Financial crises are not a new phenomenon and have been recognized by economists from John Stuart Mill (1848) onwards. Professor Arrow starts with the neoclassical general equilibrium framework, and seeks to identify a possible point at which it fails to supply a coherent theory of securities markets and so might possibly lead to some understanding of the repeated crises of the financial system underlying the development of capitalism. The article also touches upon one of the most important innovations in economic theory in the last 50 years–asymmetric information and points out that the presence of asymmetric information creates difficulties with the allocation of risks through the market. Professor Arrow argues that information is of the utmost importance in making economic decisions, especially when it comes to securities or other assets whose value depends on events that are yet unknown. Finally Professor Arrow discusses the issues of inefficient incentives and their impact on the financial crisis and concludes with some policy implications. The second article by Professors Zo et al. (2012) focuses on end-to-end reliability of service oriented applications. The paper focuses on reliability issues associated with applications developed within service oriented architecture. It develops a measure for deriving end-to-end application reliability. It further develops a model to help select appropriate services for tasks in the business process which accommodate the redundant and overlapping functionality of available services and planned redundancy in task support. A genetic algorithm approach is adopted to select promising services to assemble the application using endto-end reliability as the criterion of interest. The paper concludes with an application to a real-world business process. Professors Chunlin Li and Layuan Li develop an efficient resource allocation for maximizing benefit of users and resource providers in ad hoc grid environment (2012). The paper proposes an efficient resource allocation scheme for grid computing marketplace where ad hoc grid user agents can buy usage of memory and CPU from grid resource providers. The agents goal is to obtain optimized quality of service to accomplish their tasks on time within a given budget, and achieve profit maximization. The paper combines perspectives of adhoc grid users as well as resource providers. Simulations are conducted to compare the performance of the algorithms with related work. The fourth article, FAST: Fundamental Analysis Support for Financial Statements: Using semantics for trading recommendations (2012) is by Professors Alejandro Rodriguez-Gonzalez, Ricardo Colomo-Palacios & Fernando Guldris-Iglesias, Juan Miguel Gomez-Berbis and Angel Garcia-Crespo. The authors present a real trading system that has been developed using semantic technologies. These enable the definition of schemes that can be used for storing financial information, which, in turn, can be easily accessed and queried. Additionally, they incorporate R. Ramesh :H. R. Rao (*) SUNY Buffalo, Buffalo, NY, USA e-mail: mgmtrao@gmail.com

Self-Adaptive Economic-Based Resource Allocation in Ad-Hoc Grids

Resource allocation is the process of discovering and allocating resources to requested tasks in a way that satisfy both user jobs and resource administrators. In ad-hoc Grids, resource allocation is a challenging undertaking as tasks and resources are distributed, heterogeneous in nature, owned by different individuals or organizations and they may arise spontaneously at any time with various requirements and availabilities. In this paper, the authors address an economic-based framework for resource allocation in ad-hoc Grids to deal with the dynamic nature of such networks. Within the economic framework, self-interested nodes in ad-hoc Grids are considered as consumers (buyers) and producers (sellers) of resources. Consumers and producers of resources are autonomous agents that cooperate through a simple, single metric namely the price that summarizes the global state of a network in a number. Adaptation is achieved by individual nodes through adopting a bidding strategy that adjusts the price according to the current state of the network in order to optimize the local utility of the node.

A Comparative Study of Routing Protocols in e-Health Applications for Heterogeneous Interfaced Mobile Ad-Hoc Grid

computing has become an indispensable way of life in recent years. Recent advancement in Mobile phones and other handheld devices have enabled them of using various types of networks, which were meant for computers only. The integration of such devices into heterogeneous grids has emerged new research challenges. Different types of devices with heterogeneous interfaces and computational powers require versatile mechanisms to cope with various types of applications and situations. This paper presents the performance analysis of reactive and proactive routing protocols used for mobile ad-hoc grids in e-health applications. The performance of four protocols is analyzed in terms of routing load and response time. Further, the feasibility of heterogeneous interfaces in mobile ad-hoc grid is analyzed in terms of energy consumption. KeywordsGrid, Routing Protocols, E-Health, Ad-hoc Grid, Mobility, Heterogeneous Grid

An Improved Performance Analysis Of Priority Scheduling Algorithm In Modified Ad Hoc Grid Layer

An improved performance analysis of priority based scheduling algorithm for the ad hoc grid layer is presented in this paper. A priority queuing model is developed to reduce the execution time of the jobs. Here, jobs to be dispatched based on priority. Execution time is one prime metric proposed for the system. We have achieved the overall execution time for the proposed system for 25 jobs is7.94 milliseconds whereas in the existing it is 26.725milliseconds.

A Market-Based Resource Allocation Policy in Ad Hoc Grid

The paper proposes a market-based resource allocation policy in ad hoc grid environments. The objective of optimal resource allocation in ad hoc grid is to maximize the utility of the ad hoc grid system without exceeding the resource capacity constraints, expense budget and the deadline. Ad hoc grid user agents acted as the consumers pay for the ad hoc grid resources and resource providers get profits from user agents. Our grid resource allocation optimization is decomposed to two subproblems. In the simulation, the comparison experiments are conducted to test the performance of the algorithms.

Performance Analysis of Congestion Control in Mobile Ad Hoc Grid Layer

Ad Hoc Grid deals with the challenges in resource discovery and job scheduling due to its mobility and power consumption. In this paper a new grid computing technique is implemented to manage the congestion control with job scheduling. The proposed addition of the mobile ad hoc network with in AHGL can offer maximum network utility. The model is implemented in the NS-2 network simulator.

Simulations of large-scale WiFi-based wireless networks: Interdisciplinary challenges and applications

Wireless Fidelity (WiFi) is the fastest growing wireless technology to date. In addition to providing wire-free connectivity to the Internet WiFi technology also enables mobile devices to connect directly to each other and form highly dynamic wireless adhoc networks. Such distributed networks can be used to perform cooperative communication tasks such ad data routing and information dissemination in the absence of a fixed infrastructure. Furthermore, adhoc grids composed of wirelessly networked portable devices are emerging as a new paradigm in grid computing. In this paper we review computational and algorithmic challenges of high-fidelity simulations of such WiFi-based wireless communication and computing networks, including scalable topology maintenance, mobility modelling, parallelisation and synchronisation. We explore similarities and differences between the simulations of these networks and simulations of interacting many-particle systems, such as molecular dynamics (MD) simulations. We show how the cell linked-list algorithm which we have adapted from our MD simulations can be used to greatly improve the computational performance of wireless network simulators in the presence of mobility, and illustrate with an example from our simulation studies of worm attacks on mobile wireless adhoc networks.

A hybrid mechanism for resource/service discovery in ad-hoc grids

With the proliferation of wireless mobile devices (laptops, PDAs, mobile phones, wireless sensors, etc.), and the development of efficient protocols for communication, routing, and addressing in mobile ad-hoc networks, wireless ad-hoc grids are emerging as a new computing paradigm, enabling innovative applications through the efficient sharing of information, computing resources, and services among devices in ad-hoc networks. However, the adaptation of grid technology to ad-hoc networks is not straightforward, and exhibits numerous difficulties (resource discovery, security, power consumption, QoS, etc.). This paper is focussed on the problem of resource discovery in ad-hoc grids, we study the existing resource and service discovery architectures, analyzing the main limitations of these systems (scalability, discovery delay, adaptation to changing conditions, etc.), and we propose a hybrid mechanism that overcomes these limitations.