Search Algorithm Based on User Interest-proximity Measurement

Efficiency of P2P search has strong relation with the habit of users.Based on the clustering of users in P2P overlay network,this paper proposed a new network model and corresponding search algorithm.This paper computed the proximity to form out overlay network,and adjust this search algorithm according to the proximity.This paper also proved its search algorithm had better efficiency than random walk search algorithm and simple flooding algorithm theoretically.Experiment result shows that,its search algorithm have better performance than simple random walk search algorithm in the aspect of average search time as well as message complexity.