信道不确定中继辅助D2D通信的联合功率分配与中继选择

Uyoata Uyoata, M. Dlodlo
{"title":"信道不确定中继辅助D2D通信的联合功率分配与中继选择","authors":"Uyoata Uyoata, M. Dlodlo","doi":"10.1109/EUROCON.2017.8011158","DOIUrl":null,"url":null,"abstract":"Device to device(D2D) communication exploits the proximity between mobile devices to allow direct communication. Doing so offers advantages which include less energy consumption, hop gain, reduced load on the base station among others. For instances where the channel between the D2D devices does not allow for efficient direct communication, a suitably selected idle mobile device can act as a relay to forward intended signals. When the relaying mobile is in motion, channel uncertainties may arise and so constitute channel estimation errors at the transmitter and receiver pairs affecting the relay selection process. Recently matching theory has been studied as an approach for allocating resources in wireless communication system. In this paper joint power allocation and relay selection is considered with focus on comparing two matching theory schemes namely the Hungarian assignment(HA) approach and the stable matching(SM)approach. Full duplex communication with multiple D2D user pairs are considered in this work. The relay selection problem is formulated as an optimization problem which is decomposed into power allocation and actual relay selection. We formulate the relay selection problem as a one to one weighted bipartite matching. Both HA and SM approaches outperform random selection by offering reduced total transmit power. Whereas the performance of HA and SM are mostly similar, with respect to channel uncertainty errors the HA algorithm is more robust against errors than SM.","PeriodicalId":114100,"journal":{"name":"IEEE EUROCON 2017 -17th International Conference on Smart Technologies","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Joint power allocation and relay selection for relay assisted D2D communication with channel uncertainties\",\"authors\":\"Uyoata Uyoata, M. Dlodlo\",\"doi\":\"10.1109/EUROCON.2017.8011158\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Device to device(D2D) communication exploits the proximity between mobile devices to allow direct communication. Doing so offers advantages which include less energy consumption, hop gain, reduced load on the base station among others. For instances where the channel between the D2D devices does not allow for efficient direct communication, a suitably selected idle mobile device can act as a relay to forward intended signals. When the relaying mobile is in motion, channel uncertainties may arise and so constitute channel estimation errors at the transmitter and receiver pairs affecting the relay selection process. Recently matching theory has been studied as an approach for allocating resources in wireless communication system. In this paper joint power allocation and relay selection is considered with focus on comparing two matching theory schemes namely the Hungarian assignment(HA) approach and the stable matching(SM)approach. Full duplex communication with multiple D2D user pairs are considered in this work. The relay selection problem is formulated as an optimization problem which is decomposed into power allocation and actual relay selection. We formulate the relay selection problem as a one to one weighted bipartite matching. Both HA and SM approaches outperform random selection by offering reduced total transmit power. Whereas the performance of HA and SM are mostly similar, with respect to channel uncertainty errors the HA algorithm is more robust against errors than SM.\",\"PeriodicalId\":114100,\"journal\":{\"name\":\"IEEE EUROCON 2017 -17th International Conference on Smart Technologies\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE EUROCON 2017 -17th International Conference on Smart Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EUROCON.2017.8011158\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE EUROCON 2017 -17th International Conference on Smart Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EUROCON.2017.8011158","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

设备到设备(D2D)通信利用移动设备之间的接近性来实现直接通信。这样做的好处包括更少的能量消耗,跳增益,减少基站的负载等。对于D2D设备之间的通道不允许有效的直接通信的实例,适当选择的空闲移动设备可以充当中继来转发预期的信号。当中继移动设备处于运动状态时,可能会产生信道不确定性,从而在发送端和接收端对构成信道估计误差,影响中继选择过程。近年来,匹配理论作为无线通信系统资源分配的一种方法得到了广泛的研究。本文考虑了联合功率分配和中继选择,重点比较了匈牙利分配(HA)方法和稳定匹配(SM)方法两种匹配理论方案。在此工作中考虑了多个D2D用户对的全双工通信。将继电选择问题分解为功率分配和实际继电选择两个优化问题。我们将继电器选择问题表述为一个一对一的加权二部匹配问题。HA和SM方法都通过降低总发射功率而优于随机选择。虽然HA算法和SM算法的性能基本相似,但在信道不确定性误差方面,HA算法比SM算法对误差的鲁棒性更强。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Joint power allocation and relay selection for relay assisted D2D communication with channel uncertainties
Device to device(D2D) communication exploits the proximity between mobile devices to allow direct communication. Doing so offers advantages which include less energy consumption, hop gain, reduced load on the base station among others. For instances where the channel between the D2D devices does not allow for efficient direct communication, a suitably selected idle mobile device can act as a relay to forward intended signals. When the relaying mobile is in motion, channel uncertainties may arise and so constitute channel estimation errors at the transmitter and receiver pairs affecting the relay selection process. Recently matching theory has been studied as an approach for allocating resources in wireless communication system. In this paper joint power allocation and relay selection is considered with focus on comparing two matching theory schemes namely the Hungarian assignment(HA) approach and the stable matching(SM)approach. Full duplex communication with multiple D2D user pairs are considered in this work. The relay selection problem is formulated as an optimization problem which is decomposed into power allocation and actual relay selection. We formulate the relay selection problem as a one to one weighted bipartite matching. Both HA and SM approaches outperform random selection by offering reduced total transmit power. Whereas the performance of HA and SM are mostly similar, with respect to channel uncertainty errors the HA algorithm is more robust against errors than SM.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信