多信道多用户认知无线网络中信道区间定价

K. Annapurna, B. Ramanjaneyulu
{"title":"多信道多用户认知无线网络中信道区间定价","authors":"K. Annapurna, B. Ramanjaneyulu","doi":"10.1109/icatcct.2017.8389151","DOIUrl":null,"url":null,"abstract":"Appropriate pricing of channel bandwidths that are allotted to secondary users is an important and challenging task in cognitive radio networks. It is usually carried out through the auctions held by the spectrum licensees themselves or by the designated third parties that collect the vacant channel information from the licensed users. In most of the standard auction methods, range of bidding prices can be very wide, with no restriction on maximum and minimum bidding values. This situation can create instability in channel pricing that can lead to underutilization of vacant bandwidths. An auction scheme, in which predefined maximum and minimum bid values can be used, is proposed in this work. It also proposes to offer reduction in allocation prices, based on the prevailing demand and supply of vacant channels, at various times. Simulation results indicate that the proposed scheme offers better performance in comparison with other existing auction methods, in supporting the Quality of Service (QoS) of cognitive radio users, and in stabilizing the pricing of channels.","PeriodicalId":123050,"journal":{"name":"2017 3rd International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)","volume":"205 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Range-bound pricing of channels in multichannel multiuser cognitive radio networks\",\"authors\":\"K. Annapurna, B. Ramanjaneyulu\",\"doi\":\"10.1109/icatcct.2017.8389151\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Appropriate pricing of channel bandwidths that are allotted to secondary users is an important and challenging task in cognitive radio networks. It is usually carried out through the auctions held by the spectrum licensees themselves or by the designated third parties that collect the vacant channel information from the licensed users. In most of the standard auction methods, range of bidding prices can be very wide, with no restriction on maximum and minimum bidding values. This situation can create instability in channel pricing that can lead to underutilization of vacant bandwidths. An auction scheme, in which predefined maximum and minimum bid values can be used, is proposed in this work. It also proposes to offer reduction in allocation prices, based on the prevailing demand and supply of vacant channels, at various times. Simulation results indicate that the proposed scheme offers better performance in comparison with other existing auction methods, in supporting the Quality of Service (QoS) of cognitive radio users, and in stabilizing the pricing of channels.\",\"PeriodicalId\":123050,\"journal\":{\"name\":\"2017 3rd International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)\",\"volume\":\"205 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 3rd International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/icatcct.2017.8389151\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 3rd International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/icatcct.2017.8389151","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在认知无线网络中,对分配给辅助用户的信道带宽进行合理定价是一项重要而富有挑战性的任务。通常是由频谱持牌人自己或由向持牌用户收集空置信道信息的指定第三方进行拍卖。在大多数标准拍卖方式中,投标价格的范围可以很广,没有最高和最低投标价值的限制。这种情况会造成频道定价的不稳定,从而导致空闲带宽的利用不足。提出了一种可以使用预定最高价和最低价的拍卖方案。它还建议在不同时期,根据空频道的普遍需求和供应,降低分配价格。仿真结果表明,该方案在支持认知无线电用户的服务质量(QoS)和稳定信道定价方面具有较好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Range-bound pricing of channels in multichannel multiuser cognitive radio networks
Appropriate pricing of channel bandwidths that are allotted to secondary users is an important and challenging task in cognitive radio networks. It is usually carried out through the auctions held by the spectrum licensees themselves or by the designated third parties that collect the vacant channel information from the licensed users. In most of the standard auction methods, range of bidding prices can be very wide, with no restriction on maximum and minimum bidding values. This situation can create instability in channel pricing that can lead to underutilization of vacant bandwidths. An auction scheme, in which predefined maximum and minimum bid values can be used, is proposed in this work. It also proposes to offer reduction in allocation prices, based on the prevailing demand and supply of vacant channels, at various times. Simulation results indicate that the proposed scheme offers better performance in comparison with other existing auction methods, in supporting the Quality of Service (QoS) of cognitive radio users, and in stabilizing the pricing of channels.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信