By Topic

A new secure routing protocol to defend Byzantine attacks for ad hoc networks

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
$31 $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

3 Author(s)
Ming Yu ; Dept. of Electr. & Comput. Eng., State Univ. of New York, Binghamton, NY, USA ; Kulkarni, S. ; Lau, P.

To secure ad hoc networks, a particularly challenging problem is how to feasibly detect and defend the internal attacks against the routing protocols, such as Byzantine behaviors. In this paper, we develop: (1) an efficient distributed key management scheme that a source node can authenticate its neighbors and establish a session key on-demand; (2) a novel detection algorithm that can detect the internal attacks, such as Byzantine attacks, by using both message and route redundancy; (3) a new secure routing protocol (SRP), behavior-based secure routing (BBSR), in which a node selects its best route based on its accumulated trust on the nodes along the candidate routes; (4) a cost function that directly measures the cost of the increased trustworthiness and its impact on network performance. The simulation results have demonstrated the effectiveness of the proposed key management scheme, attack detection algorithm, and routing protocol.

Published in:

Networks, 2005. Jointly held with the 2005 IEEE 7th Malaysia International Conference on Communication., 2005 13th IEEE International Conference on  (Volume:2 )

Date of Conference:

16-18 Nov. 2005