A Semantic Search Model based on Locality-sensitive Hashing in mobile P2P

In this paper we have explored the issue of how to integrate semantics searching into a mobile P2P system. Our semantic searching approach is based on LSH where the semantically close documents are clustered to the same peers with high probability. For a query, we chose several points randomly from the neighborhood of the query as the semantic searching key. Our approach only adds index information to super nodes, and mobile node only needs small energy and CPU consumption.