By Topic

A finite-state-model scheme for efficient cooperation enforcement in mobile 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

4 Author(s)
Ning Jiang ; Sch. of Comput. Sci., Central Florida Univ., Orlando, FL, USA ; Sheu, S. ; Hua, K.A. ; Onur Ozyer

Operations of mobile ad hoc networks rely on the collaboration of participating nodes to route data for each other. Most of existing cooperation-enforcement techniques employ a reputation mechanism, based on which misbehaving nodes are detected, avoided and penalized. This strategy incurs substantial overhead, and suffers from various attacks. To avoid these drawbacks, we consider in this paper a new approach that employs a finite state model. With this technique, m is behaving node detection is performed on-demand; and malicious node punishment and avoidance are accomplished by only maintaining reputation information within neighboring nodes. This approach greatly simplifies the collaboration enforcement process, incurs little overhead and is robust against various evasive behaviors. Simulation results based on various system configurations indicate that the proposed technique significantly improves network performance.

Published in:

Parallel and Distributed Systems, 2005. Proceedings. 11th International Conference on  (Volume:1 )

Date of Conference:

20-22 July 2005