Performance and Security Analyses of Onion-Based Anonymous Routing for Delay Tolerant Networks (Preprint-2017)


The aim of the project the data can be sending in a secure manner. The security process provides us Onion-Based Anonymous Routing. This network Routing used to data send to destination this our main aim so that our goal will be reach.

Proposed system:

The goal of this paper is to build performance and security models for anonymous communications in DTNs based on our preliminary work. We first design an abstract anonymous routing protocol based on onion-based routing protocols proposed. Our simplified protocol captures the essence of understanding the performance and security issues of anonymous DTN routing, and in addition, it can be easily extended to auxiliary protocols.
Which a set of nodes form an onion group so that any node in the same onion group is able to encypt/decrypt the corresponding layer.
we build analytical models for the delivery rate by defining opportunistic onion path. The key difference from the existing model, called opportunistic path is that an any cast-like property is incorporated, i.e., a node can forward a message to any node in the next onion group. We provide the bound of the message transmission cost introduced by anonymous DTN routing. Which is defined as the factor of the shortest path between two nodes without the consideration of anonymous communications. We analyze the traceable rate, which indicates how many segments of a routing path are disclosed to adversaries. Our approach to estimating the traceable rate is unique in that it reduces the problem to merely computing the run length of the bit string representing a routing path. In addition, we introduce an entropy-based metric, called path anonymity.