基于无线网络黄金码的分布式传输中继选择

L. Ge, Gaojie Chen, J. Chambers
{"title":"基于无线网络黄金码的分布式传输中继选择","authors":"L. Ge, Gaojie Chen, J. Chambers","doi":"10.1109/NGMAST.2011.43","DOIUrl":null,"url":null,"abstract":"The implementation of cooperative diversity with relays has advantages over point-to-point multiple-input multipleoutput (MIMO) systems in particular overcoming correlated paths due to small inter-element spacing. A simple transmitter with one antenna may moreover exploit cooperative diversity or space time coding gain through distributed relays. In this paper, similar distributed transmission is considered with the golden code, and we propose a new strategy for relay selection, called the maximum-mean selection policy, for distributed transmission based on a wireless relay network. This new strategy performs a channel strength tradeoff at every relay node to select the best two relays for transmission. It improves upon the established onesided selection strategy of maximum-minimum policy. Simulation results comparing the bit error rate (BER) of a scheme without relay selection, with the maximum-minimum and maximummean selection schemes confirm the performance advantage of relay selection and that our proposed strategy yields the best performance of the three methods.","PeriodicalId":142071,"journal":{"name":"2011 Fifth International Conference on Next Generation Mobile Applications, Services and Technologies","volume":"87 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Relay Selection in Distributed Transmission Based on the Golden Code in Wireless Networks\",\"authors\":\"L. Ge, Gaojie Chen, J. Chambers\",\"doi\":\"10.1109/NGMAST.2011.43\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The implementation of cooperative diversity with relays has advantages over point-to-point multiple-input multipleoutput (MIMO) systems in particular overcoming correlated paths due to small inter-element spacing. A simple transmitter with one antenna may moreover exploit cooperative diversity or space time coding gain through distributed relays. In this paper, similar distributed transmission is considered with the golden code, and we propose a new strategy for relay selection, called the maximum-mean selection policy, for distributed transmission based on a wireless relay network. This new strategy performs a channel strength tradeoff at every relay node to select the best two relays for transmission. It improves upon the established onesided selection strategy of maximum-minimum policy. Simulation results comparing the bit error rate (BER) of a scheme without relay selection, with the maximum-minimum and maximummean selection schemes confirm the performance advantage of relay selection and that our proposed strategy yields the best performance of the three methods.\",\"PeriodicalId\":142071,\"journal\":{\"name\":\"2011 Fifth International Conference on Next Generation Mobile Applications, Services and Technologies\",\"volume\":\"87 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Fifth International Conference on Next Generation Mobile Applications, Services and Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NGMAST.2011.43\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Fifth International Conference on Next Generation Mobile Applications, Services and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NGMAST.2011.43","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

与点对点多输入多输出(MIMO)系统相比,用继电器实现合作分集具有优势,特别是克服了由于元件间距小而产生的相关路径。具有一个天线的简单发射机还可以通过分布式中继利用合作分集或时空编码增益。本文考虑了黄金码下的相似分布式传输,提出了一种新的基于无线中继网络的分布式传输中继选择策略——最大均值选择策略。这种新策略在每个中继节点上进行信道强度权衡,以选择最佳的两个中继进行传输。它是对已建立的最大最小策略的片面选择策略的改进。将无中继选择方案的误码率(BER)与最大最小和最大均值选择方案进行了仿真比较,验证了中继选择方案的性能优势,并表明本文提出的策略是三种方案中性能最好的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Relay Selection in Distributed Transmission Based on the Golden Code in Wireless Networks
The implementation of cooperative diversity with relays has advantages over point-to-point multiple-input multipleoutput (MIMO) systems in particular overcoming correlated paths due to small inter-element spacing. A simple transmitter with one antenna may moreover exploit cooperative diversity or space time coding gain through distributed relays. In this paper, similar distributed transmission is considered with the golden code, and we propose a new strategy for relay selection, called the maximum-mean selection policy, for distributed transmission based on a wireless relay network. This new strategy performs a channel strength tradeoff at every relay node to select the best two relays for transmission. It improves upon the established onesided selection strategy of maximum-minimum policy. Simulation results comparing the bit error rate (BER) of a scheme without relay selection, with the maximum-minimum and maximummean selection schemes confirm the performance advantage of relay selection and that our proposed strategy yields the best performance of the three methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信