With the development of peer-to-peer(P2P) network technology- and the increasing demand of users for content sharing in wireless networks, wireless P2P networks has become a hot spot of network technology. Search algorithm is directly related to the performance and scalability of P2P system. Therefore, study on search technology in wireless P2P networks is of great significance.Traditional search algorithms in wireless P2P networks, such as flooding, random walk, and so on, are blind. As interests between users are more similar, the possibility of content requesting and transferring among them increases in content sharing networks. According to this character, a relation-based search algorithm, combining relation aware routing algorithm in wireless networks and two-stage random walk, is proposed in this paper. On the basis of relation aware routing algorithm, relation-based search algorithm selects the query path depending on interest similarity between users, the search is purposeful. In addition, according to the interest relationship between nodes, a simple and effective caching mechanism based on relation is proposed. Simulation results show that relation-based search algorithm performs better than traditional search algorithms. |