Title :
Thwarting Blackhole Attacks in Disruption-Tolerant Networks using Encounter Tickets
Author :
Li, Feng ; Wu, Jie ; Srinivasan, Avinash
Author_Institution :
Dept. of Comput. Sci. & Eng., Florida Atlantic Univ., Boca Raton, FL
Abstract :
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.
Keywords :
mobility management (mobile radio); telecommunication network routing; DTN routing algorithms; Dempster-Shafer theory; blackhole attacks; disruption-tolerant networks; encounter prediction; encounter tickets; future forwarding; mobility patterns; Communications Society; Computer science; Disruption tolerant networking; History; Peer to peer computing; Robustness; Routing protocols; Security; Statistics; Uncertainty;
Conference_Titel :
INFOCOM 2009, IEEE
Conference_Location :
Rio de Janeiro
Print_ISBN :
978-1-4244-3512-8
Electronic_ISBN :
0743-166X
DOI :
10.1109/INFCOM.2009.5062170