{"title":"异构信道频谱共享的保留价格拍卖","authors":"M. Khaledi, A. Abouzeid","doi":"10.1109/ICCCN.2013.6614090","DOIUrl":null,"url":null,"abstract":"Cognitive radio is a novel communication paradigm that can significantly improve spectrum utilization by allowing the cognitive radio users to dynamically utilize the licensed spectrum. To achieve this, studying efficient spectrum allocation mechanisms is imperative. In this paper, we consider a cognitive radio network consisting of a primary spectrum owner (PO), multiple primary users (PU) and multiple secondary users (SU). We propose a reserve price auction mechanism for spectrum sharing in cognitive radio networks where the SUs bid to buy spectrum bands from the PO who acts as the auctioneer, selling idle spectrum bands to make a profit. Unlike most existing auction mechanisms that assume identical channels, we consider a more general and more realistic case where channels have different qualities. Also, SUs are allowed to express their preferences for each channel separately. That is, each SU submits a vector of bids, one for each channel. In addition, reservation prices that are proportional to channel qualities are imposed by the PO. The proposed auction mechanism results in efficient allocation that maximizes SUs' valuations subject to reserve price constraints, and it has desired economic properties that we formally prove in the analysis. Numerical results show performance improvements compared to the case of reserve price auction with identical channels and the case of having no reservation prices.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A Reserve Price Auction for Spectrum Sharing with Heterogeneous Channels\",\"authors\":\"M. Khaledi, A. Abouzeid\",\"doi\":\"10.1109/ICCCN.2013.6614090\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cognitive radio is a novel communication paradigm that can significantly improve spectrum utilization by allowing the cognitive radio users to dynamically utilize the licensed spectrum. To achieve this, studying efficient spectrum allocation mechanisms is imperative. In this paper, we consider a cognitive radio network consisting of a primary spectrum owner (PO), multiple primary users (PU) and multiple secondary users (SU). We propose a reserve price auction mechanism for spectrum sharing in cognitive radio networks where the SUs bid to buy spectrum bands from the PO who acts as the auctioneer, selling idle spectrum bands to make a profit. Unlike most existing auction mechanisms that assume identical channels, we consider a more general and more realistic case where channels have different qualities. Also, SUs are allowed to express their preferences for each channel separately. That is, each SU submits a vector of bids, one for each channel. In addition, reservation prices that are proportional to channel qualities are imposed by the PO. The proposed auction mechanism results in efficient allocation that maximizes SUs' valuations subject to reserve price constraints, and it has desired economic properties that we formally prove in the analysis. Numerical results show performance improvements compared to the case of reserve price auction with identical channels and the case of having no reservation prices.\",\"PeriodicalId\":207337,\"journal\":{\"name\":\"2013 22nd International Conference on Computer Communication and Networks (ICCCN)\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 22nd International Conference on Computer Communication and Networks (ICCCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2013.6614090\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2013.6614090","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Reserve Price Auction for Spectrum Sharing with Heterogeneous Channels
Cognitive radio is a novel communication paradigm that can significantly improve spectrum utilization by allowing the cognitive radio users to dynamically utilize the licensed spectrum. To achieve this, studying efficient spectrum allocation mechanisms is imperative. In this paper, we consider a cognitive radio network consisting of a primary spectrum owner (PO), multiple primary users (PU) and multiple secondary users (SU). We propose a reserve price auction mechanism for spectrum sharing in cognitive radio networks where the SUs bid to buy spectrum bands from the PO who acts as the auctioneer, selling idle spectrum bands to make a profit. Unlike most existing auction mechanisms that assume identical channels, we consider a more general and more realistic case where channels have different qualities. Also, SUs are allowed to express their preferences for each channel separately. That is, each SU submits a vector of bids, one for each channel. In addition, reservation prices that are proportional to channel qualities are imposed by the PO. The proposed auction mechanism results in efficient allocation that maximizes SUs' valuations subject to reserve price constraints, and it has desired economic properties that we formally prove in the analysis. Numerical results show performance improvements compared to the case of reserve price auction with identical channels and the case of having no reservation prices.