Article ID Journal Published Year Pages File Type
422863 Electronic Notes in Theoretical Computer Science 2009 13 Pages PDF
Abstract

We propose a probabilistic system model for anonymous ad hoc routing protocols that takes into account the a priori knowledge of the adversary, and illustrate how the information theoretical entropy can be used for quantification of the anonymity offered by a routing protocol as the adversary captures an increasing number of nodes in the network. The proposed measurement schema is applied to ANODR and ARM routing protocols.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics