Joint relay selection and channel allocation in cooperative communication: A game theoretic learning solution

Cheng Ding, Liang Shen, Dianxiong Liu
{"title":"Joint relay selection and channel allocation in cooperative communication: A game theoretic learning solution","authors":"Cheng Ding, Liang Shen, Dianxiong Liu","doi":"10.1109/WCSP.2015.7341190","DOIUrl":null,"url":null,"abstract":"This article investigates the issue of joint relay selection and channel allocation in LTE relay networks, where the available channels of each node are restricted and heterogeneous. We decompose the issue into two subproblems: one is the channel selection of relay to mitigate the interference among relay nodes and another is joint relay and channel selection of source node to maximize the total capacity. The first subproblem is formulated as a global interaction game and a learning algorithm is proposed to achieve the Nash equilibrium. Based on the result of the first subproblem, the second one is formulated as a congestion game with player-specific payoff function. We propose a distributed solution to maximize the total capacity. Simulation results show that our approach can obtain a large total capacity and a high fairness index.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2015.7341190","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This article investigates the issue of joint relay selection and channel allocation in LTE relay networks, where the available channels of each node are restricted and heterogeneous. We decompose the issue into two subproblems: one is the channel selection of relay to mitigate the interference among relay nodes and another is joint relay and channel selection of source node to maximize the total capacity. The first subproblem is formulated as a global interaction game and a learning algorithm is proposed to achieve the Nash equilibrium. Based on the result of the first subproblem, the second one is formulated as a congestion game with player-specific payoff function. We propose a distributed solution to maximize the total capacity. Simulation results show that our approach can obtain a large total capacity and a high fairness index.
合作通信中的联合中继选择与信道分配:一个博弈论学习解决方案
本文研究了LTE中继网络中各节点可用信道受限且异构的联合中继选择和信道分配问题。我们将该问题分解为两个子问题:一个是中继的信道选择,以减轻中继节点之间的干扰;另一个是中继与源节点的联合信道选择,以最大限度地提高总容量。将第一个子问题表述为全局交互博弈,并提出了实现纳什均衡的学习算法。基于第一个子问题的结果,将第二个子问题表述为具有特定玩家收益函数的拥堵博弈。我们提出了一个分布式解决方案,以最大限度地提高总容量。仿真结果表明,该方法可以获得较大的总容量和较高的公平性指标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信