Throughput analysis of cooperative multi-hop underlay CRNs with incremental relaying

Hari Krishna Boddapati, S. Prakriya, M. Bhatnagar
{"title":"Throughput analysis of cooperative multi-hop underlay CRNs with incremental relaying","authors":"Hari Krishna Boddapati, S. Prakriya, M. Bhatnagar","doi":"10.1109/ICCW.2017.7962687","DOIUrl":null,"url":null,"abstract":"To increase the communication range of multi-hop cognitive radio networks (CRNs) while avoiding the implied loss in throughput, use of incremental relaying has been suggested. In this paper, we discuss an incremental relaying (IR) protocol for cooperative multi-hop CRNs (CMHCRNs). A CMHCRN with multiple decode-and-forward relays in each hop is considered. In each hop, the relays whose received signal-to-noise-ratio (SNR) values are greater than a predefined threshold constitute a qualified relay set (QRS). The performance of an IR protocol that selects a relay from the QRS that has the highest SNR to the destination at each hop of the CMHCRN is analyzed. Both peak transmit power and peak interference power constraints are taken into account. The end-to-end outage probability and throughput expressions are derived for the considered network over Rayleigh fading channels. Closed-form expressions for floor values of outage probability and throughput are also derived. Based on the derived expressions, we demonstrate that with increase in number of hops, throughput first increases and then decreases.","PeriodicalId":6656,"journal":{"name":"2017 IEEE International Conference on Communications Workshops (ICC Workshops)","volume":"7 1","pages":"379-385"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Communications Workshops (ICC Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2017.7962687","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

To increase the communication range of multi-hop cognitive radio networks (CRNs) while avoiding the implied loss in throughput, use of incremental relaying has been suggested. In this paper, we discuss an incremental relaying (IR) protocol for cooperative multi-hop CRNs (CMHCRNs). A CMHCRN with multiple decode-and-forward relays in each hop is considered. In each hop, the relays whose received signal-to-noise-ratio (SNR) values are greater than a predefined threshold constitute a qualified relay set (QRS). The performance of an IR protocol that selects a relay from the QRS that has the highest SNR to the destination at each hop of the CMHCRN is analyzed. Both peak transmit power and peak interference power constraints are taken into account. The end-to-end outage probability and throughput expressions are derived for the considered network over Rayleigh fading channels. Closed-form expressions for floor values of outage probability and throughput are also derived. Based on the derived expressions, we demonstrate that with increase in number of hops, throughput first increases and then decreases.
基于增量中继的协同多跳底层crn吞吐量分析
为了增加多跳认知无线网络(crn)的通信范围,同时避免潜在的吞吐量损失,建议使用增量中继。本文讨论了一种用于合作多跳crn (cmhcrn)的增量中继(IR)协议。考虑了一种每跳具有多个译码转发中继的CMHCRN。在每一跳中,接收到的信噪比(SNR)值大于预定义阈值的中继构成合格中继集(QRS)。分析了一种从QRS中选择信噪比最高的中继到达CMHCRN每跳目的地的IR协议的性能。同时考虑了峰值发射功率和峰值干扰功率的约束。推导了考虑的瑞利衰落信道网络的端到端中断概率和吞吐量表达式。并推导出停机概率和吞吐量的下限值的封闭表达式。根据导出的表达式,我们证明了随着跳数的增加,吞吐量先增加后降低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信