Thanks to the great progress in mobile and wireless technologies, Internet-distributed applications like P2P file sharing are nowadays deployed over MANET (i.e., P2P mobile systems). These applications allow users to search and share diverse multimedia resources over MANET. Due the nature of MANET, P2P mobile systems brought up many new thriving challenges regarding the query routing issue. To tackle this problem, we introduce a novel context-aware query routing protocol for unstructured P2P mobile file sharing systems. Our protocol (i) locates relevant peers sharing pertinent resources for user's query and (ii) ensures that those peers would be reached by considering different MANET constraints (e.g., query content, peer mobility, battery energy, peer load). In order to consider all these constraints for choosing the relevant peers, we are based on the technique for order preferences by similarity to ideal solution (TOPSIS). We implemented the proposed protocol and compared its routing efficiency and retrieval effectiveness with another protocol taken from the literature. Experimental results show that our scheme carries out better than the baseline protocol with respect to accuracy

中文翻译：

---

MANET网络上P2P系统的路由方法

由于移动和无线技术的巨大进步，如今在MANET（即P2P移动系统）上部署了Internet分发的应用程序，例如P2P文件共享。这些应用程序允许用户通过MANET搜索和共享各种多媒体资源。由于MANET的性质，P2P移动系统在查询路由问题上提出了许多新的挑战。为了解决这个问题，我们为非结构化P2P移动文件共享系统引入了一种新颖的上下文感知查询路由协议。我们的协议（i）定位共享相关资源以供用户查询的相关对等方，并且（ii）通过考虑不同的MANET约束（例如查询内容，对等方移动性，电池能量，对等方负载）来确保达到这些对等方。为了考虑所有这些限制来选择相关的对等方，我们基于类似于理想解决方案（TOPSIS）的订单偏好技术。我们实施了建议的协议，并将其路由效率和检索效率与文献中的另一种协议进行了比较。实验结果表明，我们的方案在准确性方面比基线协议更好