Order-statistics-based relay selection for uplink cellular networks

Amir Minayi Jalil, V. Meghdadi, A. Ghrayeb, J. Cances
{"title":"Order-statistics-based relay selection for uplink cellular networks","authors":"Amir Minayi Jalil, V. Meghdadi, A. Ghrayeb, J. Cances","doi":"10.1109/WCNC.2012.6213940","DOIUrl":null,"url":null,"abstract":"In this paper, we address the relay assignment in cooperative networks based on order statistics. We consider a network comprising a cluster of transmitting sources, a cluster of relay nodes and a single destination. This is motivated by the fact that the existing relay assignment schemes don't achieve diversity for the network configuration under consideration. We assume that the cooperation is in the amplify-and-forward (AF) mode, but proposed scheme is applicable to the decode-and-forward (DF) mode. In the relay assignment process, the source nodes that have weaker source-destination links, have higher priority in relay selection. We analyze the probability density function (PDF) and the average bit error rate (BER) for the proposed scheme where we invoke important results that we first derive for simple two-hop networks. Specifically, we calculate the exact expression for the PDF of the end-to-end signal-to-noise ratio (SNR). Compared to other relay assignment schemes (like maximizing sum of SNR values or maximizing the minimum selected SNR), the proposed scheme has the advantages of simplicity, higher diversity order and fairness.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"44 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2012.6213940","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, we address the relay assignment in cooperative networks based on order statistics. We consider a network comprising a cluster of transmitting sources, a cluster of relay nodes and a single destination. This is motivated by the fact that the existing relay assignment schemes don't achieve diversity for the network configuration under consideration. We assume that the cooperation is in the amplify-and-forward (AF) mode, but proposed scheme is applicable to the decode-and-forward (DF) mode. In the relay assignment process, the source nodes that have weaker source-destination links, have higher priority in relay selection. We analyze the probability density function (PDF) and the average bit error rate (BER) for the proposed scheme where we invoke important results that we first derive for simple two-hop networks. Specifically, we calculate the exact expression for the PDF of the end-to-end signal-to-noise ratio (SNR). Compared to other relay assignment schemes (like maximizing sum of SNR values or maximizing the minimum selected SNR), the proposed scheme has the advantages of simplicity, higher diversity order and fairness.
基于顺序统计的上行蜂窝网络中继选择
本文研究了基于顺序统计量的协作网络中继分配问题。我们考虑一个由一组发送源、一组中继节点和一个单一目的地组成的网络。这是由于现有的中继分配方案不能实现所考虑的网络配置的分集。我们假设合作是在放大转发(AF)模式下进行的,但所提出的方案适用于解码转发(DF)模式。在中继分配过程中,源目的链路较弱的源节点在中继选择中具有较高的优先级。我们分析了所提出方案的概率密度函数(PDF)和平均误码率(BER),其中我们引用了我们首先从简单的两跳网络中得出的重要结果。具体来说,我们计算了端到端信噪比(SNR) PDF的精确表达式。与其他中继分配方案(如最大化信噪比值和或最大化最小选择信噪比)相比,该方案具有简单、高分集顺序和公平性等优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信