Issue No. 06 - Nov.-Dec. (2012 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TDSC.2012.69
Hossen Mustafa , University of South Carolina, Columbia
Xin Zhang , Carnegie Mellon University, Pittsburgh
Zhenhua Liu , University of South Carolina, Columbia
Wenyuan Xu , University of South Carolina, Columbia
Adrian Perrig , Carnegie Mellon University, Pittsburgh
Jamming attacks are especially harmful to the reliability of wireless communication, as they can effectively disrupt communication between any node pairs. 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 availability by choosing node-disjoint paths or link-disjoint paths. However, through our experiments on jamming effects using MicaZ nodes, we show that 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 a centralized AHV-based algorithm to select fault-independent paths, and a distributed AHV-based routing protocol built on top of a classic routing algorithm in ad hoc networks. Our extensive simulation results validate that both AHV-based algorithms are effective in overcoming the jamming impact by maximizing the end-to-end availability of the selected paths.
Jamming, Wireless networks, Routing algorithms, Correlation, Wireless communication, Ad hoc networks, jamming, Wireless networks, routing algorithms
A. Perrig, W. Xu, Z. Liu, X. Zhang and H. Mustafa, "Jamming-Resilient Multipath Routing," in IEEE Transactions on Dependable and Secure Computing, vol. 9, no. , pp. 852-864, 2012.