PROJECT TITLE :

MR-Chord: Improved Chord Lookup Performance in Structured Mobile P2P Networks

ABSTRACT:

Peer-to-peer (P2P) networks are turning into terribly widespread since varied applications like media streaming and voice over IP use these networks in several surroundings settings while not the necessity for a consumer-server structure. P2P protocols have been originally designed for traditional wired networks, and when deployed in wireless network environments, many challenges are encountered. For instance, P2P clients could depart or be a part of the network frequently, raising the problem of identification and retrieval of knowledge items in an efficient manner. In this state of affairs, the routing data in P2P purchasers might become overdue, leading to lookup failures. This paper continues the investigation of our recently proposed answer for Chord lookup in mobile P2P networks [thus-referred to as mobile sturdy Chord (MR-Chord)]. MR-Chord was designed to keep up and update the finger table employing a changed distributed hash table-based protocol, thus that the mandatory lookup services in the network are provided. Our contribution consists in finding out the results of node mobility on the performance of MR-Chord. Simulation results show that in the presence of node mobility, MR-Chord outperforms the original Chord protocol in terms of lookup success rate, overlay consistency, lookup delay time, lookup hot count, and total network load, chosen as performance metrics.