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
Stimulating cooperation in self-organizing mobile ad hoc networks
Mobile Networks and Applications
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
Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
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
The capacity of wireless networks
IEEE Transactions on Information Theory
Self organization in mobile ad hoc networks: the approach of Terminodes
IEEE Communications Magazine
DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Stimulating cooperation in route discovery of ad hoc networks
Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks
Proceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Optimal forwarding for wireless ad hoc networks with game theory
International Journal of Autonomous and Adaptive Communications Systems
Distributed resource allocation algorithms for peer-to-peer networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
A secure credit-based cooperation stimulating mechanism for MANETs using hash chains
Future Generation Computer Systems
Game theoretic packet relaying model for wireless ad hoc networks
International Journal of Communication Networks and Distributed Systems
Achieving cooperative spectrum sensing in wireless cognitive radio networks
ACM SIGMOBILE Mobile Computing and Communications Review
Modeling misbehavior in cooperative diversity: a dynamic game approach
EURASIP Journal on Advances in Signal Processing - Special issue on game theory in signal processing and communications
Cooperation in ad hoc networks with noisy channels
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Coexistence with malicious nodes: a game theoretic approach
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Emergency connectivity in ad-hoc networks with selfish nodes
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Cooperative ARQ via auction-based spectrum leasing
IEEE Transactions on Communications
Stimulating cooperation in multi-hop wireless networks using cheating detection system
INFOCOM'10 Proceedings of the 29th conference on Information communications
Detection of selfish nodes in networks using CoopMAC protocol with ARQ
IEEE Transactions on Wireless Communications
Sequential detection of misbehaving nodes in cooperative networks with HARQ
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Dynamic spectrum access and management
IEEE Wireless Communications
A game theoretic trust model for on-line distributed evolution of cooperation inMANETs
Journal of Network and Computer Applications
Perspectives of selfish behaviour in mobile ad hoc networks
NMA'10 Proceedings of the 7th international conference on Numerical methods and applications
Solving soft security problem in MANETs using an evolutionary approach
SIIS'11 Proceedings of the 2011 international conference on Security and Intelligent Information Systems
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
In a multihop wireless network, routing a packet from source to destination requires cooperation among nodes. If nodes are selfish, reputation-based mechanisms can be used to sustain cooperation without resorting to a central authority. Within a hop-by-hop reputation-based mechanism, every node listens to its relaying neighbors, and the misbehaving ones are punished by dropping a fraction of their packets, according to a Tit-for-tat strategy. Packet collisions may prevent a node from recognizing a correct transmission, distorting the evaluated reputation. Therefore, even if all the nodes are willing to cooperate, the retaliation triggered by a perceived defection may eventually lead to zero throughput. A classical solution to this problem is to add a tolerance threshold to the pure Tit-for-tat strategy, so that a limited number of defections will not be punished. In this paper, we propose a game-theoretic model to study the impact of collisions on a hop-by-hop reputation-based mechanism for regular networks with uniform random traffic. Our results show that the Nash Equilibrium of a Generous Tit-for-tat strategy is cooperative for any admissible load, if the nodes are sufficiently far-sighted, or equivalently if the value for a packet to the nodes is sufficiently high with respect to the transmission cost. We also study two more severe punishment schemes, namely One-step Trigger and Grim Trigger, that can achieve cooperation under milder conditions.