Adaptive Knowledge Retrieving on Mobile Grid

Author(s):  
Yue-Shan Chang ◽  
Pei-Chun Shih ◽  
Yu-Cheng Luo
Keyword(s):  
2010 ◽  
Vol 5 (4) ◽  
pp. 7-14
Author(s):  
L. Anita Elizabeth ◽  
V.M. Sivagami
Keyword(s):  

2017 ◽  
Vol 10 (28) ◽  
pp. 1-13
Author(s):  
Imran Rafique ◽  
Hina Gul ◽  
Salman Rafique ◽  
Syed Asad Raza Kazmi ◽  
Awais Qasim ◽  
...  

1993 ◽  
Vol 115 (4) ◽  
pp. 781-790 ◽  
Author(s):  
G. A. Gerolymos

In the present work an algorithm for the numerical integration of the three-dimensional unsteady Euler equations in vibrating transonic compressor cascades is described. The equations are discretized in finite-volume formulation in a mobile grid using isoparametric brick elements. They are integrated in time using Runge-Kutta schemes. A thorough discussion of the boundary conditions used and of their influence on results is undertaken. The influence of grid refinement on computational results is examined. Unsteady convergence of results is discussed.


Author(s):  
Achal Kaushik ◽  
Deo P. Vidyarthi

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.


Author(s):  
Grantej Vinod Otari ◽  
Vijay Ram Ghorpade

Mobile Grid network connects large number of mobile devices like smartphones, tablets, PDAs, wireless digital medical equipment’s etc for the purpose of sharing their resources and performing the task collaboratively and cooperatively. The mobile nodes participating in the mobile grid are autonomous and open in nature making them more vulnerable to data and control attacks made by malicious or selfish nodes. Preventing these malicious or selfish nodes and identifying the trusted nodes to participate in the network is an NP-hard problem. To recognize trusted nodes in the mobile grid system a novel trust management model is proposed in this paper by applying an elitist multi objective optimization algorithm Non-dominated Sorting Genetic Algorithm-II (NSGA-II). The proposed trust management model assesses the trust index of each mobile node in the network using various evaluation factors or attributes and then obtains the non-dominated set of trusted nodes in each front. Comparative analysis of the proposed trust model shows that the proposed model can be a potential candidate for implementing trust management in mobile grid network.


Sign in / Sign up

Export Citation Format

Share Document