Evaluating Global Optimisation for Data Grids using Replica Location Services

2006 ◽  
Author(s):  
E. Sithole ◽  
G.P. Parr ◽  
S.I. McClean ◽  
P. Dini
Keyword(s):  
Global Optimisation ◽  
Data Grids ◽  
Location Services ◽  
Replica Location

Dynamic file replica location and selection strategy in data grids

2008 ◽  
Author(s):  
Kuo-Yang Cheng ◽  
Hsiao-Hsi Wang ◽  
Chia-Hsien Wen ◽  
Yaw-Ling Lin ◽  
Kuan-Ching Li ◽  
...  
Keyword(s):  
Selection Strategy ◽  
Data Grids ◽  
Replica Location

Tree-Based Replica Location Scheme (TRLS) for Data Grids

2004 ◽  
pp. 819-822 ◽  
Author(s):  
Dong Su Nam ◽  
Eung Ki Park ◽  
Sangjin Jeong ◽  
Byungsang Kim ◽  
Chan-Hyun Youn
Keyword(s):  
Data Grids ◽  
Replica Location

Giggle: A Framework for Constructing Scalable Replica Location Services

2002 ◽  
Author(s):  
A. Chervenak ◽  
E. Deelman ◽  
I. Foster ◽  
L. Guy ◽  
W. Hoschek ◽  
...  
Keyword(s):  
Location Services ◽  
Replica Location

Localization and Non-Localization Node Identification Using Dream in MANET

2016 ◽  
Vol 2 (2) ◽  
Author(s):  
Amit Singh ◽  
Nitin Mishra ◽  
Angad Singh
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Fundamental Problem ◽  
Identification Algorithm ◽  
Mobile Nodes ◽  
Position Information ◽  
Location Services ◽  
Wireless Router ◽  
Mobile Ad Hoc

 A Wireless Mobile Ad-hoc Network consists of variety of mobile nodes that temporally kind a dynamic infrastructure less network. To modify communication between nodes that don’t have direct radio contact, every node should operate as a wireless router and potential forward knowledge traffic of behalf of the opposite node. In MANET Localization is a fundamental problem. Current localization algorithm mainly focuses on checking the localizability of a network and/or how to localize as many nodes as possible. It could provide accurate position information foe kind of expanding application. Localization provide information about coverage, deployment, routing, location, services, target tracking and rescue If high mobility among the mobile nodes occurs path failure breaks. Hence the location information cannot be predicted. Here we have proposed a localization based algorithm which will help to provide information about the localized and non-localized nodes in a network. In the proposed approach DREAM protocol and AODV protocol are used to find the localizability of a node in a network. DREAM protocol is a location protocol which helps to find the location of a node in a network whereas AODV is a routing protocol it discover route as and when necessary it does not maintain route from every node to every other. To locate the mobile nodes in a n/w an node identification algorithm is used. With the help of this algorithm localized and non-localized node can be easily detected in respect of radio range. This method helps to improve the performance of a module and minimize the location error and achieves improved performance in the form of UDP packet loss, received packet and transmitted packets, throughput, routing overhead, packet delivery fraction. All the simulation done through the NS-2 module and tested the mobile ad-hoc network.

Sign in / Sign up

Export Citation Format

Share Document