Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Ariadne: a secure on-demand routing protocol for ad hoc networks
Wireless Networks
Applicability of identity-based cryptography for disruption-tolerant networking
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Surviving attacks on disruption-tolerant networks without authentication
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Containing denial-of-service attacks in broadcast authentication in sensor networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Authenticated routing for ad hoc networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Disruption-tolerant networks (DTNs) provide a promising low-cost solution to transfer data in network environment where the connectivity is sporadic and unpredictable. Many existing methods for opportunistic data forwarding depend on the hypothesis that every node forwards messages regardless of the identities of the senders or receivers, however, the networks based on such methods are fragile under baleful attacks, such as black hole, denial of service (DoS), and wormhole. In this paper, we present a security strategy, namely SReD, to mitigate a number of known routing layer attacks. Our solution is a localized, link-state-based and multi-path routing protocol. We employ dynamic window mechanism to switch between reputation-based routing generation mode and probabilistic routing generation mode, and the proposed SReD is particularly suitable for resource-constrained DTNs. The proposed scheme has been compared with Epidemic and Prophet protocols in terms of efficiency and effectiveness against three common attacks. The results show that SReD is robust to these attacks and is more efficient under different metrics.