ALETHEIA: Robust Large-Scale Spectrum Auctions against False-name Bids

Auction is a promising approach for dynamic spectrum access in cognitive radio networks. Existing auction mechanisms are mainly strategy-proof to stimulate bidders to reveal their valuations of spectrum truthfully. However, they can suffer significantly from a new cheating pattern, named false-name bids, where a bidder can manipulate the auction by submitting bids under multiple fictitious names. We show such false-name bid cheating is easy to make but difficult to detect in dynamic spectrum auctions. To address this issue, we propose ALETHEIA, a novel flexible, false-name-proof auction framework for large-scale dynamic spectrum access. ALETHEIA not only guarantees strategy-proofness but also resists false-name bids. Moreover, ALETHEIA enables spectrum reuse across a large number of bidders, to improve spectrum utilization. Following that, we extend ALETHEIA to its general version that supports more practical and flexible auction, where bidders accept the spectrum allocation under their partial satisfactions. Theoretical analysis and simulation results show that ALETHEIA achieves both high spectrum redistribution efficiency and auction efficiency.

[1]  Song Guo,et al.  Robust Large-Scale Spectrum Auctions against False-Name Bids , 2017, IEEE Trans. Mob. Comput..

[2]  Mingyan Liu,et al.  Revenue generation for truthful spectrum auction in dynamic spectrum access , 2009, MobiHoc '09.

[3]  Makoto Yokoo,et al.  The effect of false-name bids in combinatorial auctions: new fraud in internet auctions , 2004, Games Econ. Behav..

[4]  Makoto Yokoo,et al.  False-Name-Proof Multi-unit Auction Protocol Utilizing Greedy Allocation Based on Approximate Evaluation Values , 2002, PRIMA.

[5]  Ilya Segal,et al.  Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green , 1997 .

[6]  T. Charles Clancy,et al.  Security in Cognitive Radio Networks: Threats and Mitigation , 2008, 2008 3rd International Conference on Cognitive Radio Oriented Wireless Networks and Communications (CrownCom 2008).

[7]  Makoto Yokoo,et al.  Robust Combinatorial Auction Protocol against False-Name Bids , 2000, AAAI/IAAI.

[8]  Koichi Yamazaki,et al.  A note on greedy algorithms for the maximum weighted independent set problem , 2003, Discret. Appl. Math..

[9]  Makoto Yokoo,et al.  The effect of false-name declarations in mechanism design: towards collective decision making on the Internet , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[10]  Fan Wu,et al.  SMALL: A Strategy-proof Mechanism for radio spectrum allocation , 2011, 2011 Proceedings IEEE INFOCOM.

[11]  Makoto Yokoo,et al.  Characterizing false-name-proof allocation rules in combinatorial auctions , 2009, AAMAS.

[12]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[13]  Makoto Yokoo,et al.  Robust Multi-unit Auction Protocol against False-name Bids , 2001, IJCAI.

[14]  Mahmoud Al-Ayyoub,et al.  Truthful spectrum auctions with approximate revenue , 2011, 2011 Proceedings IEEE INFOCOM.

[15]  Dan McCloskey,et al.  Chicago spectrum occupancy measurements & analysis and a long-term studies proposal , 2006, TAPAS '06.

[16]  Ellen W. Zegura,et al.  Utility max-min: an application-oriented bandwidth allocation scheme , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[17]  Shamik Sengupta,et al.  Sustenance against RL-Based Sybil Attacks in Cognitive Radio Networks Using Dynamic Reputation System , 2013, MILCOM 2013 - 2013 IEEE Military Communications Conference.

[18]  Xia Zhou,et al.  TRUST: A General Framework for Truthful Double Spectrum Auctions , 2009, IEEE INFOCOM 2009.

[19]  Makoto Yokoo,et al.  Robust double auction protocol against false-name bids , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[20]  K. J. Ray Liu,et al.  A scalable collusion-resistant multi-winner cognitive spectrum auction game , 2009, IEEE Transactions on Communications.

[21]  A. Mas-Colell,et al.  Microeconomic Theory , 1995 .

[22]  Xia Zhou,et al.  eBay in the Sky: strategy-proof wireless spectrum auctions , 2008, MobiCom '08.

[23]  David H. Reiley,et al.  Demand Reduction in Multi-Unit Auctions with Varying Numbers of Bidders: Theory and Evidence from a Field Experiment , 2006 .

[24]  Ian F. Akyildiz,et al.  NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey , 2006, Comput. Networks.

[25]  Paul Klemperer,et al.  Auctions: Theory and Practice , 2004 .

[26]  Song Guo,et al.  A Truthful QoS-Aware Spectrum Auction with Spatial Reuse for Large-Scale Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

[27]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.

[28]  Noam Nisan,et al.  Incentive compatible multi unit combinatorial auctions , 2003, TARK '03.

[29]  Kai Hong,et al.  Spectrum Stealing via Sybil Attacks in DSA Networks: Implementation and Defense , 2011, 2011 IEEE International Conference on Communications (ICC).

[30]  Xia Zhou,et al.  Breaking bidder collusion in large-scale spectrum auctions , 2010, MobiHoc '10.

[31]  John A. List,et al.  Demand Reduction in Multi-unit Auctions with Varying Numbers of Bidders: Theory and Field Experiments , 1999 .

[32]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.