DTN (Delay Tolerant Network) is a new concept in the field of wireless networks. It enables communication in challenged environment where traditional network fails. Unlike other ad hoc wireless network it does not demand for end to end node connectivity. DTN is based on store carry and forward principle. This mechanism is implemented using bundle protocol. DTN nodes have capabilities such as radio interface, movement, persistent storage, message routing and energy consumption .Here a node might accumulate a message in its buffer and carry it for limited time, waiting till a suitable forwarding opportunity is acquired. Multiple message duplication into the network is done to increase delivery probability. The main objective of DTN Routing is to build a powerful network between various nodes (mobile devices, planetary vehicles etc) so that good delivery probability and less delay are obtained. This unique mechanism poses a security challenge. A sophisticated attack observed is black hole attack in which malicious intermediate node are present in network that can provide attacked forged metrics to another node. The aim of this work is to simulate and analyze routing protocol of DTN when nodes enter in environment with black hole attack. The work has been carried out with ONE (opportunistic network environment) simulator. The performance of routing protocols (RAPID and Spray and Wait) are tested for different number of attacking nodes. The analysis indicates there is decrease in delivery probability, hop count average and buffer time average. But latency average first increases and then start decreasing. The overhead ratio increases using Spray and Wait Protocol but with RAPID protocol, it decreases with increasing black hole attacking nodes.
[1]
Brian Gallagher,et al.
MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks
,
2006,
Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[2]
Cauligi S. Raghavendra,et al.
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
,
2005,
WDTN '05.
[3]
Vinton G. Cerf,et al.
Delay-tolerant networking: an approach to interplanetary Internet
,
2003,
IEEE Commun. Mag..
[4]
Anders Lindgren,et al.
Probabilistic routing in intermittently connected networks
,
2003,
MOCO.
[5]
A. L. Sangal,et al.
Performance Comparison of RAPID, Epidemic and Prophet Routing Protocols for Delay Tolerant Networks
,
2012
.
[6]
Kevin R. Fall,et al.
A delay-tolerant network architecture for challenged internets
,
2003,
SIGCOMM '03.
[7]
Anders Lindgren,et al.
Probabilistic Routing in Intermittently Connected Networks
,
2004,
SAPIR.
[8]
Scott C. Burleigh,et al.
Bundle Protocol Specification
,
2007,
RFC.
[9]
Amin Vahdat,et al.
Epidemic Routing for Partially-Connected Ad Hoc Networks
,
2009
.