Secure High-Throughput Multicast Routing in Wireless Mesh Networks

被引:19
作者
Dong, Jing [1 ]
Curtmola, Reza [2 ]
Nita-Rotaru, Cristina [1 ]
机构
[1] Purdue Univ, Dept Comp Sci, W Lafayette, IN 47907 USA
[2] New Jersey Inst Technol, Dept Comp Sci, Newark, NJ 07102 USA
基金
美国国家科学基金会;
关键词
Wireless mesh networks; high-throughput metrics; secure multicast routing; metric manipulation attacks; Byzantine attacks; HOC; PROTOCOLS;
D O I
10.1109/TMC.2010.194
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Recent work in multicast routing for wireless mesh networks has focused on metrics that estimate link quality to maximize throughput. Nodes must collaborate in order to compute the path metric and forward data. The assumption that all nodes are honest and behave correctly during metric computation, propagation, and aggregation, as well as during data forwarding, leads to unexpected consequences in adversarial networks where compromised nodes act maliciously. In this work, we identify novel attacks against highthroughput multicast protocols in wireless mesh networks. The attacks exploit the local estimation and global aggregation of the metric to allow attackers to attract a large amount of traffic. We show that these attacks are very effective against multicast protocols based on high-throughput metrics. We conclude that aggressive path selection is a double-edged sword: While it maximizes throughput, it also increases attack effectiveness in the absence of defense mechanisms. Our approach to defend against the identified attacks combines measurement-based detection and accusation-based reaction techniques. The solution accommodates transient network variations and is resilient against attempts to exploit the defense mechanism itself. A detailed security analysis of our defense scheme establishes bounds on the impact of attacks. We demonstrate both the attacks and our defense using ODMRP, a representative multicast protocol for wireless mesh networks, and SPP, an adaptation of the well-known ETX unicast metric to the multicast setting.
引用
收藏
页码:653 / 668
页数:16
相关论文
共 47 条
[1]  
Abramson N., 1970, P AFIPS FALL JOINT C
[2]  
Adya A, 2004, P 1 INT C BROADB NET
[3]  
[Anonymous], P 4 IEEE WORKSH MOB
[4]  
[Anonymous], P NETW DISTR SYST SE
[5]  
[Anonymous], 1999, MATH GAZ, DOI DOI 10.2307/3619120
[6]  
[Anonymous], 2000, INTERNET DRAFT DRAFT
[7]  
[Anonymous], 2003, P 2 ACM WORKSH WIR S, DOI [10.1145/941311.941318, DOI 10.1145/941311.941318]
[8]  
[Anonymous], 2004, P 3 INT S INF PROC S
[9]  
AWERBUCH B, 2007, ACM T INFORM SYSTEMS, V10, P1
[10]  
AWERBUCH B, 2005, P 1 INT C SEC PRIV E