The Community for Technology Leaders
RSS Icon
Issue No.05 - May (2013 vol.12)
pp: 885-894
Fan Wu , Shanghai Jiao Tong University, Shanghai
Nitin Vaidya , University of Illinois at Urbana-Champaign, Urbana
With the growing deployment of wireless communication technologies, radio spectrum is becoming a scarce resource. Thus, mechanisms to efficiently allocate the available spectrum are of interest. In this paper, we model the radio spectrum allocation problem as a sealed-bid reserve auction, and propose SMALL, which is a Strategy-proof Mechanism for radio spectrum ALLocation. Furthermore, we extend SMALL to adapt to multiradio spectrum buyers, which can bid for more than one radio. We evaluate SMALL with simulations. Simulation results show that SMALL has good performance in median to large scale spectrum auctions.
Cost accounting, Resource management, Interference, Wireless communication, Mobile computing, Channel allocation, FCC, auction, Wireless network, channel allocation, security, mechanism design
Fan Wu, Nitin Vaidya, "A Strategy-Proof Radio Spectrum Auction Mechanism in Noncooperative Wireless Networks", IEEE Transactions on Mobile Computing, vol.12, no. 5, pp. 885-894, May 2013, doi:10.1109/TMC.2012.55
[1] M. Alicherry, R. Bhatia, and L. Li, “Joint Channel Assignment and Routing for Throughput Optimization in Multi-Radio Wireless Mesh Networks,” Proc. ACM MobiCom, Sept. 2005.
[2] L. Anderegg and S. Eidenbenz, “Ad Hoc-VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad Hoc Networks with Selfish Agents,” Proc. ACM MobiCom, Sept. 2003.
[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,” Proc. ACM MobiHoc, Jun. 2003.
[4] M. Čagalj, S. Ganeriwal, I. Aad, and J.-P. Hubaux, “On Selfish Behavior in CSMA/CA Networks,” Proc. IEEE INFOCOM, Apr. 2005.
[5] D.C. Cox and D.O. Reudink, “Dynamic Channel Assignment in High Capacity Mobile Communication System,” Bell System Technical J., vol. 50, no. 6, pp. 1833-1857, 1971.
[6] S. Eidenbenz, G. Resta, and P. Santi, “COMMIT: A Sender-Centric Truthful and Energy-Efficient Routing Protocol for Ad Hoc Networks with Selfish Nodes,” Proc. 19th Int'l Parallel and Distributed Processing Symp. (IPDPS), Apr. 2005.
[7] Federal Communication Commission (FCC), http:/, 2012.
[8] M. Félegyházi, M. Čagalj, S.S. Bidokhti, and J.-P. Hubaux, “Non-Cooperative Multi-Radio Channel Allocation in Wireless Networks,” Proc. IEEE INFOCOM, May 2007.
[9] D. Fudenberg and J. Tirole, Game Theory. MIT Press, 1991.
[10] M.M. Halldórsson, J.Y. Halpern, L.E. Li, and V.S. Mirrokni, “On Spectrum Sharing Games,” Proc. 23rd Ann. ACM SIGACT-SIGOPS Symp. Principles of Distributed Computing (PODC), July 2004.
[11] Y.T. Hou, Y. Shi, and H.D. Sherali, “Optimal Spectrum Sharing for Multi-Hop Software Defined Radio Networks,” Proc. IEEE INFOCOM, May 2007.
[12] I. Katzela and M. Naghshineh, “Channel Assignment Schemes for Cellular Mobile Telecommunications: A Comprehensive Survey,” IEEE Personal Comm., vol. 3, no. 3, pp. 10-31, June 1996.
[13] M. Kodialam and T. Nandagopal, “Characterizing the Capacity Region in Multi-Radio Multi-Channel Wireless Mesh Networks,” Proc. ACM MobiCom, Sept. 2005.
[14] J. Konorski, “Multiple Access in Ad-Hoc Wireless LANs with Noncooperative Stations,” Proc. IFIP Second Int'l IFIP-TC6 Networking Conf. Networking Technologies, Services, and Protocols; Performance of Computer and Comm. Networks; and Mobile and Wireless Comm. (Networking '02), May 2002.
[15] P. Kyasanur and N. Vaidya, “A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver,” Proc. Second Int'l Conf. Quality of Service in Heterogeneous Wired/Wireless Networks (QShine), Aug. 2005.
[16] A.B. MacKenzie and S.B. Wicker, “Stability of Multipacket Slotted Aloha with Selfish Users and Perfect Information,” Proc. IEEE INFOCOM, Apr. 2003.
[17] A. Mas-Colell, M.D. Whinston, and J.R. Green, Microeconomic Theory. Oxford, 1995.
[18] A. Mishra, S. Banerjee, and W. Arbaugh, “Weighted Coloring Based Channel Assignment for WLANs,” ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 9, no. 3, pp. 19-31, 2005.
[19] A. Mishra, V. Brik, S. Banerjee, A. Srinivasan, and W. Arbaugh, “A Client-Driven Approach for Channel Management in Wireless LAN,” Proc. IEEE INFOCOM, Apr. 2006.
[20] N. Nie and C. Comaniciu, “Adaptive Channel Allocation Spectrum Etiquette for Cognitive Radio Networks,” Proc. IEEE First Int'l Symp. New Frontiers in Dynamic Spectrum Access Networks (DySPAN), Nov. 2005.
[21] M.J. Osborne and A. Rubenstein, A Course in Game Theory. MIT, 1994.
[22] B. Raman, “Channel Allocation in 802.11-Based Mesh Networks,” Proc. IEEE INFOCOM, Apr. 2006.
[23] A. Raniwala, K. Gopalan, and T. cker Chiueh, “Centralized Channel Assignment and Routing Algorithms for Multi-Channel Wireless Mesh Networks,” ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 8, no. 2, pp. 50-65, 2004.
[24] V. Srinivasan, P. Nuggehalli, C.-F. Chiasserini, and R. Rao, “Cooperation in Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM, Apr. 2003.
[25] H. Varian, “Economic Mechanism Design for Computerized Agents,” Proc. USENIX Workshop Electronic Commerce, 1995.
[26] W. Wang, S. Eidenbez, Y. Wang, and X.-Y. Li, “Ours-Optimal Unicast Routing Systems in Non-Cooperative Wireless Networks,” Proc. ACM MobiCom, Sept. 2006.
[27] W. Wang, X.-Y. Li, and Y. Wang, “Truthful Multicast in Selfish Wireless Networks,” Proc. ACM MobiCom, Sept. 2004.
[28] D.J.A. Welsh and M.B. Powell, “An Upper Bound for the Chromatic Number of a Graph and Its Application to Timetabling Problems,” The Computer J., vol. 10, no. 1, pp. 85-86, 1967.
[29] D.B. West, Introduction to Graph Theory, second ed. Prentice Hall, 1996.
[30] F. Wu, S. Zhong, and C. Qiao, “Globally Optimal Channel Assignment for Non-Cooperative Wireless Networks,” Proc. IEEE INFOCOM, Apr. 2008.
[31] W. Yue, “Analytical Methods to Calculate the Performance of a Cellular Mobile Radio Communication System with Hybrid Channel Assignment,” IEEE Trans. Vehicular Technology, vol. 40, no. 2, pp. 453-460, May 1991.
[32] 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,” Proc. ACM MobiCom, Sept. 2005.
[33] S. Zhong, J. Chen, and Y.R. Yang, “Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-Hoc Networks,” Proc. IEEE INFOCOM, Apr. 2003.
[34] S. Zhong and F. Wu, “On Designing Collusion-Resistant Routing Schemes for Non-Cooperative Wireless Ad Hoc Networks,” Proc. ACM MobiCom, Sept. 2007.
[35] X. Zhou, S. Gandhi, S. Suri, and H. Zheng, “eBay in the Sky: Strategy-Proof Wireless Spectrum Auctions,” Proc. ACM MobiCom, Sept. 2008.
[36] X. Zhou and H. Zheng, “TRUST: A General Framework for Truthful Double Spectrum Auctions,” Proc. IEEE INFOCOM, Apr. 2009.
[37] X. Zhou and H. Zheng, “Breaking Bidder Collusion in Large-Scale Spectrum Auctions,” Proc. ACM MobiHoc, June 2010.
29 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool