Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Enforcing service availability in mobile ad-hoc WANs
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks
Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
Proceedings of the 9th annual international conference on Mobile computing and networking
Stimulating cooperation in self-organizing mobile ad hoc networks
Mobile Networks and Applications
Moderately hard, memory-bound functions
ACM Transactions on Internet Technology (TOIT)
A Reputation-based Mechanism for Isolating Selfish Nodes in Ad Hoc Networks
MOBIQUITOUS '05 Proceedings of the The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Achieving cooperation in multihop wireless networks of selfish nodes
GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
Sustaining cooperation in multi-hop wireless networks
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Tamper resistance: a cautionary note
WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
New directions in cryptography
IEEE Transactions on Information Theory
A game theoretic trust model for on-line distributed evolution of cooperation inMANETs
Journal of Network and Computer Applications
Competition between wireless service providers sharing a radio resource
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Hi-index | 0.00 |
In wireless ad hoc networks one way to incentivize nodes to forward other nodes' packets is through the use of reputation mechanisms, where cooperation is induced by the threat of partial or total network disconnection if a node acts selfishly. The problem is that packet collisions and interference may make cooperative nodes appear selfish sometimes, generating unnecessary and unwanted punishments. With the use of a simple network model we first study the performance of some proposed reputation strategies and then present a new mechanism called DARWIN (Distributed and Adaptive Reputation mechanism for Wireless ad hoc Networks), where we try to avoid retaliation situations after a node is falsely perceived as selfish to help restore cooperation quickly. Using game theory, we prove that our mechanism is robust to imperfect measurements, is collusion-resistant and can achieve full cooperation among nodes. Simulations are presented to complement our theoretical analysis and evaluate the performance of our algorithm compared to other proposed reputation strategies.