Short paper: Jamming-resilient multipath routing leveraging availability-based correlation

  • Authors:
  • Hossen A. Mustafa;Xin Zhang;Zhenhua Liu;Wenyuan Xu;Adrian Perrig

  • Affiliations:
  • University of South Carolina, Columbia, SC, USA;Carnegie Mellon University, Pittsburgh, PA, USA;University of South Carolina, Columbia, SC, USA;University of South Carolina, Columbia, SC, USA;Carnegie Mellon University, Pittsburgh, PA, USA

  • Venue:
  • Proceedings of the fourth ACM conference on Wireless network security
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Jamming attacks are especially harmful to the reliability of wireless communication, as they can effectively disrupt communication. Existing jamming defenses primarily focus on repairing connectivity between adjacent nodes. In this paper, we address jamming at the network level and focus on restoring the end-to-end data delivery through multipath routing. As long as all paths do not fail concurrently, the end-to-end path availability is maintained. Prior work in multipath selection improves routing by choosing node-disjoint paths or link-disjoint paths. However, through our experiments on jamming effects using MicaZ nodes, we show that topological disjointness is insufficient for selecting fault-independent paths. Thus, we address multipath selection based on the knowledge of a path's availability history. Using Availability History Vectors (AHVs) of paths, we present an AHV-based Link-State (ALS) algorithm to select fault-independent paths. Our extensive simulation results validate that the ALS algorithm is effective in overcoming the jamming impact by maximizing the end-to-end availability of the selected paths.