MAXIMIZING P2P FILE ACCESS AVAILABILITY IN MOBILE AD HOC NETWORKS THOUGH REPLICATION FOR EFFICIENT FILE SHARING

Transcription

1 MAXIMIZING P2P FILE ACCESS AVAILABILITY IN MOBILE AD HOC NETWORKS THOUGH REPLICATION FOR EFFICIENT FILE SHARING ASRAF 1*, K A LAXMI PRASAD 2* ABSTRACT: 1. MTech-Student, Dept of CSE. 2. Asst.Prof, Dept of CSE. Khader Memorial College of Engineering & Technology, Devarakonda (M), Nalgonda Dist. Applications have attracted sharing files in a dedicated mobile networks (network from hackers) more and more attention in recent years. The Querying file efficiency suffers from the characteristics of these networks, including node mobility and communication limited Groups and resources. Intuitive way to alleviate this problem is to create replicas of a file in the network. However, despite efforts to Repeat Folder, focused on any research to create a global optimization with minimum average delay query. specially, Protocols recurrence of the current files in a dedicated mobile networks and a couple of shortcomings. First, it lacks the base for the allocation of limited resources for Different files in order to reduce the average query delay. Second, it is considering simply stored as resources available to counterfeit, But the neglect of the fact that the frequency files owners in terms of the fulfillment of the other nodes also plays an important role in determining the availability of a file. In fact, a node that has a higher frequency of meeting with others to provide the highest availability of its files. This becomes even more Clear the network from hackers distributed a few, which was held to meet disruptively. In this paper, we introduce a new concept of resources to file Repetition, which is both storage node and frequency of the meeting. We theoretically study the effect of resource allocation Average query delay and derive the allocation of resources to reduce the average delay base query. We suggest further Distributed repeat to achieve the proposed rule file protocol. Wide-driven experiments with tracking the effects of synthesized and real The effects of that show our protocol can achieve a shorter average delay query at a lower cost than current protocols repeat.

2 INTRODUCTION WITH the increasing popularity of mobile devices, e.g.,smartphones and laptops, we envision the future of MANETs consisted of these mobile devices. By MANETs, we refer to both normal MANETs and disconnected MANETs, also known as delay tolerant networks (DTNs). The former has a relatively dense node distribution in an area while the latter has sparsely distributed nodes that meet each other opportunistically. On the other side, the emerging of mobile file sharing applications (e.g., Qik [1] and Flixwagon [2]) motivates the investigation on the peer-to-peer (P2P) file sharing over such MANETs. The local P2P file sharing model provides three advantages. First, it enables file sharing when no base stations are available (e.g., in rural areas). Second, with the P2P architecture, the bottleneck on overloaded servers in current client server based file sharing systems can be avoided. Third, it exploits otherwise wasted peer to peer communication opportunities among mobile nodes. As a result, nodes can freely and unobtrusively access and share files in the distributed MANET environment, which can possibly support interesting applications. For example, mobile nodes can share files based on users proximity [3] in the same building or in a local community. Tourists can share their travel In this paper, we introduce a new concept of resources for Repeat file, which is both the node and the node storage To meet capacity. We theoretically study the effect of The allocation of resources on the average query and extract delay Optimal repeat file base (OFRR) to allocate resources To each file based on its popularity and size. Then we suggest Duplication of files on the basis of the base protocol, which Approaching the minimum delay global query in full Distributed way. We have the experience and simulation results Superior performance of the proposed protocol appear in Compared with other protocols representative repeat. Is organizing the remainder of this paper is as follows. Department 2 provide relevant business. Work-Related sharing files in a network of ordinary hackers The subject of repeat applications to exchange files efficiently file In the network

3 from intruders it has been recently studied. In [10], [11],[12], a single node or group of nodes decided to list Files to repeat according to the frequency of the query for the file. Hara and Madria [10] suggested three repeat file protocols: Fixed-frequency access (SAF), and the frequency of the arrival of the dynamic Inspired (DAFN), and dynamic Gathered based connectivity (Dubai Capital Group). In the Sudanese armed forces, restores each node Often query files even available to them storage It uses up. Sudanese armed forces may lead to many of the replicas duplicate between The contract when they have the same interested neighboring files. DAFN removes duplicate replicas between neighbors. Dubai Capital Group As well as it reduces the replicas in duplicate set of the contract with the Frequent contacts by creating replicas of the files in Group descending order of their frequency query-based. Although DAFN and Dubai Capital Group replicas to be shared to enable Between neighbors, neighboring nodes may separate from the All because of some movement to the node. Also, they carry high traffic Pregnancy in identifying duplicates or management groups. Cheng and others. [11] suggested allowing each data collection knot Access from the neighbors decide to create or statistics Giving up a replica. Dong and urethral stable [12] proposed To convene a group with stable links and leave all A node checks the possibility of potential members of the group. " Order storage position to decide on the file and repeat View or not. Yin Cao suggested [9] to caching popular memory Files on the contract intersection retrieve the file paths. even though It is effective for popular files, failed to take advantage of all storage Space on the contract. Gianuzzi [21] investigate the possibility of obtaining File, which has a n replicas in the network, it is likely Network divided. He also studied the files retrieval performance When erasure coding [22] works. Chen [23] discussed How to identify a small number of mobile servers Necessary to ensure that each data element can be obtained DK within at most k? 1TH hops by any node in the system.mousavi and others. [8] proposed a two-step of a repeat of a file, Basic repeat and repeat dynamic, to spread

4 Replicas in the network evenly in order to meet the needs of users And prevent data loss in case of network division. Related Business sharing files in a network of ordinary hackers The subject of repeat applications to exchange files efficiently file In the network from intruders it has been recently studied. In [10], [11], [12], a single node or group of nodes decided to list Files to repeat according to the frequency of the query for the file. Hara and Madria [10] suggested three repeat file protocols: Fixed-frequency access (SAF), and the frequency of the arrival of the dynamic Inspired (DAFN), and dynamic Gathered based connectivity (Dubai Capital Group). In the Sudanese armed forces, restores each node Often query files even available to them storage It uses up. Sudanese armed forces may lead to many of the replicas duplicate between The contract when they have the same interested neighboring files. DAFN removes duplicate replicas between neighbors. Dubai Capital Group As well as it reduces the replicas in duplicate set of the contract with the Frequent contacts by creating replicas of the files in Group descending order of their frequency query-based. Although DAFN and Dubai Capital Group replicas to be shared to enable Between neighbors, neighboring nodes may separate from the All because of some movement to the node. Also, they carry high traffic Pregnancy in identifying duplicates or management groups. Cheng and others. [11] suggested allowing each data collection knot Access from the neighbors decide to create or statistics Giving up a replica. Dong and urethral stable [12] proposed To convene a group with stable links and leave all A node checks the possibility of potential members of the group. " Order storage position to decide on the file and repeat View or not. Yin Cao suggested [9] to caching popular memory Files on the contract intersection retrieve the file paths. even though It is effective for popular files, failed to take advantage of all storage Space on the contract. Performance evaluation in normal cases

5 Network from intruders model Thread RWP To evaluate the performance of the computers in the network from ordinary hackers, and Tests conducted on each of the Orbit GENI tests [37], [38] The simulator NS-2 [39]. GENI tests consists 400 equipped with wireless cards decade. We used Dartmouth in the real world impact of MANET [34], which states Tracking the movement of 35 laptops are moving in the open field, for The leadership of the movement node in both experiments. In order to validate Adaptability of the PCS, and we were a couple of routing protocols In experiments. We are the first to use StaticWait Protocol [40] In the experiment GENI, in each query stays on The source node waiting for the destination. We then use Probabilistic Routing Protocol (Prophet [6]), and that's Knot ways requests the neighbor highest Meeting Ability. We put TTL biggest fixed to wait because he needs More time to find the owner of the file. We were 95% confidence Break when dealing with experimental results. We evaluated the performance of the computers in the network from ordinary hackers Compared with many of the algorithms repeat MANET: Sudanese armed forces [10], Dubai Capital Group [10], PDRS [12] and CACHE [9]. TheDetails of these protocols can be found in Section 2. Best Validate our analysis, we also PCS compared with random, Which puts the replicas of the contract randomly, and OPTM, It is a centralized protocol calculates the ideal A number of replicas of each file on the basis we derive the optimum Replication rule. OPTM represents the best performance Which can be obtained by OFRR. Also we had Simulation The NS-2 with different sizes of the network and node Transfers collected by the modified RWP to evaluate the model Our protocol according to various scenarios. Due to page Limit, showed the results of these tests in Appendix A, Is available in the supplementary material on the Internet... Conclusion In this paper, we investigate the problem of how to allocate Limited resources to replicate the file for the purpose ofglobal optimal file searching efficiency in the network from intruders. Different Previous protocols that consider only store as

6 resources, We also consider the ability of the owner of the file to meet the contract as available Resources since it also affects the availability of files on node. First, we analyzed the impact theory Asymmetric distribution of the average query delay under Available resources with restricted mobility models, And then derive the optimum base repetition that can be customized Resources to file replicas with the minimum of the average query delay. Finally, we designed and competition priority Repeat division protocol (PCS) to realize the optimum repeat Rule in a manner fully distributed. Extensive testing All GENI pilot phase, NS-2, and event-driven Simulation with the real effects and synthesized mobility confirmation Each of the health of our theoretical analysis and effectiveness Of the computers in the network from intruders. In this study, we focus on A fixed set of files in the network. In our future work, we will In theory, the analysis is more complex environment including The dynamics of the file (add a file deletions, file) deadline The knot dynamic query pattern. References [1] Qik, [2] Flixwagon, ttp:// [3] C. Palazzi and A. Bujari, A Delay/Disruption Tolerant Solution for Mobile to Mobile File Sharing, Proc. IFIP/IEEE Wireless Days, [4] Y. Tseng, S. Ni, and E. Shih, Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Network, Proc. 21st Int l Conf. Distributed Computing Systems (ICDCS), pp , [5] B. Chiara et al., HiBOp: A History Based Routing Protocol for Opportunistic Networks, Proc. IEEE Int l Symp. World of Wireless, Mobile and Multimedia Networks (WoWMoM), [6] A. Lindgren, A. Doria, and O. Schelen, Probabilistic Routing in Intermittently Connected Networks, ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 7, no. 3, pp , 2003.

7 [7] F. Li and J. Wu, MOPS: Providing Content-Based Service in Disruption- Tolerant Networks, Proc. IEEE 29th Int l Conf. Distributed Computing Systems (ICDCS), [8] S. Moussaoui, M. Guerroumi, and N. Badache, Data Replication in Mobile Ad Hoc Networks, Proc. Second Int l Conf. Mobile Ad-hoc and Sensor Networks (MSN), pp , [9] L. Yin and G. Cao, Supporting Cooperative Caching in Ad Hoc Networks, IEEE Trans. Mobile Computing, vol. 5, no. 1, pp , Jan [10] T. Hara and S.K. Madria, Data Replication for Improving Data Accessibility in Ad Hoc Networks, IEEE Trans. Mobile Computing, vol. 5, no. 11, pp , Nov [11] J. Zheng, J. Su, K. Yang, and Y. Wang, Stable Neighbor Based Adaptive Replica Allocation in Mobile Ad Hoc Networks, Proc. Int l Conf. Computational Science (ICCS), [12] H. Duong and I. Demeure, Proactive Data Replication Semantic Information within Mobility Groups in MANET, Proc. Second Int l Conf. MobileWireless Middleware, Operating Systems, and Applications (Mobilware), [13] Y. Huang et al., Optimizing File Retrieval in Delay-Tolerant Content Distribution Community, Proc. Int l Conf. Distributed Computing Systems (ICDCS), [14] W. Gao, G. Cao, A. Iyengar, and M. Srivatsa, Supporting Cooperative Caching in Disruption Tolerant Networks, Proc. Int l Conf. Distributed Computing Systems (ICDCS), [15] J. Reich and A. Chaintreau, The Age of Impatience: Optimal Replication Schemes for Opportunistic Networks, Proc. Fifth Int l Conf. Emerging Networking Experiments and Technologies (CoNEXT), [16] S. Ioannidis, L. Massoulie, and A. Chaintreau, Distributed Caching

8 over Heterogeneous Mobile Networks, Proc. ACM Int l Conf. Measurement and Modeling of Computer Systems (SIGMETRICS), [17] M.J. Pitkanen and J. Ott, Redundancy and Distributed Caching in Mobile DTNs, Proc. ACM/IEEE Int l Workshop Mobility in the Evolving Internet Architecture (MobiArch), [18] X. Zhuo, Q. Li, W. Gao, G. Cao, and Y. Dai, Contact Duration Aware Data Replication in Delay Tolerant Networks, Proc. IEEE 19th Int l Conf. Network Protocols (ICNP), [19] X. Zhuo, Q. Li, G. Cao, Y. Dai, B.K. Szymanski, and T.L. Porta, Social-Based Cooperative Caching in DTNs: A Contact Duration Aware Approach, Proc. IEEE Eighth Int l Conf. Mobile Adhoc and Sensor Systems (MASS), [20] Z. Li and H. Shen, SEDUM: Exploiting Social Networks in Utility-Based Distributed Routing for DTNs, IEEE Trans. Computers, vol. 62, no. 1, pp , Jan [21] V. Gianuzzi, Data Replication Effectiveness in Mobile Ad-Hoc Networks, Proc. ACM First Int l Workshop Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks (PE-WASUN), pp , [22] S. Chessa and P. Maestrini, Dependable and Secure Data Storage and Retrieval in Mobile Wireless Networks, Proc. Int l Conf. Dependable Systems and Networks (DSN), [23] X. Chen, Data Replication Approaches for Ad Hoc Wireless Networks Satisfying Time Constraints, Int l J. Parallel, Emergent and Distributed Systems, vol. 22, no. 3, pp , 2007.