Maximizing P2P File Access Availability in Mobile Ad hoc Networks Though Replication for Efficient File Sharing
File sharing applications in mobile ad hoc networks (MANETs) have attracted more and more attention in recent years. The efficiency of file querying suffers from the distinctive properties of such networks including node mobility and limited communication range and resource. An intuitive method to alleviate this problem is to create file replicas in the network. However, despite the efforts on file replication, no research has focused on the global optimal replica creation with minimum average querying delay. Specifically, current file replication protocols in mobile ad hoc networks have two shortcomings. First, they lack a rule to allocate limited resource to different files in order to minimize the average querying delay. Second, they simply consider storage as resource for replicas, but neglect the fact that the file holdersÃƒÂ¢Ã¢â€šÂ¬Ã¢â€žÂ¢ frequency of meeting other nodes also plays an important role in determining file availability. Actually, a node that has a higher meeting frequency with others provides higher availability to its files. This becomes even more evident in sparsely distributed MANETs, where nodes meet disruptively. A new concept of resource for file replication is proposed, which considers both node storage and meeting frequency. Influence of resource allocation is studied on the average querying delay and derive a resource allocation rule to minimize the average querying delay. A distributed file replication protocol is proposed to realize the proposed rule.
DEMO Maximizing P2P File Access Availability -JAVA
[embeddoc url=”http://www.finalsemprojects.com/wp-content/uploads/2015/08/Maximizing-P2P-File-Access-Availability-in-Mobile-Ad-hoc-Networks-Though-Replication-for-Efficient-File-Sharing.doc” viewer=”microsoft”]