NSDA: A Novel Node Selecting Optimal Algorithm Based on Dijkstra

Abstract

This paper first represent the basic conceptions of anonymous communication, then introduce the fundamentals in Anonymous Communication. Afterwards, we went deep to the classification of anonymous network topological, therefore we could get a better understanding on P2P anonymous communication system. We also systematically analyzes the existing node-select algorithms. Furthermore, we propose and implement a new node selection algorithm based on Dijkstra algorithm, named NSDA algorithm. We give a belief description about the backgrounds and design of NSDA Algorithm. The algorithm can combine the node properties with link properties to select node, which can adjust the system performancing and anonymity. In order to evaluate the NSDA algorithm, we have done experiments in Network Simulator 3, and we also explain the reason why we choose Network Simulator 3 as the simulate tool. In the end, we analyze the characteristics of NSDA algorithm according to the results of experiments.