A Lightweight Distributed Solution to Content Replication in Mobile Networks

Performance and reliability of content access in mobile networks is conditioned by the number and location of content replicas deployed at the network nodes. Facility location theory has been the traditional, centralized approach to study content replication: computing the number and placement of replicas in a network can be cast as an uncapacitated facility location problem. The endeavour of this work is to design a distributed, lightweight solution to the above joint optimization problem, while taking into account the network dynamics. In particular, we devise a mechanism that lets nodes share the burden of storing and providing content, so as to achieve load balancing, and decide whether to replicate or drop the information so as to adapt to a dynamic content demand and time-varying topology. We evaluate our mechanism through simulation, by exploring a wide range of settings and studying realistic content access mechanisms that go beyond the traditional assumptionmatching demand points to their closest content replica. Results show that our mechanism, which uses local measurements only, is: (i) extremely precise in approximating an optimal solution to content placement and replication; (ii) robust against network mobility; (iii) flexible in accommodating various content access patterns, including variation in time and space of the content demand.Comment: 12 page

An Incentive Mechanism for Cooperative Data Replication in MANETs - A Game Theoretical Approach

Wireless ad hoc networks have seen a great deal of attention in the past years, especially in cases where no infrastructure is available. The main goal in these networks is to provide good data accessibility for participants. Because of the wireless nodes’ continuous movement, network partitioning occurs very often. In order to subside the negative effects of this partitioning and improve data accessibility and reliability, data is replicated in nodes other than the original owner of data. This duplication costs in terms of nodes’ storage space and energy. Hence, autonomous nodes may behave selfishly in this cooperative process and do not replicate data. This kind of phenomenon is referred to as a strategic situation and is best modeled and analyzed using the game theory concept. In order to address this problem we propose a game theory data replication scheme by using the repeated game concept and prove that it is in the nodes’ best interest to cooperate fully in the replication process if our mechanism is used

Enhanced Distributed File Replication Protocol for Efficient File Sharing in Wireless Mobile Ad-Hoc Networks.

File sharing applications in mobile unintended networks (MANETs) have attracted additional and additional attention in recent years. The potency of file querying suffers from the distinctive properties of such networks as well as node quality and restricted communication vary and resource. associate degree intuitive methodology to alleviate this drawback is to form file replicas within the network. However, despite the efforts on file replication, no analysis has targeted on the worldwide optimum duplicate creation with minimum average querying delay. Specifically, current file replication protocols in mobile unintended networks have 2 shortcomings. First, they lack a rule to portion restricted resources to completely different files so as to reduce the typical querying delay. Second, they merely contemplate storage as offered resources for replicas, however neglect the actual fact that the file holders’ frequency of meeting different nodes additionally plays a crucial role in deciding file availableness. Actually, a node that contains a higher meeting frequency with others provides higher availableness to its files. This becomes even additional evident in sparsely distributed MANETs, during which nodes meet disruptively. during this paper, we have a tendency to introduce a replacement conception of resource for file replication, that considers each node storage and meeting frequency. we have a tendency to on paper study the influence of resource allocation on the typical querying delay and derive a resource allocation rule to reduce the typical querying delay. we have a tendency to additional propose a distributed file replication protocol to appreciate the projected rule. intensive trace-driven experiments with synthesized traces and real traces show that our protocol are able to do shorter average querying delay at a lower value than current replication protocols