A location and time-aware resource searching scheme in mobile P2P ad hoc networks

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.