Abstract: This paper presents an adaptive search mechanism for mobile P2P networks. It utilizes the feedback from previous searches to compute dynamically the popularity of the objects of the nodes, and proactively distributs file metadata according to the popularity. To decrease the number of queries, the mechanism utilizes the position information of the popular nodes or the nodes that can return the most query results to guide the queries. Experimental result shows that the strategy can remarkably improve the search efficiency with the small response time, high success rates and the eminent adaptability to the change of hot resources.

Key words: mobile P2P, search mechanism, location aided, mobile ad hoc network

摘要： 给出一种移动P2P 网络中的自适应搜索机制。该机制依据节点命中查询的历史信息动态地计算相应的节点存储文件流行程度，并根据文件流行程度先应地发布文件元数据信息，利用返回最多的响应节点或者流行节点的位置信息作为查询转发的指导以减少查询消息。实验结果表明，该机制具有较高搜索成功率和较短的响应时间，能够提高搜索性能。

关键词: 移动P2P, 搜索机制, 位置辅助, 移动自组网

CLC Number: 

• TP393