With the advanced development of wireless communication techniques and the increasing application of smart devices, the mobile P2P ad hoc networks (i.e., P2P MANETs) are attracting more attention. P2P MANETs can be applied to the environments where the communication infrastructure is down due to natural disasters or political tensions. In such a network, how to improve resource search efficiency has been an important research focus. Most existing researches put emphasis on the location-based peers’ clustering but paid less attention to the time factor to implement resource search approaches, resulting in low search efficiency. This paper first proposes a novel location-based peers’ clustering mechanism and a time-aware partners’ selection scheme. Then, we present a resource search algorithm employing both pull and push approaches based on the finding that peer movements are often repeated on a day-to-day basis to cope with peers’ mobility issue in P2P MANETs. The simulation results show that our resource search scheme could both improve the successful search rate and reduce the propagated messages.

中文翻译：

---

移动P2P自组织网络中的位置和时间感知资源搜索方案

随着无线通信技术的先进发展和智能设备的日益普及，移动P2P自组网（即P2P MANETs）越来越受到关注。P2P MANET 可应用于通信基础设施因自然灾害或政治紧张局势而中断的环境。在这样的网络中，如何提高资源搜索效率一直是一个重要的研究热点。现有的研究大多侧重于基于位置的对等点的聚类，而较少关注实现资源搜索方法的时间因素，导致搜索效率低下。本文首先提出了一种新颖的基于位置的同伴聚类机制和时间感知伙伴选择方案。然后，我们提出了一种资源搜索算法，它采用拉和推方法，基于对等移动经常每天重复的发现，以应对 P2P MANET 中的对等移动问题。仿真结果表明，我们的资源搜索方案既可以提高搜索成功率，又可以减少传播的消息。