Routing amid colluding attackers

被引:10
作者
Eriksson, Jakob [1 ]
Faloutsos, Michalis [2 ]
Krishnamurthy, Srikanth V. [2 ]
机构
[1] MIT CSAIL, Cambridge, MA 02139 USA
[2] Univ Calif Riverside, Riverside, CA 92521 USA
来源
2007 IEEE INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS | 2007年
关键词
D O I
10.1109/ICNP.2007.4375849
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
We propose the first practical solution to the long-standing problem of secure wireless routing in the presence of colluding attackers. Our secure routing protocol, Sprout(1), continuously tries new routes to the destination. Routes are probabilistically generated, with complete disregard for performance metrics. This makes Sprout uniquely resilient to attack: it cannot be tempted by shortcuts. In order to avoid compromised routes, and to ensure good overall performance, the quality of each active route is monitored by means of signed end-to-end acknowledgments. The amount of traffic sent on each route is adjusted accordingly. Sprout effectively mitigates the vast majority of known routing layer attacks, even when under assault from a large number of colluding attackers. Experiments on our 31-node testbed demonstrates the real-world performance of Sprout in terms of packet delivery ratio, round-trip times and TCP throughput. Our security analysis and simulation results show that Sprout is able to quickly find working paths in networks of hundreds of nodes and dozens or more attackers. For example, in a network of 200 nodes and an astounding 64 attackers, Sprout, on average, found a successful route within less than 10 attempts. Yet, in benign settings, Sprout provides TCP throughput within 15% of the shortest path throughput. Overall, Sprout consistently delivers high, reliable performance in benign as well as hostile environments.(2).
引用
收藏
页码:184 / +
页数:2
相关论文
共 20 条
[1]  
AWERBUCH B, 2002, WISE
[2]  
AWERBUCH B, 2003, PROVABLY SECURE COMP
[3]  
BORKAR V, 2003, IEEE T AUTOMATIC CON
[4]  
ERIKSSON J, SPROUT SOURCE CODE
[5]  
Eriksson J., 2006, ICNP
[6]  
ERIKSSON J, 2006, ROUTING AMID COLLUDI
[7]  
HU YC, 2002, WMCSA
[8]  
Hu Yih-Chun, 2002, MOBICOM
[9]  
Jacquet P., 2001, IEEE INMIC
[10]  
KOHLER E, 2000, ACM COMPUTER SYSTEM