On-Demand Anonymous Routing with Distance Vector Protecting Traffic Privacy in Wireless Multi-hop Networks

Abstract

Because of easy accessible medium in wireless networks, use of these wireless networks in military applications poses several security issues. Likewise, in the business field, despite the emerging static wireless Internet access, the same security issues remains. On example is the passive attack in which attackers attempt to overhear network communications from the outside. Confidentiality can be further divided into two categories, namely, data confidentiality and traffic confidentiality. In this paper, for improving traffic confidentiality, we propose two anonymous routing algorithms, called randomized routing algorithm and probabilistic penalty-based routing algorithm. Both algorithms aim to differentiate routing paths to the same destination enhancing anonymity of the network traffic. We provide simulation results and demonstrate how much these two algorithm disperse routing paths in a network.