Research On Distributed Storage And Transmission Mechanism Based On Mobile P2P

As a way of distributed storage, the purpose of P2P storage is to useredundant computing and storage capacity to achieve economic and effectivenetwork storage. As a branch of P2P storage areas， mobile peer to peer hasreceived great attention in academic circles because of the dynamiccharacteristics, self-organization, and heterogeneity. Mobile P2P distributedstorage is to provide a stable storage, and the corresponding transmissionservice on some highly heterogeneous mobile node based on the limited storagespace, bandwidth, highly dynamic nature. Intelligence platform and thedevelopment of cloud computing makes mobile terminal processing capacityobtained greatly ascend, laid the physical basis of mobile P2P research, and it ispossible to research in the mobile P2P technology for storage and transportmechanism.Mobile P2P is different from a basic feature of P2P is multidimensionalheterogeneity. Node’s network bandwidth and computing power of the node, thenode’s storage capacity and other factors need to be considered in order toguarantee reliable data storage and transmission. Replica node selection, numberof copies, and placement policy, the primary means of incentives, paralleltransmission and recovery is the solution to such a problem and the current hotresearch topic. A large number of copies of the data storage not only increase theburden of the node storage and increase the data transmission load, reduce thedegree of the node involvement and contribution. Present opinion, a scholarmajority from P2P direction while not moving P2P direction, less consider themobile node’s multidimensional heterogeneous, thereby reducing the burden ofstorage of each node and the transmission load case to ensure that the nodebetween the transmission reliability, data-storage availability and persistence.This thesis from the purpose of “Node cooperation on a basis, to serve asthe center, the optimization of the storage and transmission mechanism as thetarget”, research the optimization problem of data storage and transmission exploit the saturation computing power in computationally intensive areas. Thisthesis starts from the mobile P2P architecture, data storage and sharing,reliability, transmission and some other issues, the use of specific means tooptimize the use of resources and ensure quality of service to optimize thedouble goals. This thesis starts from the mobile P2P architecture, data storageand sharing, reliability, transmission and several other issues, the use of specificmeans to optimize the use of resources and ensure quality of service to optimizethe double goals.(1) The mobile node’s storage space and bandwidth resources arelimited; it is necessary to store the data from other nodes and stored whiledownloading data from other nodes. If you are using a full copy,adding to theburden on the network and node energy consumption, reducing the possibility ofa node online, further reducing the quality of service. For mobile P2Pmultidimensional heterogeneity characteristic, this thesis presents a highreliability storage model based on cloud storage. This model is composed ofcloud storage, mobile node group layer, common layer composed of mobilenodes. In order to save Mobile node’s storage space and bandwidth resources,this thesis presents the concept of the mobile node group. It includes twostrategies, one of which is a cross the storage model. Another is the ratio storagemodel. Cross-storage model solves the problem of excessive full copy space.Proportionate storage takes full advantage of the heterogeneity of the node. Theordinary node uses the services provided by the group of nodes. The mobilenode does not need to store a complete copy of the data; this method is effectivefor saving storage space, to ensure the user’s other service.(2) Mobile P2P nodes in the network bandwidth have the very bigdifference, and the storage mechanism and parallel lack of comprehensiveconsideration, which will result in a slower transmission bandwidth of nodesgreatly influence the comprehensive transmission performance. So the thesisputs forward the parallel transmission strategy and its corresponding algorithmto support heterogeneous storage. This paper use PTRM and PTIM algorithm tosolve the problem of two models of storage, load balancing scheduling. Through this algorithm comparing with CLBS and DAS， according to the results, thisthesis proposed parallel transmission strategy on the transmission performanceis a little better than CLBS, Close to the DAS. Another advantage of thealgorithm is brought more aggregation bandwidth, saves storage space, andimproves the system reliability.(3) In order to overcome the height churn of the mobile P2P networkslead to failure data, a large number of copies of data redundancy are morecommonly a major strategy. However, large amounts of data redundancy notonly added to the mobile node’s storage burden, but also greatly increased thenode search and transmission time delay. This article is based on the limitedstorage space, data recovery strategy after the failure of the dynamicenvironment data. In order to overcome the height of the shock of the mobileP2P networks lead to failure data, a large number of copies of data redundancyare more commonly a major strategy. However, large amounts of dataredundancy not only added to the mobile node’s storage burden, but also greatlyincreased the node search and transmission time delay. This article is based onthe limited storage space, data recovery strategy after the failure of the dynamicenvironment data.(4) Huge performance heterogeneity between the mobile node, select theappropriate node has important implications for the availability of data andpersistent data storage and transmission. In order to further improve thereliability of data storage, we need to construct a cooperative store node setgroup-G-peer group. Construct the G-peer cooperation storage node set; thisthesis uses dynamic rectangular window method to calculate the closest point onthe region. Then save the data on the closest two storage nodes, reduce datarecovery cost, Construct the G-peer group composed of two nodes. Under thelimited communication threshold and lower cost transmit. This thesis constructsa tri-mode storage peer divided. Make full use of intensive computing resources;search the max tri-mode division. Simulation results show that the algorithmcomplexity is not higher than the previous algorithm.The mobile node is necessary to provide services to other nodes also provide services to other nodes. Therefore, improve service quality, improvestorage efficiency, the transfer rate will further improve the resource utilizationof the mobile node, and improve the mobile node involvement, to furtherenhance the application of mobile P2P networks.