认知无线电网络中的分布式频谱共享算法

Wei Sun, Jiadi Yu, Tong Liu
{"title":"认知无线电网络中的分布式频谱共享算法","authors":"Wei Sun, Jiadi Yu, Tong Liu","doi":"10.1109/PADSW.2014.7097848","DOIUrl":null,"url":null,"abstract":"In this paper we study a social welfare maximization problem for spectrum sharing in cognitive radio networks. To fully use the spectrum resource, the spectrum owned by the licensed primary user (PU) can be leased to secondary users (SUs) for transmitting data. We first formulate the social welfare of a cognitive radio network, considering the cost for the primary user sharing spectrum and the utility gained for secondary users transmitting data. The social welfare maximization is a convex optimization, which can be solved by standard methods in a centralized manner. However, the utility function of each secondary user always contains the private information, which leads to the centralized methods disabled. To overcome this challenge, we propose an iterative distributed algorithm based on a pricing-based decomposition framework. It is theoretically proved that our proposed algorithm converges to the optimal solution. Numerical simulation results are presented to show that our proposed algorithm achieves optimal social welfare and fast convergence speed.","PeriodicalId":421740,"journal":{"name":"2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A distributed spectrum sharing algorithm in cognitive radio networks\",\"authors\":\"Wei Sun, Jiadi Yu, Tong Liu\",\"doi\":\"10.1109/PADSW.2014.7097848\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we study a social welfare maximization problem for spectrum sharing in cognitive radio networks. To fully use the spectrum resource, the spectrum owned by the licensed primary user (PU) can be leased to secondary users (SUs) for transmitting data. We first formulate the social welfare of a cognitive radio network, considering the cost for the primary user sharing spectrum and the utility gained for secondary users transmitting data. The social welfare maximization is a convex optimization, which can be solved by standard methods in a centralized manner. However, the utility function of each secondary user always contains the private information, which leads to the centralized methods disabled. To overcome this challenge, we propose an iterative distributed algorithm based on a pricing-based decomposition framework. It is theoretically proved that our proposed algorithm converges to the optimal solution. Numerical simulation results are presented to show that our proposed algorithm achieves optimal social welfare and fast convergence speed.\",\"PeriodicalId\":421740,\"journal\":{\"name\":\"2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS)\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PADSW.2014.7097848\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PADSW.2014.7097848","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文研究了认知无线电网络中频谱共享的社会福利最大化问题。为了充分利用频谱资源,可以将已获得license的primary user (primary user)拥有的频谱租给secondary user (secondary user),用于传输数据。考虑到主用户共享频谱的成本和次用户传输数据的效用,我们首先制定了认知无线电网络的社会福利。社会福利最大化是一个凸优化问题,可以用标准方法集中求解。然而,由于每个二级用户的效用函数总是包含私有信息,导致集中方法无法使用。为了克服这一挑战,我们提出了一种基于定价分解框架的迭代分布式算法。从理论上证明了该算法收敛于最优解。数值仿真结果表明,该算法具有较好的社会福利和较快的收敛速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A distributed spectrum sharing algorithm in cognitive radio networks
In this paper we study a social welfare maximization problem for spectrum sharing in cognitive radio networks. To fully use the spectrum resource, the spectrum owned by the licensed primary user (PU) can be leased to secondary users (SUs) for transmitting data. We first formulate the social welfare of a cognitive radio network, considering the cost for the primary user sharing spectrum and the utility gained for secondary users transmitting data. The social welfare maximization is a convex optimization, which can be solved by standard methods in a centralized manner. However, the utility function of each secondary user always contains the private information, which leads to the centralized methods disabled. To overcome this challenge, we propose an iterative distributed algorithm based on a pricing-based decomposition framework. It is theoretically proved that our proposed algorithm converges to the optimal solution. Numerical simulation results are presented to show that our proposed algorithm achieves optimal social welfare and fast convergence speed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Optimal bandwidth allocation with dynamic multi-path routing for non-critical traffic in AFDX networks Sensor-free corner shape detection by wireless networks Accelerated variance reduction methods on GPU Fault-Tolerant bi-directional communications in web-based applications Performance analysis of HPC applications with irregular tree data structures
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1