A novel idea of coupling licensed and unlicensed users using distributed harmonizing algorithm (DHL) in cognitive radio networks (CRNs)

Chowdhury Sajadul Islam
{"title":"A novel idea of coupling licensed and unlicensed users using distributed harmonizing algorithm (DHL) in cognitive radio networks (CRNs)","authors":"Chowdhury Sajadul Islam","doi":"10.1109/ICIEV.2015.7333989","DOIUrl":null,"url":null,"abstract":"Cognitive radio (CR) solves the spectrum insufficiency crisis by intelligently permitting secondary, or unlicensed, users entrance to the primary, licensed, users' frequency bands. Here considered a network of multiple primary users (PU) and multiple secondary users (SU). The objective of the SUs is to get entrance to orthogonal channels every one in use by one PU. Only one SU is permitted to coexist with a specified PU. In this paper proposed a distributed harmonizing algorithm to couple the network users where a Stackelberg game model is assumed for the relations between the coupled PU and SU. The preferred SU is agreed access in switch for monetary reward to the PU. The PU also amplifies its power to assemble its velocity obligation regardless of the SU's existence. The PU search for optimizing the intervention cost it suggests to a certain SU and the power allowance to sustain communication. The algorithm is exposed to execute secure to an optimal central controller, albeit at a condensed computational difficulty. The SU, alternatively, look for optimize its power demand so as to exploit its service. It is proven that this algorithm grants a sole steady harmonizing. Numerical results specify the supremacy of the proposed algorithm to a casual coupling of the users. Moreover, the algorithm is exposed to execute secure to an optimal central controller, albeit at a condensed computational intricacy.","PeriodicalId":367355,"journal":{"name":"2015 International Conference on Informatics, Electronics & Vision (ICIEV)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Informatics, Electronics & Vision (ICIEV)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIEV.2015.7333989","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Cognitive radio (CR) solves the spectrum insufficiency crisis by intelligently permitting secondary, or unlicensed, users entrance to the primary, licensed, users' frequency bands. Here considered a network of multiple primary users (PU) and multiple secondary users (SU). The objective of the SUs is to get entrance to orthogonal channels every one in use by one PU. Only one SU is permitted to coexist with a specified PU. In this paper proposed a distributed harmonizing algorithm to couple the network users where a Stackelberg game model is assumed for the relations between the coupled PU and SU. The preferred SU is agreed access in switch for monetary reward to the PU. The PU also amplifies its power to assemble its velocity obligation regardless of the SU's existence. The PU search for optimizing the intervention cost it suggests to a certain SU and the power allowance to sustain communication. The algorithm is exposed to execute secure to an optimal central controller, albeit at a condensed computational difficulty. The SU, alternatively, look for optimize its power demand so as to exploit its service. It is proven that this algorithm grants a sole steady harmonizing. Numerical results specify the supremacy of the proposed algorithm to a casual coupling of the users. Moreover, the algorithm is exposed to execute secure to an optimal central controller, albeit at a condensed computational intricacy.
认知无线网络(crn)中使用分布式协调算法(DHL)耦合许可用户和非许可用户的新思路
认知无线电(Cognitive radio, CR)通过智能地允许二次用户或无证用户进入主频段、有证用户的频段,解决了频谱不足的危机。这里考虑一个由多个主用户(PU)和多个辅助用户(SU)组成的网络。单元的目标是获得正交通道的入口,每个通道都由一个PU使用。一个指定的PU上只能存在一个SU。本文提出了一种网络用户耦合的分布式协调算法,该算法对耦合的用户群和用户群之间的关系采用Stackelberg博弈模型,优先选择的用户群在交换机中约定接入,并对用户群进行金钱奖励。PU也放大了它的力量来组装它的速度义务,而不管SU是否存在。PU搜索是为了优化干预成本,它建议在一定的SU和功率允许范围内维持通信。该算法暴露于安全执行一个最优的中央控制器,尽管在一个浓缩的计算难度。而SU则寻求优化其电力需求,以利用其服务。证明了该算法能实现唯一的稳定协调。数值结果表明,所提出的算法对用户的偶然性耦合具有优越性。此外,该算法暴露于安全执行一个最优的中央控制器,尽管在一个浓缩的计算复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信