By Topic

Achieving cooperative detection against Sybil attack in wireless ad hoc networks: A game theoretic approach

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)
Xiaojuan Liao ; Grad. Sch. of Inf. Sci. & Electr. Eng., Kyushu Univ., Fukuoka, Japan ; Dong Hao ; Sakurai, K.

Sybil Attack means one node counterfeits multiple identities. It poses great threats to the routing of wireless ad hoc networks. Many existing solutions employ local detection method to capture misbehavior and then enhance the detection accuracy by information exchange. However, they ignore the rationality of member nodes. To save resource, rational nodes are reluctant to share information, therefore, how to guarantee reliable information exchange becomes a challenge issue. This paper presents a cooperative detection method against Sybil attack. Our method adopts the reputation mechanism which relies on the observation exchange to differentiate Sybil identities from legitimate ones. To promote the observation exchange, we present a cooperative detection game with initial condition, which helps nodes be aware that with which to share the observations can bring the maximum utilities. The theoretical and numerical analysis indicate that only benign and unselfish nodes can be accepted by their rational neighbors while Sybil nodes are excluded from the information exchange.

Published in:

Communications (APCC), 2011 17th Asia-Pacific Conference on

Date of Conference:

2-5 Oct. 2011