DocumentCode
1528194
Title
FITS: A Finite-Time Reputation System for Cooperation in Wireless Ad Hoc Networks
Author
Chen, Tingting ; Wu, Fan ; Zhong, Sheng
Author_Institution
Dept. of Comput. Sci. & Eng., State Univ. of New York at Buffalo, Amherst, NY, USA
Volume
60
Issue
7
fYear
2011
fDate
7/1/2011 12:00:00 AM
Firstpage
1045
Lastpage
1056
Abstract
A wireless ad hoc network does not have an infrastructure, and thus, needs the cooperation of nodes in forwarding other nodes´ packets. Reputation system is an effective approach to give nodes incentives to cooperate in packet forwarding. However, existing reputation systems either lack rigorous analysis, or have analysis in unrealistic models. In this paper, we propose FITS, the first reputation system that has rigorous analysis and guaranteed incentive compatibility in a practical model. FITS has two schemes: the first scheme is very simple, but needs a Perceived Probability Assumption (PPA); the second scheme uses more sophisticated techniques to remove the need for PPA. We show that both of these two FITS schemes have a subgame perfect Nash equilibrium in which the packet forwarding probability of every node is one. Experimental results verify that FITS provides strong incentives for nodes to cooperate.
Keywords
ad hoc networks; game theory; finite-time reputation system; incentive compatibility; node incentives; node packets; packet forwarding probability; perceived probability assumption; subgame perfect Nash equilibrium; wireless ad hoc network; Analytical models; Computational modeling; Data communication; Games; History; Interference; Mobile ad hoc networks; Keywords ad hoc networks; incentive compatibility; packet forwarding.; routing;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.2010.162
Filename
5499460
Link To Document