A Game-Theoretic Analysis of Decode-and-Forward Cooperation in Rayleigh Fading Channels

Yingda Chen, S. Kishore
{"title":"A Game-Theoretic Analysis of Decode-and-Forward Cooperation in Rayleigh Fading Channels","authors":"Yingda Chen, S. Kishore","doi":"10.1109/CISS.2007.4298318","DOIUrl":null,"url":null,"abstract":"A game-theoretic analysis of decode and forward cooperative communications is presented for Rayleigh fading channels. The channel is studied as a two-state Markov model and cooperation is modeled as a repeated game in which selfish user terminals seek to maximize their own payoff, a utility function that monotonically increases with signal-to-noise ratio. Nash equilibria are investigated for both convex and concave utility functions. Results show a mutually cooperative Nash Equilibrium can always be obtained when convex utility functions* are used and users care somewhat about future performance. Concave utility functions may not always support a mutually cooperative Nash Equilibrium, especially under adverse channel conditions. Examinations of two widely-applied concave utility functions, however, demonstrate that mutual cooperation is more likely when users place more value on future performance. Additionally, techniques that improve effective channel conditions, e.g., use of multiple transmit antennas, further encourage cooperation.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 41st Annual Conference on Information Sciences and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2007.4298318","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

A game-theoretic analysis of decode and forward cooperative communications is presented for Rayleigh fading channels. The channel is studied as a two-state Markov model and cooperation is modeled as a repeated game in which selfish user terminals seek to maximize their own payoff, a utility function that monotonically increases with signal-to-noise ratio. Nash equilibria are investigated for both convex and concave utility functions. Results show a mutually cooperative Nash Equilibrium can always be obtained when convex utility functions* are used and users care somewhat about future performance. Concave utility functions may not always support a mutually cooperative Nash Equilibrium, especially under adverse channel conditions. Examinations of two widely-applied concave utility functions, however, demonstrate that mutual cooperation is more likely when users place more value on future performance. Additionally, techniques that improve effective channel conditions, e.g., use of multiple transmit antennas, further encourage cooperation.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
瑞利衰落信道中译码转发合作的博弈论分析
对瑞利衰落信道的译码和转发合作通信进行了博弈论分析。将信道作为两态马尔可夫模型进行研究,将合作建模为自私的用户终端追求自身收益最大化的重复博弈,即一个随信噪比单调增加的效用函数。研究了凹凸效用函数的纳什均衡。结果表明,当使用凸效用函数*且用户对未来性能有一定的关注时,总能得到一个相互合作的纳什均衡。凹效用函数可能并不总是支持相互合作的纳什均衡,特别是在不利的渠道条件下。然而,对两个广泛应用的凹效用函数的检验表明,当用户更重视未来绩效时,相互合作的可能性更大。此外,改善有效信道条件的技术,例如使用多个发射天线,进一步鼓励合作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Detecting Primary Transmitters via Cooperation and Memory in Cognitive Radio Profit Maximizing Pricing Strategies for Dynamic Spectrum Allocation Correlated Sources over an Asymmetric Multiple Access Channel with One Distortion Criterion Minimax and Maxmin Solutions to Gaussian Jamming in Block-Fading Channels under Long Term Power Constraints A High-Throughput Cross-Layer Scheme for Distributed Wireless Ad Hoc Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1