Virtual Full-Duplex Relaying in a Buffer-Aided Multi-Hop Cooperative Network

A. Shukla, B. Manoj, M. Bhatnagar
{"title":"Virtual Full-Duplex Relaying in a Buffer-Aided Multi-Hop Cooperative Network","authors":"A. Shukla, B. Manoj, M. Bhatnagar","doi":"10.1109/SPCOM50965.2020.9179530","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a virtual full-duplex (VFD) multi-hop cooperative relaying network using buffer-aided halfduplex (HD) relays. Firstly, for a given multi-hop network, the links are partitioned into three groups and then information is transmitted over a single time slot using two selected best links, which enhances the network coverage and reliability of the system. The Markov chain approach is used to analyze the state transition matrix which models the evolution of buffer states. An analytical expression of steady state probability is obtained, using which the outage probability of the system is evaluated. Numerical results validate our analytical findings and it shows that the proposed relaying scheme offers a better outage performance as compared to that of the conventional buffer-aided max-link relay selection scheme in a multi-hop communication system.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Signal Processing and Communications (SPCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPCOM50965.2020.9179530","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper, we propose a virtual full-duplex (VFD) multi-hop cooperative relaying network using buffer-aided halfduplex (HD) relays. Firstly, for a given multi-hop network, the links are partitioned into three groups and then information is transmitted over a single time slot using two selected best links, which enhances the network coverage and reliability of the system. The Markov chain approach is used to analyze the state transition matrix which models the evolution of buffer states. An analytical expression of steady state probability is obtained, using which the outage probability of the system is evaluated. Numerical results validate our analytical findings and it shows that the proposed relaying scheme offers a better outage performance as compared to that of the conventional buffer-aided max-link relay selection scheme in a multi-hop communication system.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
缓冲辅助多跳协作网络中的虚拟全双工中继
在本文中,我们提出了一个虚拟全双工(VFD)多跳合作中继网络,使用缓冲辅助半双工(HD)中继。首先,对于给定的多跳网络,将链路划分为三组,然后选择两个最佳链路在单个时隙中传输信息,从而提高了网络的覆盖率和系统的可靠性。利用马尔可夫链方法对状态转移矩阵进行了分析,该矩阵模拟了缓冲状态的演化。得到了系统稳态概率的解析表达式,利用该表达式计算了系统的中断概率。数值结果验证了我们的分析结果,表明在多跳通信系统中,与传统的缓冲辅助最大链路中继选择方案相比,所提出的中继方案具有更好的中断性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Wavelet based Fine-to-Coarse Retinal Blood Vessel Extraction using U-net Model Classification of Social Signals Using Deep LSTM-based Recurrent Neural Networks Classifying Cultural Music using Melodic Features Clustering tendency assessment for datasets having inter-cluster density variations Component-specific temporal decomposition: application to enhanced speech coding and co-articulation analysis
×
引用
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