A collusion-resistant routing scheme for noncooperative wireless ad hoc networks

Authors:
Sheng Zhong;Fan Wu
Affiliations:
Computer Science and Engineering Department, University at Buffalo, The State University of New York, Buffalo, NY;Electrical and Computer Engineering Department, University of Illinois at Urbana-Champaign, Urbana, IL and Computer Science and Engineering Department, University at Buffalo, The State University ...
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2010

Citing 26
Cited 1

Efficient identification and signatures for smart cards

CRYPTO '89 Proceedings on Advances in cryptology
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
Power optimization in routing protocols for wireless and mobile networks

Handbook of wireless networks and mobile 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
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
A high-throughput path metric for multi-hop wireless routing

Proceedings of the 9th annual international conference on Mobile computing and networking
Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents

Proceedings of the 9th annual international conference on Mobile computing and networking
ARC: an integrated admission and rate control framework for CDMA data networks based on non-cooperative games

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
Understanding packet delivery performance in dense wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Truthful multicast routing in selfish wireless networks

Proceedings of the 10th annual international conference on Mobile computing and networking
COMMIT: A Sender-Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks with Selfish Nodes

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques

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
Economic mechanism design for computerized agents

WOEC'95 Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1
DARWIN: distributed and adaptive reputation mechanism for wireless ad-hoc networks

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
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 game-theoretic multipath routing for video-streaming services over Mobile Ad Hoc Networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In wireless ad hoc networks, routing needs 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-resistant routing in noncooperative wireless ad hoc networks. 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 and prove that the total payment needed is bounded. In addition, we propose a cryptographic method that prevents profit transfer among colluding nodes, as long as they do not fully trust each other unconditionally. This method makes our scheme widely applicable in practice. Experiments show that our solution is collusion-resistant and has good performance.