在认知无线电中,将二次频谱共享与独立重新尝试叠加

Muthukrishnan Senthil Kumar, Aresh Dadlani, Kiseon Kim, R. Afolabi
{"title":"在认知无线电中,将二次频谱共享与独立重新尝试叠加","authors":"Muthukrishnan Senthil Kumar, Aresh Dadlani, Kiseon Kim, R. Afolabi","doi":"10.1109/SARNOF.2016.7846750","DOIUrl":null,"url":null,"abstract":"Opportunistic spectrum access (OSA) is a promising reform paradigm envisioned to address the issue of spectrum scarcity in cognitive radio networks (CRNs). While current models consider various aspects of the OSA scheme, the impact of retrial phenomenon in multi-channel CRNs has not yet been analyzed. In this work, we present a continuous-time Markov chain (CTMC) model in which the blocked/preempted secondary users (SUs) enter a finite retrial group (or orbit) and re-attempt independently for service in an exponentially distributed random manner. Taking into account the inherent retrial tendency of SUs, we numerically assess the performance of the proposed scheme in terms of dropping probability and throughput of SUs.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Overlay secondary spectrum sharing with independent re-attempts in cognitive radios\",\"authors\":\"Muthukrishnan Senthil Kumar, Aresh Dadlani, Kiseon Kim, R. Afolabi\",\"doi\":\"10.1109/SARNOF.2016.7846750\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Opportunistic spectrum access (OSA) is a promising reform paradigm envisioned to address the issue of spectrum scarcity in cognitive radio networks (CRNs). While current models consider various aspects of the OSA scheme, the impact of retrial phenomenon in multi-channel CRNs has not yet been analyzed. In this work, we present a continuous-time Markov chain (CTMC) model in which the blocked/preempted secondary users (SUs) enter a finite retrial group (or orbit) and re-attempt independently for service in an exponentially distributed random manner. Taking into account the inherent retrial tendency of SUs, we numerically assess the performance of the proposed scheme in terms of dropping probability and throughput of SUs.\",\"PeriodicalId\":137948,\"journal\":{\"name\":\"2016 IEEE 37th Sarnoff Symposium\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 37th Sarnoff Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SARNOF.2016.7846750\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 37th Sarnoff Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SARNOF.2016.7846750","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

机会频谱接入(OSA)是一种很有前途的改革范式,旨在解决认知无线电网络(crn)中频谱稀缺的问题。虽然目前的模型考虑了OSA方案的各个方面,但尚未分析多通道crn中重审现象的影响。在这项工作中,我们提出了一个连续时间马尔可夫链(CTMC)模型,在该模型中,被阻塞/被抢占的辅助用户(su)进入一个有限的重审群(或轨道),并以指数分布的随机方式独立地重新尝试服务。考虑到单节点的固有重审倾向,我们从单节点的丢弃概率和吞吐量两方面对所提出方案的性能进行了数值评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Overlay secondary spectrum sharing with independent re-attempts in cognitive radios
Opportunistic spectrum access (OSA) is a promising reform paradigm envisioned to address the issue of spectrum scarcity in cognitive radio networks (CRNs). While current models consider various aspects of the OSA scheme, the impact of retrial phenomenon in multi-channel CRNs has not yet been analyzed. In this work, we present a continuous-time Markov chain (CTMC) model in which the blocked/preempted secondary users (SUs) enter a finite retrial group (or orbit) and re-attempt independently for service in an exponentially distributed random manner. Taking into account the inherent retrial tendency of SUs, we numerically assess the performance of the proposed scheme in terms of dropping probability and throughput of SUs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信