Data Replication for Improving Data Accessibility in Ad Hoc Networks

Hara, Takahiro; Madria, Sanjay

doi:10.1109/tmc.2006.165

Cited by 168 publications

(141 citation statements)

References 25 publications

Supporting

Mentioning

138

Contrasting

Unclassified

Order By: Relevance

“…Figures 7,8,9,10,11,and 12 show the performance comparison of the protocols for a sensornet with 100 nodes, while Figs. 13,14,15,16,17, and 18 for a sensornet with 500 nodes. The Figs.…”

Section: Discussionmentioning

confidence: 99%

“…A number of data replication schemes [12,13] and caching schemes [5,14] have been proposed in order to facilitate data access in mobile ad hoc networks (MANETs). Hara [12,13] proposed a number of replica allocation techniques to increase data accessibility in MANETs. According to overall network topology and access frequency, the replicated data items are relocated periodically.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

High performance, low complexity cooperative caching for wireless sensor networks

2010

View full text Add to dashboard Cite

During the last decade, Wireless Sensor Networks have emerged and matured at such point that they currently support several applications such as environment control, intelligent buildings, target tracking in battlefields. The vast majority of these applications require an optimization to the communication among the sensors so as to serve data in short latency and with minimal energy consumption. Cooperative data caching has been proposed as an effective and efficient technique to achieve these goals concurrently. The essence of these protocols is the selection of the sensor nodes which will take special roles in running the caching and request forwarding decisions. This article introduces two new metrics to aid in the selection of such nodes. Based on these metrics, we propose two new cooperative caching protocols, PCICC and scaPCICC, which are compared against the state-of-the-art competing protocol, namely NICoCa. The proposed solutions are evaluated extensively in an advanced simulation environment and the results confirm that the proposed caching mechanisms prevail over its competitor. The evaluation attests also that the best policy is always scaPCICC, achieving the shortest latency and the least number of transmitted messages.

show abstract

“…Figures 7,8,9,10,11,and 12 show the performance comparison of the protocols for a sensornet with 100 nodes, while Figs. 13,14,15,16,17, and 18 for a sensornet with 500 nodes. The Figs.…”

Section: Discussionmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

High performance, low complexity cooperative caching for wireless sensor networks

2010

View full text Add to dashboard Cite

show abstract

“…Some methods also exist that integrate both tasks [9,11,17,19,25,27,29]. Replication, however, is typically done as a separate task [5,8,15,21,22,32], although some methods, like ours, take an integral view of fragmentation, allocation and replication [11,27,29]. Dynamic replication algorithms [5,15,21,22,32] can optimize for different measures, but we believe that refragmentation and reallocation must be considered as alternatives to replication.…”

Section: Related Workmentioning

confidence: 99%

“…The method can either be centralized, which means that a central site gathers information and decides on the fragmentation, allocation or replication, or it can be decentralized, delegating the decisions to each site. Some methods use a weak form of decentralization where sites are organized in groups, and each group chooses a coordinator site that is charged with making decisions for the whole group [15,21].…”

Section: Related Workmentioning

confidence: 99%

DYFRAM: dynamic fragmentation and replica management in distributed database systems

Hauglid

Ryeng

Nørvåg

2010

Distrib Parallel Databases

View full text Add to dashboard Cite

In distributed database systems, tables are frequently fragmented and replicated over a number of sites in order to reduce network communication costs. How to fragment, when to replicate and how to allocate the fragments to the sites are challenging problems that has previously been solved either by static fragmentation, replication and allocation, or based on a priori query analysis. Many emerging applications of distributed database systems generate very dynamic workloads with frequent changes in access patterns from different sites. In such contexts, continuous refragmentation and reallocation can significantly improve performance. In this paper we present DYFRAM, a decentralized approach for dynamic table fragmentation and allocation in distributed database systems based on observation of the access patterns of sites to tables. The approach performs fragmentation, replication, and reallocation based on recent access history, aiming at maximizing the number of local accesses compared to accesses from remote sites. We show through simulations and experiments on the DASCOSA distributed database system that the approach significantly reduces communication costs for typical access patterns, thus demonstrating the feasibility of our approach.

show abstract

“…To mitigate this problem, data replication can be used. By replicating data into a number of nodes in different squads, a data request can be served by the closest node that has the data replica [6]. Then, even if there is a network partition between the requesting node and the original data source, the data request can still be served as long as it can reach a node with a data replica.…”

Section: Introductionmentioning

confidence: 99%

Data replication in mobile tactical networks

Zhang

Ray

Porta

et al. 2011

2011 - MILCOM 2011 Military Communications Conference

View full text Add to dashboard Cite

Abstract-In tactical networks, nodes move according to tactical maneuvers and network partitions occur frequently. To mitigate this problem, data replication is commonly used to increase data availability and reduce data access delay. However, different tactical maneuvers lead to different node mobility models, which affect the performance of data replication schemes. In this paper, we comprehensively study the data replication problem in mobile tactical networks. We propose a new intra-group data replication scheme and extensively quantify the effects of mobility on different inter-group data replication schemes from various perspectives. The study is based on several metrics, which include the average access delay and data availability, and the temporal and spatial analysis of these values. Through extensive experiments, we study the effects of three typical mobility models in tactical networks on data replication, and identify the most suitable data replication schemes under various mobility models.

show abstract

Data Replication for Improving Data Accessibility in Ad Hoc Networks

Cited by 168 publications

References 25 publications

High performance, low complexity cooperative caching for wireless sensor networks

High performance, low complexity cooperative caching for wireless sensor networks

DYFRAM: dynamic fragmentation and replica management in distributed database systems

Data replication in mobile tactical networks

Contact Info

Product

Resources

About