{"title":"SMASHER: a strategy-proof combinatorial auction mechanism for heterogeneous channel redistribution","authors":"Zhenzhe Zheng, Fan Wu, Guihai Chen","doi":"10.1145/2491288.2491330","DOIUrl":null,"url":null,"abstract":"Auction is believed to be an effective way to solve or relieve the problem of radio spectrum shortage, by dynamically redistributing idle wireless channels of primary users to secondary users. However, to design a practical channel auction mechanism, we have to consider five challenges, including strategy-proofness, channel spatial reusability, channel heterogeneity, bid diversity, and social welfare maximization. Unfortunately, none of the existing works fully considered the five design challenges. In this paper, we present the first in-depth study on the problem of dynamic channel redistribution by jointly considering the five design challenges, and present SMASHER, which is a Strategy-proof coMbinatorial Auction mechaniSm for HEterogeneous channel Redistribution. Our analyses show that SMASHER achieves both strategy-proofness and approximately efficient social welfare.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2491288.2491330","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16
Abstract
Auction is believed to be an effective way to solve or relieve the problem of radio spectrum shortage, by dynamically redistributing idle wireless channels of primary users to secondary users. However, to design a practical channel auction mechanism, we have to consider five challenges, including strategy-proofness, channel spatial reusability, channel heterogeneity, bid diversity, and social welfare maximization. Unfortunately, none of the existing works fully considered the five design challenges. In this paper, we present the first in-depth study on the problem of dynamic channel redistribution by jointly considering the five design challenges, and present SMASHER, which is a Strategy-proof coMbinatorial Auction mechaniSm for HEterogeneous channel Redistribution. Our analyses show that SMASHER achieves both strategy-proofness and approximately efficient social welfare.