By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
W. Zhang ; Dept. of Comput. Sci. & Eng., Pennsylvania State Univ., University Park, PA, USA ; R. Rao ; G. Cao ; G. Kesidis

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 compromised and become malicious. The presence of compromised 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.

Published in:

Military Communications Conference, 2003. MILCOM '03. 2003 IEEE  (Volume:2 )

Date of Conference:

13-16 Oct. 2003