Query Learning-Based Scheme for Pertinent Resource Lookup in Mobile P2P Networks

Abstract

P2P networking has grasped an increasing interest worldwide among both researchers and computer networking professionals. As a witness, several P2P applications mainly used for file sharing over the Internet have been proposed. Considering the great success of mobile devices in recent years, P2P applications have also been deployed over mobile networks such as mobile ad-hoc networks (MANETs). However, the mismatch between the P2P overlay and the MANET underlay topologies makes the resources lookup mechanism in mobile P2P applications very difficult. Therefore, this downside is the main hindrance to the deployment of such applications over MANETs. To overcome the mismatch issue, we propose in this paper RLSM-P2P a cross-layer resource lookup scheme for Mobile P2P applications. The main thrust of RLSM-P2P consists of building an efficient unstructured P2P overlay that closely matches the underlay physical network and swiftly adapts to its volatility and dynamicity by considering different MANET constraints. Furthermore, RLSM-P2P relies on a query learning resource lookup mechanism for locating pertinent resources to user queries. The performed experiments show that RLSM-P2P outperforms its competitors in terms of effectiveness and efficiency.

A Mini Review of Peer-to-Peer (P2P) for Vehicular Communication

“…In structured P2P, the network provides an organized architecture, allowing nodes to efficiently look for files, even if the content is not extensively readily available. In most cases, this is accomplished with hash functions that assist in database lookups [21]. Although structured networks might be more efficient, they tend to present greater levels of centralization and usually require greater setup and maintenance expenses.…”

Deep Q-Learning Based Optimal Query Routing Approach for Unstructured P2P Network

“…Searching in P2P systems has been achieved by two techniques Blind search and Informed search. These search techniques relied on various query mechanisms in unstructured P2P systems, such as gossiping [13][14][15], random walk [16,17], k-walker [16,18], controlled flooding, and pure flooding [19]. Among these, gossiping is an attractive and widely adopted mechanism for modern query routing approaches [15,20].…”

“…These search techniques relied on various query mechanisms in unstructured P2P systems, such as gossiping [13][14][15], random walk [16,17], k-walker [16,18], controlled flooding, and pure flooding [19]. Among these, gossiping is an attractive and widely adopted mechanism for modern query routing approaches [15,20]. Rather than selecting k neighbors at random, as k-walker, random walk, and controlled flooding do, gossiping routes the query to the k neighbors with the highest probability of holding the requested resource [14,15,20,21].…”

“…Among these, gossiping is an attractive and widely adopted mechanism for modern query routing approaches [15,20]. Rather than selecting k neighbors at random, as k-walker, random walk, and controlled flooding do, gossiping routes the query to the k neighbors with the highest probability of holding the requested resource [14,15,20,21]. The current gossiping mechanism introduces the K-Neighbor Selection (K-NS) problem, which uses a particular scoring function to select the k relevant neighbors with the maximum score.…”

ZRR-P2P: Zone-Based Mechanism for Data Replication and Research Optimization in Unstructured P2P Systems

“…In this type of systems, lookup (search) service optimization always presents a major challenge to offer a good quality of service to users [11], in terms of criteria such as search latency, the search success rate [12], number of search hops [13,14], etc.…”