A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Vasanth, G.
- Performance of Mobile Grid on Mobility
Authors
1 Department of Computer Science and Engineering, Hindustan University, Chennai, Tamil nadu, IN
2 Department of Electronics and Communication, Government College of Engineering, KR pet, Karnataka, IN
3 Department of Computer Science and Engineering, Government College of Engineering, KR pet, Karnataka, IN
4 LG Technology, Bangalore, Karnataka, IN
5 Department of Computer Science and Engineering, Acharya Institute of Technology, Bangalore, Karnataka, IN
Source
Networking and Communication Engineering, Vol 3, No 12 (2011), Pagination: 760-765Abstract
The complexity of cellular radio networks yields new demands concerning network security. Particularly the task of detecting, repulsing and preventing abuse both by in- and outsiders becomes more and more difficult. Wireless mobile grids are one of the emerging grid types, which help to pool the resources of several willing and cooperative mobile devices to resolve a computationally intensive task. The mobile grids exhibit stronger challenges like mobility management of devices, providing transparent access to grid resources, task management and handling of limited resources so that resources are shared efficiently. The execution of the task on these devices should not be affected by their mobility.
The proposed work presents performance evaluation of wireless mobile grid using normal walk mobility model. The normal walk model represents daily motion of users and the direction of motion is mostly symmetric in a real life environment; thus it is effective in location updating of a mobile station and in turn helps task distribution among these available mobile stations. Some of the performance parameters such as Task Execution Time, task failure rate, communication overhead on Brokering Server and Monitoring Cost are discussed.
Keywords
Mobile Grids, Normal Walk Mobility Model, Mobility Management, Collaborative Problem Solving, Task Management.- Secure Data Storage in Distributed Database Systems
Authors
1 Department of Computer Science and Engineering, Hindustan University, Chennai, Tamilnadu, IN
2 Department of Computer Science and Engineering, Government College of Engineering, KR pet, Karnataka, IN
3 Department of Electronics and Communication Engineering, BTL Institute of Technology, Bangalore, Karnataka, IN
4 Department Of computer science & Engineering, BTL Polytechnic, Bangalore, Karnataka, IN
Source
Automation and Autonomous Systems, Vol 3, No 2 (2011), Pagination: 66-71Abstract
The number of Internet connected PCs is projected to reach 1 billion by 2015, which means several PetaFLOPS of computing power and a storage capacity around one Exabyte able to exceed the one provided by any centralized system. But at the same time the amount of memory needs for the Organization is also increasing day by day for its various needs. Tapping this unused PC memory to organization storage is called Data Grid. Data Grid depends on a set of widely distributed and un-trusted storage nodes in Grid environment. Securing the Grid environment presents the distinctive set of challenges. These security challenges must be carefully managed before fully deploying Data Grids in sensitive distributed environments. In this paper we propose a cryptographic protocol able to fulfill the storage security requirements related with Data Grid. The proposed protocol uses three basic mechanisms to accomplish its goal: (a) symmetric cryptography and hashing, (b) selection of cryptography algorithm (c) an Information Dispersal Algorithm and (d) ―Quality of Security‖ (QoSec) quantitative metric.Keywords
Volunteer Computing, Data Grid, Cryptography, Hashing, Information Dispersal Algorithm, PetaFLOPS, Exabyte.- MTM-Multihomed Transition Mechanism Feature for Small and Medium Enterprise Network
Authors
1 Jyothy Institute of Technology, Visvesvaraya Technological University, Belgaum, IN
2 Government Engineering College, Visvesvaraya Technological University, Belgaum, IN