多天线底层D2D通信中最大和速率的消息传递算法

Berna Özbek, M. Pischella, D. L. Ruyet
{"title":"多天线底层D2D通信中最大和速率的消息传递算法","authors":"Berna Özbek, M. Pischella, D. L. Ruyet","doi":"10.1109/ISWCS.2018.8491058","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a resource allocation of device-to-device (D2D) communications underlaying multiantenna cellular systems by employing message-passing algorithm. It is possible to construct the factor graph of the D2D pairs by considering the interference power at the base station and among the D2D pairs. The goal is to avoid interfering the cellular transmission while increasing the sum data rate of D2D pairs. We show that the proposed resource allocation based on message passing algorithm allow us to almost reach the performance of the exhaustive search and outperforms the random allocation. Since the associated factor graph is not fully connected, the complexity of the algorithm is significantly reduced compared to the exhaustive search.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Message-Passing Algorithm for Sum-rate Maximization in Multi-antenna Underlay D2D Communications\",\"authors\":\"Berna Özbek, M. Pischella, D. L. Ruyet\",\"doi\":\"10.1109/ISWCS.2018.8491058\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a resource allocation of device-to-device (D2D) communications underlaying multiantenna cellular systems by employing message-passing algorithm. It is possible to construct the factor graph of the D2D pairs by considering the interference power at the base station and among the D2D pairs. The goal is to avoid interfering the cellular transmission while increasing the sum data rate of D2D pairs. We show that the proposed resource allocation based on message passing algorithm allow us to almost reach the performance of the exhaustive search and outperforms the random allocation. Since the associated factor graph is not fully connected, the complexity of the algorithm is significantly reduced compared to the exhaustive search.\",\"PeriodicalId\":272951,\"journal\":{\"name\":\"2018 15th International Symposium on Wireless Communication Systems (ISWCS)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 15th International Symposium on Wireless Communication Systems (ISWCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISWCS.2018.8491058\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2018.8491058","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在本文中,我们提出了一种基于消息传递算法的多天线蜂窝系统的设备到设备(D2D)通信资源分配方法。通过考虑基站内和D2D对之间的干扰功率,可以构造D2D对的因子图。其目的是在提高D2D对数据速率的同时,避免干扰蜂窝传输。结果表明,基于消息传递算法的资源分配几乎可以达到穷举搜索的性能,并且优于随机分配。由于关联因子图不是完全连通的,因此与穷举搜索相比,该算法的复杂度显著降低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Message-Passing Algorithm for Sum-rate Maximization in Multi-antenna Underlay D2D Communications
In this paper, we propose a resource allocation of device-to-device (D2D) communications underlaying multiantenna cellular systems by employing message-passing algorithm. It is possible to construct the factor graph of the D2D pairs by considering the interference power at the base station and among the D2D pairs. The goal is to avoid interfering the cellular transmission while increasing the sum data rate of D2D pairs. We show that the proposed resource allocation based on message passing algorithm allow us to almost reach the performance of the exhaustive search and outperforms the random allocation. Since the associated factor graph is not fully connected, the complexity of the algorithm is significantly reduced compared to the exhaustive search.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信