Location and Time Aware Resource Seeking Framework for Mobile P2P and Ad Hoc Networks

Abstract

A Mobile Ad hoc Network (MANET) is a network with low infrastructure that allows users to create a mobile, wireless network dynamically. Due to the similar nature of its dispersed components, P2P overlay networks and mobile wireless ad hoc networks have several fundamental properties such as self-organization, dynamism, resilience to failure, and decentralization. It's critical to develop P2P algorithms that can handle the issues provided by mobile ad hoc networks. P2P MANETs can be used when communication infrastructure is unavailable due to natural disasters or political turmoil. It's critical to develop P2P algorithms that can handle the issues provided by mobile ad hoc networks. The major challenges of MANET are found in these networks, including node mobility, resource constrained nodes, and content transaction with anonymous nodes. It becomes necessary for the P2P network to observe the change that are taking place in the underlying MANET to form the groups of nodes based on content similarity. Most earlier studies focused on location-based peer clustering but neglected to account for time when adopting resource search strategies, resulting in inefficient search results.