Robust routing in malicious environment for ad hoc networks

  • Authors:

  • Zhongchao Yu;Chuk-Yang Seng;Tao Jiang;Xue Wu;William A. Arbaugh

  • Affiliations:

  • Dept. of Computer Science, University of Maryland, College Park, MD;Dept. of Computer Science, University of Maryland, College Park, MD;Dept. of Electronic and Engineering, University of Maryland, College Park, MD;Dept. of Computer Science, University of Maryland, College Park, MD;Dept. of Computer Science, University of Maryland, College Park, MD

  • Venue:
  • ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Secure routing in ad hoc networks has been extensively studied in recent years. The vast majority of this work, however, has only focused on providing authenticity of the route. Availability of the network in a malicious environment has largely been ignored. In this paper, we divide the secure routing problem into two layers. The first layer provides authenticated routing and the second layer provides a route selection algorithm that selects a route with the highest probability of successful delivery rather than the shortest route. We provide a metric for evaluating this probability. We provide simulation results that demonstrate that our approach increases the throughput by at least ten percent in a network where fifty percent of the nodes are malicious when compared to an approach that selects the shortest route. Furthermore, our approach incurs only a small delay when compared to the delay along the shortest route.