A Strategy for Data Replication in Mobile Ad Hoc Networks

Michelon, Gisane Aparecida; Lima, Luiz Antônio Pugliesi Alves de; Oliveira, Jose Aelio de; Calsavara, Alcides; Andrade, Gil Eduardo de

doi:10.1109/mascots.2014.69

Cited by 6 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Michelon et al [45] proposed data replication strategy MANETs (mobile ad hoc networks) to improve data access for mobile ad hoc networks. MANETs aim to solve the problem of handling a series of application-dependent requirements through an application-level message forwarding mechanism using virtual magnetic fields.…”

Section: Related Workmentioning

confidence: 99%

The Impact of the Implementation Cost of Replication in Data Grid Job Scheduling

Nazir

Ishaq

Shamshirband

et al. 2018

MCA

View full text Add to dashboard Cite

Data Grids deal with geographically-distributed large-scale data-intensive applications. Schemes scheduled for data grids attempt to not only improve data access time, but also aim to improve the ratio of data availability to a node, where the data requests are generated. Data replication techniques manage large data by storing a number of data files efficiently. In this paper, we propose centralized dynamic scheduling strategy-replica placement strategies (CDSS-RPS). CDSS-RPS schedule the data and task so that it minimizes the implementation cost and data transfer time. CDSS-RPS consists of two algorithms, namely (a) centralized dynamic scheduling (CDS) and (b) replica placement strategy (RPS). CDS considers the computing capacity of a node and finds an appropriate location for the job. RPS attempts to improve file access time by using replication on the basis of number of accesses, storage capacity of a computing node, and response time of a requested file. Extensive simulations are carried out to demonstrate the effectiveness of the proposed strategy. Simulation results demonstrate that the replication and scheduling strategies improve the implementation cost and average access time significantly.

show abstract

Section: Related Workmentioning

confidence: 99%

The Impact of the Implementation Cost of Replication in Data Grid Job Scheduling

Nazir

Ishaq

Shamshirband

et al. 2018

MCA

View full text Add to dashboard Cite

show abstract

“…Hara [5] was among the pioneer in the area of data replication in MANETs. Hara's model uses three main techniques, namely, SAF (Static Access Frequency), DAFN (Dynamic Access Frequency and Neighborhood) and DCG (Dynamic Connectivity based on Grouping).…”

Section: Related Workmentioning

confidence: 99%

Weighted Centrality by Potential for Replica Relocation in MANETs

Michelon¹,

Lima²,

Oliveira³

et al. 2016

IJCEE

View full text Add to dashboard Cite

Abstract:Mobile Ad Hoc Networks (MANETs) are characterized by several dynamic factors (e.g., constant topology changes and limited node resources) which deeply affect data availability on the network. Therefore, a major challenge in this context is to develop autonomous adaptive application-dependent methods for data replication. This paper presents a distributed centrality algorithm based on an application-level message forward mechanism called Virtual Magnetic Fields that adjusts the center of the network graph according to dynamic factors such as data access frequency and node stability, while tackling changes in the network topology. By presenting and analyzing simulation results, this paper shows that the relocation of replicas of data based on the proposed algorithm significantly reduces the overall network traffic required to access those data.

show abstract

“…In this context, large volume data replication emerge as a subject of paramount importance when advancing data availability in long-distance network topologies. In such heterogeneous environments, data replication is required for users and applications to retrieve and process the requested data from storages residing in neighbouring nodes [6][7][8]. To this purpose, large scale systems may generate large or even huge amount of replicas in geographically distributed locations, so that users can access them.…”

Section: Introductionmentioning

confidence: 99%

A Dynamic Strategy for Large Data Replication in Heterogeneous Network Topologies

Bologa¹,

Stan²,

Pasca³

2019

Proceedings of the 18th International Conference on INFORMATICS in ECONOMY Education, Research and Business Technologies

View full text Add to dashboard Cite

In this paper, we propose an efficient method for replicating large data volumes across servers and clusters (endpoints) having geographically heterogeneous locations. The endpoints may be placed in countries with different connectivity environments while the data is as large as 5 to 10 Terabytes. Our solution relies upon a dynamic algorithm which finds the optimal paths for the data replication process from the initial node to the rest of the endpoints. In the diffusion network the edges are valued so as to maximize the utility of stable connections possessing low latency and high speed. The dynamic assessment of utilities asserts our solutions' effectiveness in topologies undergoing frequently changing connectivity conditions.

show abstract

A Strategy for Data Replication in Mobile Ad Hoc Networks

Cited by 6 publications

References 9 publications

The Impact of the Implementation Cost of Replication in Data Grid Job Scheduling

The Impact of the Implementation Cost of Replication in Data Grid Job Scheduling

Weighted Centrality by Potential for Replica Relocation in MANETs

A Dynamic Strategy for Large Data Replication in Heterogeneous Network Topologies

Contact Info

Product

Resources

About