Secure routing in ad hoc networks and a related intrusion detection problem

Wensheng Zhang, R. Rao, Guohong Cao, George Kesidis

Research output: Contribution to conferencePaper

18 Citations (Scopus)

Abstract

The intrinsic nature of wireless ad hoc networks makes them vulnerable to various passive or active attacks. Thus, there is no guarantee that a routed communication path is free of malicious nodes that will not comply with the employed protocol and attempt to interfere the network operations. In this paper, we survey the problem of secure routing in ad hoc wireless networks, and discuss the related techniques of cryptographic key distribution. However, no matter how secure the routing protocol is, it is still possible that some nodes are comprimised and become malicious. The presence of comprimised nodes, especially in nodes that are communication bottlenecks, limit the effectiveness of the described secure routing protocols. We therefore consider the problem of intrusion detection for such nodes. The intrusion detection problem and some solutions are described in detail for a concrete queueing model of medium access. The extensions of the solutions to address the problem in more general scenarios are also discussed.

Original languageEnglish (US)
Pages735-740
Number of pages6
StatePublished - Dec 1 2003
EventMILCOM 2003 - 2003 IEEE Military Communications Conference - Monterey, CA, United States
Duration: Oct 13 2003Oct 16 2003

Other

OtherMILCOM 2003 - 2003 IEEE Military Communications Conference
CountryUnited States
CityMonterey, CA
Period10/13/0310/16/03

Fingerprint

Wireless ad hoc networks
Intrusion detection
Ad hoc networks
Routing protocols
Communication
Network protocols

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Zhang, W., Rao, R., Cao, G., & Kesidis, G. (2003). Secure routing in ad hoc networks and a related intrusion detection problem. 735-740. Paper presented at MILCOM 2003 - 2003 IEEE Military Communications Conference, Monterey, CA, United States.
Zhang, Wensheng ; Rao, R. ; Cao, Guohong ; Kesidis, George. / Secure routing in ad hoc networks and a related intrusion detection problem. Paper presented at MILCOM 2003 - 2003 IEEE Military Communications Conference, Monterey, CA, United States.6 p.
@conference{79717acd9dd84ea8b7c5b7ae1b42de88,
title = "Secure routing in ad hoc networks and a related intrusion detection problem",
abstract = "The intrinsic nature of wireless ad hoc networks makes them vulnerable to various passive or active attacks. Thus, there is no guarantee that a routed communication path is free of malicious nodes that will not comply with the employed protocol and attempt to interfere the network operations. In this paper, we survey the problem of secure routing in ad hoc wireless networks, and discuss the related techniques of cryptographic key distribution. However, no matter how secure the routing protocol is, it is still possible that some nodes are comprimised and become malicious. The presence of comprimised nodes, especially in nodes that are communication bottlenecks, limit the effectiveness of the described secure routing protocols. We therefore consider the problem of intrusion detection for such nodes. The intrusion detection problem and some solutions are described in detail for a concrete queueing model of medium access. The extensions of the solutions to address the problem in more general scenarios are also discussed.",
author = "Wensheng Zhang and R. Rao and Guohong Cao and George Kesidis",
year = "2003",
month = "12",
day = "1",
language = "English (US)",
pages = "735--740",
note = "MILCOM 2003 - 2003 IEEE Military Communications Conference ; Conference date: 13-10-2003 Through 16-10-2003",

}

Zhang, W, Rao, R, Cao, G & Kesidis, G 2003, 'Secure routing in ad hoc networks and a related intrusion detection problem', Paper presented at MILCOM 2003 - 2003 IEEE Military Communications Conference, Monterey, CA, United States, 10/13/03 - 10/16/03 pp. 735-740.

Secure routing in ad hoc networks and a related intrusion detection problem. / Zhang, Wensheng; Rao, R.; Cao, Guohong; Kesidis, George.

2003. 735-740 Paper presented at MILCOM 2003 - 2003 IEEE Military Communications Conference, Monterey, CA, United States.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Secure routing in ad hoc networks and a related intrusion detection problem

AU - Zhang, Wensheng

AU - Rao, R.

AU - Cao, Guohong

AU - Kesidis, George

PY - 2003/12/1

Y1 - 2003/12/1

N2 - The intrinsic nature of wireless ad hoc networks makes them vulnerable to various passive or active attacks. Thus, there is no guarantee that a routed communication path is free of malicious nodes that will not comply with the employed protocol and attempt to interfere the network operations. In this paper, we survey the problem of secure routing in ad hoc wireless networks, and discuss the related techniques of cryptographic key distribution. However, no matter how secure the routing protocol is, it is still possible that some nodes are comprimised and become malicious. The presence of comprimised nodes, especially in nodes that are communication bottlenecks, limit the effectiveness of the described secure routing protocols. We therefore consider the problem of intrusion detection for such nodes. The intrusion detection problem and some solutions are described in detail for a concrete queueing model of medium access. The extensions of the solutions to address the problem in more general scenarios are also discussed.

AB - The intrinsic nature of wireless ad hoc networks makes them vulnerable to various passive or active attacks. Thus, there is no guarantee that a routed communication path is free of malicious nodes that will not comply with the employed protocol and attempt to interfere the network operations. In this paper, we survey the problem of secure routing in ad hoc wireless networks, and discuss the related techniques of cryptographic key distribution. However, no matter how secure the routing protocol is, it is still possible that some nodes are comprimised and become malicious. The presence of comprimised nodes, especially in nodes that are communication bottlenecks, limit the effectiveness of the described secure routing protocols. We therefore consider the problem of intrusion detection for such nodes. The intrusion detection problem and some solutions are described in detail for a concrete queueing model of medium access. The extensions of the solutions to address the problem in more general scenarios are also discussed.

UR - http://www.scopus.com/inward/record.url?scp=3142747076&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3142747076&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:3142747076

SP - 735

EP - 740

ER -

Zhang W, Rao R, Cao G, Kesidis G. Secure routing in ad hoc networks and a related intrusion detection problem. 2003. Paper presented at MILCOM 2003 - 2003 IEEE Military Communications Conference, Monterey, CA, United States.