Paper Info
Title
Reputation Measure for Incentive-Compatible Packet Forwarding in Ad Hoc Networks
Abstract
Ad hoc networks are usually made of selfish mobile nodes which act to meet the benefit of themselves. A mass of researches have carried out to overcome the problems in these selfish networks, including packet forwarding. A class of reputation based schemes has been proposed for the problem, but almost all of them ignore the incentive compatibility of punishment. Punishing a noncooperative actor always costs the punisher a number of resources, which can cause second-ordered free riding that selfish nodes should free ride the punisher by acting cooperatively unconditionally and avoid the cost of punishment. The paper discusses this problem for packet forwarding in ad hoc networks and proposes two solutions based on second-ordered reputation, one is called probabilistic service assignment rule and the other is called proportional assignment rule. When network load is high, only the first one is effective.
Year
DOI
Venue
2009
10.1109/CIS.2009.268
CIS (1)
Keywords
Field
DocType
noncooperative actor,reputation measure scheme,packet forwarding,reputation,second-ordered free riding,network load,punishment cost,reputation measure,incentive compatibility,selfish mobile nodes,mobile radio,selfish network,probabilistic service assignment rule,incentive-compatible packet forwarding,telecommunication network routing,ad hoc networks,selfish mobile node,selfish node,second-ordered reputation,proportional assignment rule,bandwidth,data mining,probabilistic logic,mobile ad hoc networks,free riding,ad hoc network,second order
Mobile ad hoc network,Mobile radio,Incentive compatibility,Computer security,Computer science,Computer network,Free riding,Wireless ad hoc network,Probabilistic logic,Packet forwarding,Reputation
Conference
Volume
ISBN
Citations 
1
978-1-4244-5411-2
0
PageRank 
References 
Authors
0.34
5
2
Name
Order
Citations
PageRank
Kun Yu1387.33
Yunyang Yan232.82