Secure Neighborhood Routing Protocol

Author

Jadhav, Ajay ; Johnson, Eric E.

fYear

2006

fDate

23-25 Oct. 2006

Firstpage

1

Lastpage

7

Abstract

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

Keywords

ad hoc networks; message authentication; mobile radio; public key cryptography; routing protocols; telecommunication security; HMAC; MANET; NLP; SNRP; hash message authentication code; mobile ad hoc network; neighbor lookup protocol; public key certificate; route discovery packet; secure neighborhood routing protocol; Ad hoc networks; Communication system security; Computer security; Cryptographic protocols; Mobile ad hoc networks; Mobile communication; Public key cryptography; Robustness; Routing protocols; Telecommunication traffic; Communication system security; communication system routing; computer network security; mobile communications;

fLanguage

English

Publisher

ieee

Conference_Titel

Military Communications Conference, 2006. MILCOM 2006. IEEE

Conference_Location

Washington, DC

Print_ISBN

1-4244-0617-X

Electronic_ISBN

1-4244-0618-8

Type

conf

DOI

10.1109/MILCOM.2006.302344

Filename

4086890