Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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
Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
A charging and rewarding scheme for packet forwarding in multi-hop cellular networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Proceedings of the 9th annual international conference on Mobile computing and networking
Proceedings of the 9th annual international conference on Mobile computing and networking
Equilibria in topology control games for ad hoc networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Stimulating cooperation in self-organizing mobile ad hoc networks
Mobile Networks and Applications
Truthful multicast routing in selfish wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Proceedings of the 11th annual international conference on Mobile computing and networking
Low-Cost Routing in Selfish and Rational Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
OURS: optimal unicast routing systems in non-cooperative wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Foundations of Cryptography: Volume 1
Foundations of Cryptography: Volume 1
Designated verifier proofs and their applications
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
A joint selfish routing and channel assignment game in wireless mesh networks
Computer Communications
Incentive-compatible opportunistic routing for wireless networks
Proceedings of the 14th ACM international conference on Mobile computing and networking
OMH: suppressing selfish behavior in ad hoc networks with One More Hop
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
A Coalitional Game Model for Heat Diffusion Based Incentive Routing and Forwarding Scheme
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
COFFEE: a context-free protocol for stimulating data forwarding in wireless ad hoc networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
OMH--Suppressing Selfish Behavior in Ad hoc Networks with One More Hop
Mobile Networks and Applications
INPAC: an enforceable incentive scheme for wireless networks using network coding
INFOCOM'10 Proceedings of the 29th conference on Information communications
An optimal, strategy-proof scheme for multi-path traffic assignment in non-cooperative networks
IEEE Transactions on Wireless Communications
A mathematical framework for analyzing adaptive incentive protocols in P2P networks
IEEE/ACM Transactions on Networking (TON)
CRISP: collusion-resistant incentive-compatible routing and forwarding in opportunistic networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Cross-layer metrics for reliable routing in wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
Personal and Ubiquitous Computing
| Hi-index | 0.00 |
In wireless ad hoc networks, routing requires cooperation of nodes. Since nodes often belong to different users, it is highly important to provide incentives for them to cooperate. However, most existing studies of the incentive-compatible routing problem focus on individual nodes' incentives, assuming that no subset of them would collude. Clearly, this assumption is not always valid. In this paper, we present a systematic study of collusion resistance in incentive-compatible routing schemes. In particular, we consider two standard solution concepts for collusion resistance in game theory, namely Group Strategyproofness and Strong Nash Equilibrium. We show that achieving Group Strategyproofness is impossible while achieving Strong Nash Equilibrium is possible. More specifically, we design a scheme that is guaranteed to converge to a Strong Nash Equilibrium. In addition, we give a cryptographic method that prevents profit transfer between colluding nodes, as long as they do not fullytrust each other unconditionally. This method makes our scheme widely applicable in practice. Experiments show that our solution is collusion-resistant and has good performance.