Broadcasting is a basic technique in Mobile ad-hoc network(MANET),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received pa...Broadcasting is a basic technique in Mobile ad-hoc network(MANET),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive flooding technique,floods the network with query messages,while the random walk technique operates by contacting the subsets of every node’s neighbors at each step,thereby restricting the search space.One of the key challenges in an ad-hoc network is the resource or content discovery problem which is about locating the queried resource.Many earlier works have mainly focused on the simulation-based analysis of flooding,and its variants under a wired network.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of P2P systems running over MANET.In this paper,we describe how P2P resource discovery protocols perform badly over MANETs.To address the limitations,we propose a new protocol named ABRW(Address Broadcast Random Walk),which is a lightweight search approach,designed considering the underlay topology aimed to better suit the unstructured architecture.We provide the mathematical model,measuring the performance of our proposed search scheme with different widely popular benchmarked search techniques.Further,we also derive three relevant search performance metrics,i.e.,mean no.of steps needed to find a resource,the probability of finding a resource,and the mean no.of message overhead.We validated the analytical expressions through simulations.The simulation results closely matched with our analyticalmodel,justifying our findings.Our proposed search algorithm under such highly dynamic self-evolving networks performed better,as it reduced the search latency,decreased the overall message overhead,and still equally had a good success rate.展开更多
It is necessary to construct an effective trust model to build trust relationship between peers in peer-to-peer (P2P) network and enhance the security and reliability of P2P systems. The current trust models only fo...It is necessary to construct an effective trust model to build trust relationship between peers in peer-to-peer (P2P) network and enhance the security and reliability of P2P systems. The current trust models only focus on the consumers' evaluation to a transaction, which may be abused by malicious peers to exaggerate or slander the provider deliberately. In this paper, we propose a novel trust model based on mutual evaluation, called METrust, to suppress the peers' malicious behavior, such as dishonest evaluation and strategic attack. METrust considers the factors including mutual evaluation, similarity risk, time window, incentive, and punishment mechanism. The trust value is composed of the direct trust value and the recommendation trust value. In order to inhibit dishonest evaluation, both participants should give evaluation information based on peers' own experiences about the transaction while computing the direct trust value. In view of this, the mutual evaluation consistency factor and its time decay function are proposed. Besides, to reduce the risk of computing the recommendation trust based on the recommendations of friend peers, the similarity risk is introduced to measure the uncertainty of the similarity computing, while similarity is used to measure credibility. The experimental results show that METrust is effective, and it has advantages in the inhibition of the various malicious behaviors.展开更多
For the problem of large network load generated by the Gnutella resource-searching model in Peer to Peer (P2P) network, a improved model to decrease the network expense is proposed, which establishes a duster in P2P...For the problem of large network load generated by the Gnutella resource-searching model in Peer to Peer (P2P) network, a improved model to decrease the network expense is proposed, which establishes a duster in P2P network, auto-organizes logical layers, and applies a hybrid mechanism of directional searching and flooding. The performance analysis and simulation results show that the proposed hierarchical searching model has availably reduced the generated message load and that its searching-response time performance is as fairly good as that of the Gnutella model.展开更多
Background:Online peer-to-peer lending(P2P lending)is booming as the popularity of e-finance.To develop a conceptual model for the P2P lending process is great valuable for managers to tack the issues of marketing,man...Background:Online peer-to-peer lending(P2P lending)is booming as the popularity of e-finance.To develop a conceptual model for the P2P lending process is great valuable for managers to tack the issues of marketing,management and operation.Methods:In this paper,we focus on the P2P lending process model and provide a comparative analysis comparing with traditional bank loan process.Results:Firstly,our model shows that the information flow in P2P lending is more frequent and transparent.Secondly,the model reveals that P2P lending uses a quite different credit audition method,which relies on information and the decision model in the P2P systems.Thirdly,the loan management is not complete normally in P2P lending,because most P2P companies do not have the post-loan records of borrowers.Conclusions:These findings inspire future studies and practices on P2P lending process and key technologies.展开更多
With the rapid growth of information and communication technology (ICT), the violation of information privacy has increased in recent years. The privacy concerns now re-emerge right because people perceives a threat...With the rapid growth of information and communication technology (ICT), the violation of information privacy has increased in recent years. The privacy concerns now re-emerge right because people perceives a threat from new ICT that are equipped with enhanced capabilities for surveillance, storage, retrieval, and diffusion of personal information. With the trend in the prevalence and the easy use of ICT, it is of necessary to pay much attention to the issue how the ICT can threaten the privacy of individuals on the Internet. While the Email and P2P (Peer-to-Peer) tools are the most popular ICT, this paper aims at understanding their respectively dissemination patterns in spreading of personal private information. To this purpose, this paper using dynamic model technique to simulate the pattern of sensitive or personal private information propagating situation. In this study, an Email propagation model and a Susceptible-lnfected-Removed (SIR) model are proposed to simulate the propagation patterns of Email and P2P network respectively. Knowing their dissemination patterns would be helpful for system designers, ICT manager, corporate IT personnel, educators, policy makers, and legislators to incorporate consciousness of social and ethical information issues into the protection of information privacy.展开更多
The peer-to-peer(P2P) file-sharing network as a vehicle of disseminating files has become very popular. The appearance of dozens of kinds of passive worms on this network has, however, made it unsecured. This proble...The peer-to-peer(P2P) file-sharing network as a vehicle of disseminating files has become very popular. The appearance of dozens of kinds of passive worms on this network has, however, made it unsecured. This problem has been paid attention and a few of models for passive worm propagation has been presented. Unfortunately, the dynamic properties of this network are ignored in these models. Given the fact, the characteristics of both this network and the passive worm are identified, and on this basis a new mathematical model of passive worm propagation on the P2P network is presented in applying epidemiology in this paper. Note that the dynamic properties of this network are considered in the presented model. The model has been validated by large scale simulation experiments, which demonstrates that the presented model may be used for analyzing the behaviors of passive worms and predicting the trend of their propagation.展开更多
This paper analyzes the characteristics of the Peer-to-Peer (P2P) active worm and its attacking mechanism, and then proposes a mathematical model of propagation of the P2P active worm applying Epidemiology. Based on...This paper analyzes the characteristics of the Peer-to-Peer (P2P) active worm and its attacking mechanism, and then proposes a mathematical model of propagation of the P2P active worm applying Epidemiology. Based on the analysis on the protocols of realistic P2P systems, a software which can be used to simulate the P2P network environment and the propagation of P2P active worm is imple- mented in this paper. A large number of simulation experiments are performed using the developed simulation software. The results from these simulation experiments validate the proposed model, which means that the model can be used to analyze the spreading behaviors of the P2P active worm and predict its trend.展开更多
IIn order to improve the performance of wireless distributed peer-to-peer(P2P)files sharing systems,a general system architecture and a novel peer selecting model based on fuzzy cognitive maps(FCM)are proposed in this...IIn order to improve the performance of wireless distributed peer-to-peer(P2P)files sharing systems,a general system architecture and a novel peer selecting model based on fuzzy cognitive maps(FCM)are proposed in this paper.The new model provides an effective approach on choosing an optimal peer from several resource discovering results for the best file transfer.Compared with the traditional min-hops scheme that uses hops as the only selecting criterion,the proposed model uses FCM to investigate the complex relationships among various relative factors in wireless environments and gives an overall evaluation score on the candidate.It also has strong scalability for being independent of specified P2P resource discovering protocols.Furthermore,a complete implementation is explained in concrete modules.The simulation results show that the proposed model is effective and feasible compared with min-hops scheme,with the success transfer rate increased by at least 20% and transfer time improved as high as 34%.展开更多
Resource location is the most important issue for Peer-to-Peer (P2P) system and flooding is the fundamental mechanism for unstructured P2P systems. Redundant messages will exponential growth with flooding scope increa...Resource location is the most important issue for Peer-to-Peer (P2P) system and flooding is the fundamental mechanism for unstructured P2P systems. Redundant messages will exponential growth with flooding scope increasing which severely influences the scalability of the system. In this paper, a new P2P model based on isolated broadcast domains is given to reduce the amount of redundant messages by limiting the radius of messages transmitted. Analysis and experiments show that this model can guarantee coverage of nodes and significantly reduce the amount of redundant messages generated.展开更多
目的研究异补骨脂素对人皮肤角质形成细胞(Ha Ca T)光老化模型p-ERK1/2表达的影响及对光老化细胞分泌的白介素1α(IL-1α)、肿瘤坏死因子-α(TNF-α)等炎症因子的影响。方法使用照射强度为0.61m W·cm^(-2),照射时间为5min的UVB,建...目的研究异补骨脂素对人皮肤角质形成细胞(Ha Ca T)光老化模型p-ERK1/2表达的影响及对光老化细胞分泌的白介素1α(IL-1α)、肿瘤坏死因子-α(TNF-α)等炎症因子的影响。方法使用照射强度为0.61m W·cm^(-2),照射时间为5min的UVB,建立光老化模型;雌二醇(阳性对照)及异补骨脂素(10^(-7),10^(-6),10-5 mol·L^(-1))处理光老化模型。MTT法检测细胞的活性;GSH、LDH及MDA试剂盒检测雌二醇及不同浓度异补骨脂素对细胞氧化酶活性的影响;Western Blot法检测雌二醇及不同浓度的异补骨脂素对细胞p-ERK1/2、IL-1α及TNF-α蛋白表达量的影响。结果与空白组比较,模型组GSH活性降低,LDH活性升高,MDA含量升高,p-ERK1/2、IL-1α及TNF-α蛋白表达量升高(P<0.01,P<0.05);与模型组比较,雌二醇及不同浓度异补骨脂素可以显著的升高GSH的活性,降低LDH活性,降低MDA含量,降低p-ERK1/2、IL-1α及TNF-α蛋白表达量(P<0.01,P<0.05)。结论异补骨脂素可通过抑制ERK磷酸化,抑制炎症因子的分泌。展开更多
文摘Broadcasting is a basic technique in Mobile ad-hoc network(MANET),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive flooding technique,floods the network with query messages,while the random walk technique operates by contacting the subsets of every node’s neighbors at each step,thereby restricting the search space.One of the key challenges in an ad-hoc network is the resource or content discovery problem which is about locating the queried resource.Many earlier works have mainly focused on the simulation-based analysis of flooding,and its variants under a wired network.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of P2P systems running over MANET.In this paper,we describe how P2P resource discovery protocols perform badly over MANETs.To address the limitations,we propose a new protocol named ABRW(Address Broadcast Random Walk),which is a lightweight search approach,designed considering the underlay topology aimed to better suit the unstructured architecture.We provide the mathematical model,measuring the performance of our proposed search scheme with different widely popular benchmarked search techniques.Further,we also derive three relevant search performance metrics,i.e.,mean no.of steps needed to find a resource,the probability of finding a resource,and the mean no.of message overhead.We validated the analytical expressions through simulations.The simulation results closely matched with our analyticalmodel,justifying our findings.Our proposed search algorithm under such highly dynamic self-evolving networks performed better,as it reduced the search latency,decreased the overall message overhead,and still equally had a good success rate.
基金supported by National Natural Science Foundation of China (No.60873231)Research Fund for the Doctoral Program of Higher Education (No.20093223120001)+2 种基金Science and Technology Support Program of Jiangsu Province (No.BE2009158)Natural Science Fund of Higher Education of Jiangsu Province(No.09KJB520010)Special Fund for Fast Sharing of Science Paper in Net Era by CSTD (No.2009117)
文摘It is necessary to construct an effective trust model to build trust relationship between peers in peer-to-peer (P2P) network and enhance the security and reliability of P2P systems. The current trust models only focus on the consumers' evaluation to a transaction, which may be abused by malicious peers to exaggerate or slander the provider deliberately. In this paper, we propose a novel trust model based on mutual evaluation, called METrust, to suppress the peers' malicious behavior, such as dishonest evaluation and strategic attack. METrust considers the factors including mutual evaluation, similarity risk, time window, incentive, and punishment mechanism. The trust value is composed of the direct trust value and the recommendation trust value. In order to inhibit dishonest evaluation, both participants should give evaluation information based on peers' own experiences about the transaction while computing the direct trust value. In view of this, the mutual evaluation consistency factor and its time decay function are proposed. Besides, to reduce the risk of computing the recommendation trust based on the recommendations of friend peers, the similarity risk is introduced to measure the uncertainty of the similarity computing, while similarity is used to measure credibility. The experimental results show that METrust is effective, and it has advantages in the inhibition of the various malicious behaviors.
文摘For the problem of large network load generated by the Gnutella resource-searching model in Peer to Peer (P2P) network, a improved model to decrease the network expense is proposed, which establishes a duster in P2P network, auto-organizes logical layers, and applies a hybrid mechanism of directional searching and flooding. The performance analysis and simulation results show that the proposed hierarchical searching model has availably reduced the generated message load and that its searching-response time performance is as fairly good as that of the Gnutella model.
基金supported by a grant from the Shenzhen Municipal Science and Technology R&D Funding—Basic Research Program(Project No.JCYJ20140417105742712).
文摘Background:Online peer-to-peer lending(P2P lending)is booming as the popularity of e-finance.To develop a conceptual model for the P2P lending process is great valuable for managers to tack the issues of marketing,management and operation.Methods:In this paper,we focus on the P2P lending process model and provide a comparative analysis comparing with traditional bank loan process.Results:Firstly,our model shows that the information flow in P2P lending is more frequent and transparent.Secondly,the model reveals that P2P lending uses a quite different credit audition method,which relies on information and the decision model in the P2P systems.Thirdly,the loan management is not complete normally in P2P lending,because most P2P companies do not have the post-loan records of borrowers.Conclusions:These findings inspire future studies and practices on P2P lending process and key technologies.
文摘With the rapid growth of information and communication technology (ICT), the violation of information privacy has increased in recent years. The privacy concerns now re-emerge right because people perceives a threat from new ICT that are equipped with enhanced capabilities for surveillance, storage, retrieval, and diffusion of personal information. With the trend in the prevalence and the easy use of ICT, it is of necessary to pay much attention to the issue how the ICT can threaten the privacy of individuals on the Internet. While the Email and P2P (Peer-to-Peer) tools are the most popular ICT, this paper aims at understanding their respectively dissemination patterns in spreading of personal private information. To this purpose, this paper using dynamic model technique to simulate the pattern of sensitive or personal private information propagating situation. In this study, an Email propagation model and a Susceptible-lnfected-Removed (SIR) model are proposed to simulate the propagation patterns of Email and P2P network respectively. Knowing their dissemination patterns would be helpful for system designers, ICT manager, corporate IT personnel, educators, policy makers, and legislators to incorporate consciousness of social and ethical information issues into the protection of information privacy.
文摘The peer-to-peer(P2P) file-sharing network as a vehicle of disseminating files has become very popular. The appearance of dozens of kinds of passive worms on this network has, however, made it unsecured. This problem has been paid attention and a few of models for passive worm propagation has been presented. Unfortunately, the dynamic properties of this network are ignored in these models. Given the fact, the characteristics of both this network and the passive worm are identified, and on this basis a new mathematical model of passive worm propagation on the P2P network is presented in applying epidemiology in this paper. Note that the dynamic properties of this network are considered in the presented model. The model has been validated by large scale simulation experiments, which demonstrates that the presented model may be used for analyzing the behaviors of passive worms and predicting the trend of their propagation.
文摘This paper analyzes the characteristics of the Peer-to-Peer (P2P) active worm and its attacking mechanism, and then proposes a mathematical model of propagation of the P2P active worm applying Epidemiology. Based on the analysis on the protocols of realistic P2P systems, a software which can be used to simulate the P2P network environment and the propagation of P2P active worm is imple- mented in this paper. A large number of simulation experiments are performed using the developed simulation software. The results from these simulation experiments validate the proposed model, which means that the model can be used to analyze the spreading behaviors of the P2P active worm and predict its trend.
基金Sponsored by the National Natural Science Foundation of China(Grant No.60672124 and 60832009)Hi-Tech Research and Development Program(National 863 Program)(Grant No.2007AA01Z221)
文摘IIn order to improve the performance of wireless distributed peer-to-peer(P2P)files sharing systems,a general system architecture and a novel peer selecting model based on fuzzy cognitive maps(FCM)are proposed in this paper.The new model provides an effective approach on choosing an optimal peer from several resource discovering results for the best file transfer.Compared with the traditional min-hops scheme that uses hops as the only selecting criterion,the proposed model uses FCM to investigate the complex relationships among various relative factors in wireless environments and gives an overall evaluation score on the candidate.It also has strong scalability for being independent of specified P2P resource discovering protocols.Furthermore,a complete implementation is explained in concrete modules.The simulation results show that the proposed model is effective and feasible compared with min-hops scheme,with the success transfer rate increased by at least 20% and transfer time improved as high as 34%.
文摘Resource location is the most important issue for Peer-to-Peer (P2P) system and flooding is the fundamental mechanism for unstructured P2P systems. Redundant messages will exponential growth with flooding scope increasing which severely influences the scalability of the system. In this paper, a new P2P model based on isolated broadcast domains is given to reduce the amount of redundant messages by limiting the radius of messages transmitted. Analysis and experiments show that this model can guarantee coverage of nodes and significantly reduce the amount of redundant messages generated.