Thwarting Blackhole Attacks in Distruption-Tolerant Networks using Encounter Tickets

被引:57
作者
Li, Feng [1 ]
Wu, Jie [1 ]
Srinivasan, Avinash [2 ]
机构
[1] Florida Atlantic Univ, Dept Comp Sci & Engn, Boca Raton, FL 33431 USA
[2] Bloomsburg Univ Penn, Dept Math Stat & Comp Sci, Bloomsburg, PA 17815 USA
来源
IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5 | 2009年
关键词
Blackhole attacks; disruption-tolerant networks (DTNs); encounter tickets; observation; PKI; security; uncertainty;
D O I
10.1109/INFCOM.2009.5062170
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Nodes in disruption-tolerant networks (DTNs) usually exhibit repetitive motions. Several recently proposed DTN routing algorithms have utilized the DTNs' cyclic properties for predicting future forwarding. The prediction is based on metrics abstracted from nodes' contact history. However, the robustness of the encounter prediction becomes vital for DTN routing since malicious nodes can provide forged metrics or follow sophisticated mobility patterns to attract packets and gain a significant advantage in encounter prediction. In this paper, we examine the impact of the blackhole attack and its variations in DTN routing. We introduce the concept of encounter tickets to secure the evidence of each contact. In our scheme, nodes adopt a unique way of interpreting the contact history by making observations based on the collected encounter tickets. Then, following the Dempster-Shafer theory, nodes form trust and confidence opinions towards the competency of each encountered forwarding node. Extensive real-trace-driven simulation results are presented to support the effectiveness of our system.
引用
收藏
页码:2428 / +
页数:2
相关论文
共 23 条
[1]  
[Anonymous], P IEEE SEC PRIV
[2]  
[Anonymous], P ACM SIGCOMM
[3]  
[Anonymous], P ACM SIGCOMM
[4]  
[Anonymous], 2006, P IEEE INFOCOM
[5]  
Buchegger S, 2002, P 3 ACM INT S MOB AD, P226, DOI DOI 10.1145/513800.513828
[6]   MORA routing and capacity building in disruption-tolerant networks [J].
Bums, Brendan ;
Brock, Oliver ;
Levine, Brian Neil .
AD HOC NETWORKS, 2008, 6 (04) :600-620
[7]  
Burgess J., 2007, P ACM MOBIHOC
[8]  
CAPKUN S, 2003, P ACM SASN
[9]  
CARBONE M, 2003, RS034 BRICS
[10]  
Dubois-Ferriere H., 2003, P ACM MOBIHOC