Using K-nearest neighbor algorithm to reduce false negatives in P2P secure routing protocols

A peer-to-peer (P2P) system is known for its scalability and dynamic nature, where nodes can join and leave the system easily and at any time. These networks are susceptible to malicious behavior such as nodes dropping messages and misleading other nodes. P2P routing protocols are not immune against such incidents. Additionally, most secure routing protocols in the literature suffer from false negatives. In this paper, we propose to use the K-nearest neighbor (K-nn) algorithm in order to reduce false negatives in P2P secure routing protocols. We incorporate the proposed algorithm in a chord based trust aware P2P routing protocol, and evaluate its performance using the PeerSim simulator. Preliminary simulation results demonstrate that the proposed algorithm reduces the rate of false negatives without impacting the malicious node detection rate.