Self-organizing Clustering P2P Semantic Routing Algorithm

In order to solve the problem of low efficiency of structured P2P semantic routing process,this paper analyzes the Hash function,concludes and applies the property that the logical relation among the destination node,the traditional semantic routing relay node sequence,and the clustering neighboring nodes.It proposes the self-organizing clustering P2P semantic routing algorithm to improve the efficiency of semantic routing,and guarantee the equivalence,self-organization and the possible of scaling scale of P2P network.