Article

On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks

Authors:

Fan WuAuthors Info & Claims

MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and networking

Pages 278 - 289

https://doi.org/10.1145/1287853.1287887

Published: 09 September 2007 Publication History

Abstract

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.

References

[1]

A. Akella, S. Seshan, R. Karp, and S. Shenker. Selfish behavior and stability of the internet: Game-theoretic analysis of TCP. In Proceedings of the Special Interest Group on Data Communication (SIGCOMM), Pittsburgh, PA, August 2002.

Digital Library

[2]

L. Anderegg and S. Eidenbenz. Ad hoc-VCG: a Truthful and Cost-Efficient Routing Protocol for Mobile Ad Hoc Networks With Selfish Agents. In Proceedings of the Ninth International Conference on Mobile Computing and Networking (MobiCom), San Diego, CA, Sep. 2003.

Digital Library

[3]

N. Ben Salem, L. Buttyan, J. P. Hubaux, and M. Jakobsson. A charging and rewarding scheme for packet forwarding in multi-hop cellular networks. In Proceedings of the Fourth ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), Annapolis, MD, Jun. 2003.

Digital Library

[4]

S. Buchegger and J.-Y. Le Boudec. Nodes bearing grudges: Towards routing security, fairness, and robustness in mobile ad hoc networks. In Proceedings of the Tenth Euromicro Workshop on Parallel, Distributed and Network-based Processing (EUROMICRO-PDP), Canary Islands, Spain, Jan. 2002.

Digital Library

[5]

S. Buchegger and J.-Y. Le Boudec. Performance analysis of the CONFIDANT protocol (Cooperation of nodes: fairness in dynamic ad-hoc networks). In Proceedings of the Third ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), Lausanne, Switzerland, Jun. 2002.

Digital Library

[6]

L. Buttyan and J. P. Hubaux. Enforcing service availability in mobile ad-hoc WANs. In Proceedings of the First ACM Workshop on Mobile Ad Hoc Networking and Computing (MobiHoc), Boston, Massachusetts, Aug. 2000.

Digital Library

[7]

L. Buttyan and J. P. Hubaux. Stimulating cooperation in self-organizing mobile ad hoc networks. ACM Journal for Mobile Networks (MONET), special issue on Mobile Ad Hoc Networks, summer 2002.

Digital Library

[8]

S. Eidenbenz, V. S. A. Kumar, and S. Zust. Equilibria in topology control games for ad hoc networks. In Proceedings of the 2003 Joint Workshop on Foundations of Mobile Computing, pages 2-11, 2003.

Digital Library

[9]

S. Eidenbenz, G. Resta, and P. Santi. Commit: A sender-centric truthful and energy-efficient routing protocol for ad hoc networks with selfish nodes. In Proceedings of 5th IEEE International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (IPDPS), Apr. 2005.

Digital Library

[10]

J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker. A BGP-based mechanism for lowest-cost routing. In Proceedings of the 21st Symposium on Principles of Distributed Computing, pages 173--182, Monterey, CA, Jul. 2002.

Digital Library

[11]

J. Feigenbaum and S. Shenker. Distributed algorithmic mechanism design: Recent results and future directions. In Proceedings of the Sixth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), pages 1--13. ACM Press, Sep. 2002.

Digital Library

[12]

M. Felegyhazi and J.-P. Hubaux. Wireless operators in a shared spectrum. In Proceedings of the 25th Conference on Computer Communications (INFOCOM), Barcelona, Spain, Apr. 2006.

[13]

O. Goldreich. Foundations of Cryptography: Volume 1, Basic Tools. Cambridge University Press, Aug. 2001.

Digital Library

[14]

K. Jain and V. V. Vazirani. Group strategyproofness and no subsidy via lp-duality, 2002.

[15]

M. Jakobsson, J. P. Hubaux, and L. Buttyan. A micropayment scheme encouraging collaboration in multi-hop cellular networks. In Proceedings of Financial Crypto 2003, volume 2742, pages 15--33, 2003.

[16]

M. Jakobsson, K. Sako, and R. Impagliazzo. Designated verifier proofs and their applications. In Advances in Cryptology - Eurocrypt '96, volume 1070, pages 143--154, Berlin, 1996.

Digital Library

[17]

H. Lin, M. Chatterjee, S. K. Das, and K. Basu. ARC: An integrated admission and rate control framework for CDMA data networks based on non-cooperative games. In Proceedings of the Ninth International Conference on Mobile Computing and Networking (MobiCom), pages 326--338, San Diego, CA, Sep. 2003.

Digital Library

[18]

S. Marti, T. Giuli, K. Lai, and M. Baker. Mitigating routing misbehavior in mobile ad hoc networks. In Proceedings of the Sixth International Conference on Mobile Computing and Networking (MobiCom), Boston, MA, Aug. 2000.

Digital Library

[19]

A. Mas-Colell, M. D. Whinston, and J. R. Green. Microeconomic Theory. Oxford Press, 1995.

[20]

H. Moulin and S. Shenker. Strategyproof sharing of submodular costs: Budget balance versus efficiency. In Economic Theory, 2002.

[21]

N. Nisan and A. Ronen. Algorithmic mechanism design. Games and Economic Behavior, 35:166--196, 2001.

[22]

C. Papadimitriou. Algorithms, games, and the Internet. In Proceedings of the 33rd Annual Symposium on Theory of Computing, pages 749--753, Heraklion, Crete, Greece, Jul. 2001.

Digital Library

[23]

C. Schnorr. Efficient signature generation for smart cards. In Advances in Cryptology - CRYPTO '89, pages 239--252. Springer-Verlag, 1990.

Digital Library

[24]

V. Srinivasan, P. Nuggehalli, C.-F. Chiasserini, and R. Rao. Cooperation in wireless ad hoc networks. In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), San Francisco, CA, Apr. 2003.

[25]

W. Wang, S. Eidenbez, Y. Wang, and X.-Y. Li. OURS: Optimal unicast routing systems in non-cooperative wireless networks. In Proceedings of The Twelfth International Conference on Mobile Computing and Networking (MobiCom), Los Angeles, CA, Sep. 2006.

Digital Library

[26]

W. Wang and X.-Y. Li. Low-cost routing in selfish and rational wireless ad hoc networks. IEEE Transactions on Mobile Computing, 5(5):596--607, 2006.

Digital Library

[27]

W. Wang, X.-Y. Li, and Y. Wang. Truthful multicast routing in selfish wireless networks. In Proceedings of the Tenth International Conference on Mobile Computing and Networking (MobiCom), pages 245--259, New York, NY, USA, Sep. 2004. ACM Press.

Digital Library

[28]

S. Zhong, J. Chen, and Y. R. Yang. Sprite, a simple, cheat-proof, credit-based system for mobile ad-hoc networks. In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), San Francisco, CA, Apr. 2003.

[29]

S. Zhong, L. E. Li, Y. G. Liu, and Y. R. Yang. On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks - an integrated approach using game theoretical and cryptographic techniques. In Proceedings of The 11th International Conference on Mobile Computing and Networking (MobiCom), Cologne, Germany, Sep. 2005.

Digital Library

Cited By

Srikaanth PNagarajan V(2021)Fuzzy Rough Set Derived Probabilistic Variable Precision-Based Mitigation Technique for Vampire Attack in MANETsWireless Personal Communications10.1007/s11277-021-08673-zOnline publication date: 9-Jul-2021
https://doi.org/10.1007/s11277-021-08673-z
Yang SPeng DMeng TWu FChen GTang SLi ZLuo T(2019)On Designing Distributed Auction Mechanisms for Wireless Spectrum AllocationIEEE Transactions on Mobile Computing10.1109/TMC.2018.286986318:9(2129-2146)Online publication date: 1-Sep-2019
https://doi.org/10.1109/TMC.2018.2869863
Zhan YXia YZhang JWang Y(2018)Incentive Mechanism Design in Mobile Opportunistic Data Collection With Time SensitivityIEEE Internet of Things Journal10.1109/JIOT.2017.27791765:1(246-256)Online publication date: Feb-2018
https://doi.org/10.1109/JIOT.2017.2779176
Show More Cited By

Index Terms

On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks
1. Networks
  1. Network types
    1. Mobile networks
    2. Wireless access networks

Recommendations

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

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 ...
A cooperative approach to collusion in auctions

The elegant Vickrey Clarke Groves (VCG) mechanism is well-known for the strong properties it offers: dominant truth-revealing strategies, efficiency and weak budget-balance in quite general settings. Despite this, it suffers from several drawbacks, ...
Truthful multicast routing in selfish wireless networks
MobiCom '04: Proceedings of the 10th annual international conference on Mobile computing and networking

In wireless networks, it is often assumed that each individual wireless terminal will faithfully follow the prescribed protocols without any deviation-- except, perhaps, for a few faulty or malicious ones. Wireless terminals, when owned by individual ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and networking

September 2007

370 pages

ISBN:9781595936813

DOI:10.1145/1287853

General Chair:
Evangelos Kranakis
Carleton University, Canada
,
Program Chairs:
Jennifer Hou
University of Illinois, Urbana-Champaign, USA
,
Ram Ramanathan
BBN Technologies, USA

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 September 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

MobiCom/MobiHoc '07

Sponsor:

MobiCom/MobiHoc '07: The Thirteenth Annual International Conference on Mobile Computing and Networking and The 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing

September 9 - 14, 2007

Québec, Montréal, Canada

Acceptance Rates

Overall Acceptance Rate 440 of 2,972 submissions, 15%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

53
Total Citations
View Citations
1,072
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 21 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Srikaanth PNagarajan V(2021)Fuzzy Rough Set Derived Probabilistic Variable Precision-Based Mitigation Technique for Vampire Attack in MANETsWireless Personal Communications10.1007/s11277-021-08673-zOnline publication date: 9-Jul-2021
https://doi.org/10.1007/s11277-021-08673-z
Yang SPeng DMeng TWu FChen GTang SLi ZLuo T(2019)On Designing Distributed Auction Mechanisms for Wireless Spectrum AllocationIEEE Transactions on Mobile Computing10.1109/TMC.2018.286986318:9(2129-2146)Online publication date: 1-Sep-2019
https://doi.org/10.1109/TMC.2018.2869863
Zhan YXia YZhang JWang Y(2018)Incentive Mechanism Design in Mobile Opportunistic Data Collection With Time SensitivityIEEE Internet of Things Journal10.1109/JIOT.2017.27791765:1(246-256)Online publication date: Feb-2018
https://doi.org/10.1109/JIOT.2017.2779176
Balaji Srikaanth PNagarajan V(2018)A Fuzzy Trust Relationship Perspective-Based Prevention Mechanism for Vampire Attack in MANETsWireless Personal Communications: An International Journal10.1007/s11277-018-5691-8101:1(339-357)Online publication date: 1-Jul-2018
https://dl.acm.org/doi/10.1007/s11277-018-5691-8
Ji SChen T(2017)On Designing Collusion-Resistant Incentive Mechanisms for Mobile Crowdsensing Systems2017 IEEE Trustcom/BigDataSE/ICESS10.1109/Trustcom/BigDataSE/ICESS.2017.233(162-169)Online publication date: Aug-2017
https://doi.org/10.1109/Trustcom/BigDataSE/ICESS.2017.233
Kumar SDutta K(2016)Securing Mobile Ad Hoc NetworksInternational Journal of Handheld Computing Research10.4018/IJHCR.20160101037:1(26-76)Online publication date: Jan-2016
https://doi.org/10.4018/IJHCR.2016010103
Ji SChen T(2016)Incentive Mechanisms for Discretized Mobile CrowdsensingsIEEE Transactions on Wireless Communications10.1109/TWC.2015.246872415:1(146-161)Online publication date: 7-Jan-2016
https://dl.acm.org/doi/10.1109/TWC.2015.2468724
Zhan YLiu YXia YYan LLi FZhou NWu H(2016)Incentive Mechanism for Crowdsourced Mobile Video Offloading2016 12th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)10.1109/MSN.2016.051(279-283)Online publication date: Dec-2016
https://doi.org/10.1109/MSN.2016.051
Wu FWei ZWu CChen GSheng B(2015)Incentive-compatible adaptive-width channel allocation for non-cooperative wireless networksInternational Journal of Sensor Networks10.1504/IJSNET.2015.07039918:3/4(227-237)Online publication date: 1-Jul-2015
https://dl.acm.org/doi/10.1504/IJSNET.2015.070399
Wu FGong KZhang TChen GQiao C(2015)COMO: A Game-Theoretic Approach for Joint Multirate Opportunistic Routing and Forwarding in Non-Cooperative Wireless NetworksIEEE Transactions on Wireless Communications10.1109/TWC.2014.236291414:2(948-959)Online publication date: Feb-2015
https://doi.org/10.1109/TWC.2014.2362914
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents