Non-identical objects auction for spectrum sharing in TV white spaces — The perspective of service providers as secondary users

Marcin Parzy, H. Bogucka
{"title":"Non-identical objects auction for spectrum sharing in TV white spaces — The perspective of service providers as secondary users","authors":"Marcin Parzy, H. Bogucka","doi":"10.1109/DYSPAN.2011.5936228","DOIUrl":null,"url":null,"abstract":"The paper considers a new spectrum sharing approach in TV white spaces (TVWS) areas using an auction of non-identical objects taking the bandwidth and power requirements of the secondary users into account. The commodity of the auction is the available frequency band with propagation-signal power limitations. These frequency resources available in TVWS may be distributed among the telecommunication operators and service providers of various types (called players) operating in a given area. The available spectrum-band may be divided into blocks having the same or different sizes and different maximum allowable power. The resource allocation problem in frequency and power domain has been defined as an optimization problem where maximum payoff of the central trading entity (called spectrum broker) is the optimization goal. The problem of the best matching of the players demands, their bids and the auction solution to the available spectrum-holes have been discussed and highlighted. In the auction solution the branch and cut technique, known from integer programming, was applied so the complexity of the optimization algorithm was reduced significantly. Simulations results are also provided.","PeriodicalId":119856,"journal":{"name":"2011 IEEE International Symposium on Dynamic Spectrum Access Networks (DySPAN)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Dynamic Spectrum Access Networks (DySPAN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DYSPAN.2011.5936228","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 33

Abstract

The paper considers a new spectrum sharing approach in TV white spaces (TVWS) areas using an auction of non-identical objects taking the bandwidth and power requirements of the secondary users into account. The commodity of the auction is the available frequency band with propagation-signal power limitations. These frequency resources available in TVWS may be distributed among the telecommunication operators and service providers of various types (called players) operating in a given area. The available spectrum-band may be divided into blocks having the same or different sizes and different maximum allowable power. The resource allocation problem in frequency and power domain has been defined as an optimization problem where maximum payoff of the central trading entity (called spectrum broker) is the optimization goal. The problem of the best matching of the players demands, their bids and the auction solution to the available spectrum-holes have been discussed and highlighted. In the auction solution the branch and cut technique, known from integer programming, was applied so the complexity of the optimization algorithm was reduced significantly. Simulations results are also provided.
电视白色空间频谱共享的非相同对象拍卖。服务提供商作为次要用户的观点
考虑到辅助用户的带宽和功率需求,提出了一种新的电视白空间(TVWS)频谱共享方法。拍卖的商品是具有传播信号功率限制的可用频带。在TVWS中可用的这些频率资源可以分布在在给定区域内运营的各种类型的电信运营商和服务提供商(称为播放器)之间。可用的频谱带可以分成具有相同或不同尺寸和不同最大允许功率的块。频域和功率域的资源分配问题被定义为一个以中央交易主体(频谱代理)收益最大化为优化目标的优化问题。讨论并强调了运营商需求的最佳匹配问题、他们的出价以及对可用频谱洞的拍卖解决方案。在拍卖方案中,采用了整数规划中的分支切割技术,大大降低了优化算法的复杂度。并给出了仿真结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信