Effective-Capacity Based Auctions for Relay Selection over Wireless Cooperative Communications Networks

Qixuan Zhu, Xi Zhang
{"title":"Effective-Capacity Based Auctions for Relay Selection over Wireless Cooperative Communications Networks","authors":"Qixuan Zhu, Xi Zhang","doi":"10.1109/GLOCOM.2016.7841767","DOIUrl":null,"url":null,"abstract":"Cooperative communication is an efficient technique for mobile wireless networks supporting information transmission through relay nodes, which forward the signal received from a source node to its destination. Applying the cooperative communication in wireless networks can significantly improve the network performance. One of the most important challenges is how to efficiently allocate the access opportunity of a relay node to multiple mobile-users while taking into account the delay-bounded quality of service (QoS) for the time-sensitive multimedia data transmissions. To overcome these difficulties, in this paper we propose a novel game-theory based scheme to resolve the relay node allocation problem by measuring the maximum throughput for time-sensitive multimedia data transmission under a QoS requirement as the effective capacity gain. We formulate this one relay allocation problem as a single-relay-auction such that all mobile-user players can decide whether to patriciate in this relay auction, and the mobile-user player who places the highest bid obtains the relay allocation. The mobile-user players who lose or stay out of the auction can only directly transmit information to their destinations. Then, we derive the optimal strategies for the single-relay-auction, maximizing the payoff (effective capacity gain minus costs) in each bid round.The extensive simulation results obtained validate and evaluate our proposed schemes.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Global Communications Conference (GLOBECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2016.7841767","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Cooperative communication is an efficient technique for mobile wireless networks supporting information transmission through relay nodes, which forward the signal received from a source node to its destination. Applying the cooperative communication in wireless networks can significantly improve the network performance. One of the most important challenges is how to efficiently allocate the access opportunity of a relay node to multiple mobile-users while taking into account the delay-bounded quality of service (QoS) for the time-sensitive multimedia data transmissions. To overcome these difficulties, in this paper we propose a novel game-theory based scheme to resolve the relay node allocation problem by measuring the maximum throughput for time-sensitive multimedia data transmission under a QoS requirement as the effective capacity gain. We formulate this one relay allocation problem as a single-relay-auction such that all mobile-user players can decide whether to patriciate in this relay auction, and the mobile-user player who places the highest bid obtains the relay allocation. The mobile-user players who lose or stay out of the auction can only directly transmit information to their destinations. Then, we derive the optimal strategies for the single-relay-auction, maximizing the payoff (effective capacity gain minus costs) in each bid round.The extensive simulation results obtained validate and evaluate our proposed schemes.
基于有效容量的无线协作通信网络中继选择竞价
协作通信是移动无线网络中支持信息传输的一种有效技术,它通过中继节点将从源节点接收到的信号转发到目的节点。在无线网络中应用协作通信可以显著提高网络性能。对于时间敏感型多媒体数据传输,如何在考虑延迟有界服务质量(QoS)的前提下,有效地将中继节点的访问机会分配给多个移动用户是一个重要的挑战。为了克服这些困难,本文提出了一种新的基于博弈论的中继节点分配方案,通过在QoS要求下测量时间敏感多媒体数据传输的最大吞吐量作为有效容量增益来解决中继节点分配问题。我们将这一中继分配问题表述为单中继拍卖,所有移动用户玩家都可以决定是否参与该中继拍卖,出价最高的移动用户玩家获得中继分配。输掉或退出拍卖的移动用户玩家只能直接将信息传递给他们的目的地。然后,我们推导出单中继拍卖的最优策略,使每轮投标的收益(有效容量增益减去成本)最大化。大量的仿真结果验证和评价了我们提出的方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信