Minimizing Redundant Messages and Improving Search Efficiency under Highly Dynamic Mobile P2P Network

Abstract

Resource Searching is one of the key functional tasks in large complex networks. With the P2P architecture, millions of peers connect together instantly building a communication pattern. Searching in mobile networks faces additional limitations and challenges. Flooding technique can cope up with the churn and searches aggressively by visiting almost all the nodes. But it exponentially increases the network traffic and thus does not scale well. Further the duplicated query messages consume extra battery power and network bandwidth. The blind flooding also suffers from long delay problem in P2P networks. In this paper, we propose optimal density based flooding resource discovery schemes. Our first model takes into account local graph topology information to supplement the resource discovery process while in our extended version we also consider the neighboring node topology information along with the local node information to further effectively use the mobile and network resources. Our proposed method reduces collision at the same time minimizes effect of redundant messages and failures. Overall the methods reduce network overhead, battery power consumption, query delay, routing load, MAC load and bandwidth usage while also achieving good success rate in comparison to the other techniques. We also perform a comprehensive analysis of the resource discovery schemes to verify the impact of varying node speed and different network conditions.

Keywords

• MANET
• Mobile Peer-to-Peer
• Flooding
• Node Density