Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Password authentication with insecure communication
Communications of the ACM
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Securing ad hoc routing protocols
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
A Secure Routing Protocol for Ad Hoc Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Secure Link State Routing for Mobile Ad Hoc Networks
SAINT-W '03 Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT'03 Workshops)
Rushing attacks and defense in wireless ad hoc network routing protocols
WiSe '03 Proceedings of the 2nd ACM workshop on Wireless security
Ad Hoc Wireless Networks: Architectures and Protocols
Ad Hoc Wireless Networks: Architectures and Protocols
Securing mobile ad hoc networks
The handbook of ad hoc wireless networks
A Test-Bed for Misbehavior Detection in Mobile Ad-hoc Networks " How Much Can Watchdogs Really Do?
WMCSA '04 Proceedings of the Sixth IEEE Workshop on Mobile Computing Systems and Applications
IEEE Network: The Magazine of Global Internetworking
A robust anonymous ad hoc on-demand routing
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
| Hi-index | 0.00 |
The success of mobile ad hoc networks (MANET) in many applications demands adequate security measures for the routing protocols. The MANET environment offers unique challenges to making routing secure without introducing onerous computational or operational requirements. In this paper, we introduce the Secure Neighborhood Routing Protocol (SNRP), which offers detection of several malicious behaviors and robustness under various routing attacks. SNRP introduces an authenticated form of the Neighbor Lookup Protocol (NLP) to secure MANET routing with significantly less cryptographic computation than approaches such as Secure Ad-hoc On-demand Distance Vector (SAODV) routing. Public key certificates are used to "introduce" a newly arrived node to its new neighbors, after which neighbors trust (but observe) each other. Route discovery packets are then secured using end-to-end HMAC rather than hop-by-hop signatures.