PROJECT TITLE :
Maximizing P2P File Access Availability in Mobile Ad Hoc Networks though Replication for Efficient File Sharing
ABSTRACT:
File sharing applications in mobile impromptu networks (MANETs) have attracted a lot of and a lot of attention lately. The efficiency of file querying suffers from the distinctive properties of such networks together with node mobility and limited communication range and resource. An intuitive methodology to alleviate this problem is to create file replicas in the network. However, despite the efforts on file replication, no analysis has centered on the world optimal reproduction creation with minimum average querying delay. Specifically, current file replication protocols in mobile impromptu networks have 2 shortcomings. Initial, they lack a rule to allocate restricted resources to different files so as to minimize the typical querying delay. Second, they merely contemplate storage as accessible resources for replicas, but neglect the actual fact that the file holders’ frequency of meeting alternative nodes additionally plays an necessary role in determining file availability. Really, a node that has a higher meeting frequency with others provides higher availability to its files. This becomes even additional evident in sparsely distributed MANETs, in that nodes meet disruptively. During this paper, we have a tendency to introduce a new concept of resource for file replication, that considers both node storage and meeting frequency. We tend to theoretically study the influence of resource allocation on the average querying delay and derive a resource allocation rule to minimize the average querying delay. We further propose a distributed file replication protocol to comprehend the proposed rule. Extensive trace-driven experiments with synthesized traces and real traces show that our protocol can achieve shorter average querying delay at a lower cost than current replication protocols.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here
