中文摘要：

移动P2P网络具有拓扑动态多变、节点资源有限、网络资源短缺的特点．如何合理地、高效地使用移动节点提供的协作缓存资源、增加移动节点间的协作来减少移动P2P的网络时延、节省带宽、防止拥塞是一个关键问题．深入研究了有限协作缓存——Cache资源的替换策略、重要数据的及时缓存和Cache资源的充分使用问题．并根据蚁群算法的思路，提出了一种基于信息素的Cache替换算法，建立了选取适当存储空间作为Cache的数学模型和推导．理论分析和仿真数据表明该算法能有效提高协作Cache资源的使用率，促进了移动节点间的协作，提高了移动节点从邻居节点获得资源的成功率，并减少了协作Cache资源请求的平均响应时间．

英文摘要：

Mobile P2P network is topology dynamic, mobile nodes resource limited, and network resource short. Considering the limitation of network resources and shortage of peer resources, how to make full use of mobile nodes＇ cooperative cache resources effectively and increase mobile nodes＇ cooperation is a challenging task to reduce network delay, save bandwidth and prevent congestion in mobile P2P networks. To solve this problem, the limited cooperative cache replacement policy establishment, the sufficient cooperative cache resource use and the key data buffering are discussed in detail in this paper. Moreover, according to the idea of ant colony algorithm, a cooperative cache replacement policy based on the pheromone is proposed, and a mathematical model and the derivation of choosing appropriate memory space as cooperative cache are established. The theory analysis and experiment results of this paper show that the new policy can significantly improve cooperative cache resource utility and improve network performance efficiently. It also can promote the mobile nodes＇ cooperation and success ratio of resource obtainment from neighbor nodes and reduce the average response delay of cooperative cache resource request.