arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2410.04353cs.GTcs.SYeess.SY
收藏

面向非协作中继系统高效运行的多属性拍卖机制

Multi-Attribute Auctions for Efficient Operation of Non-Cooperative Relaying Systems

Winston Hurst, Yasamin Mostofi

AI总结:

针对非协作中继系统的高效传输需求,提出基于无线能量传输支付的多属性拍卖机制,设计激励相容的改进拍卖实现真实投标占优策略,显著降低能耗与传输时间,性能随候选节点数增加逼近协作基线。

摘要:

本文研究了通信系统中采用多属性拍卖实现非协作场景下高效中继的问题。我们考虑的系统中,信源需要将数据卸载到接入点(AP),同时兼顾传输的时效性和能效。通信信道深度衰落(例如由视距链路阻塞导致)使得直接传输成本过高,因此信源可选择借助非协作用户设备(UE)充当中继节点。我们提出了一种多属性拍卖机制,用于选择中继UE并确定传输时长与功率,支付给UE的报酬以无线能量传输(WPT)形式提供。UE到AP的信道质量属于私有信息,投标内容包含传输时间和传输功率。我们证明,在次优报价拍卖机制下,所有候选UE的真实投标构成纳什均衡。但该拍卖不满足激励相容,因此我们提出了一种改进拍卖机制,其中真实投标是占优策略。大量数值实验验证了我们方法的有效性,并将其与协作基线方案进行了对比。实验结果表明,仅需2个候选节点,我们的改进机制最多可降低76%的能耗;仅需3个候选节点,传输时间最多可缩短55%。此外,随着候选节点数量增加,我们的机制性能会逐渐逼近协作基线方案的水平。总体而言,研究结果凸显了多属性拍卖在提升非协作场景下数据传输效率方面的潜力。

英文摘要:

This paper studies the use of a multi-attribute auction in a communication system to bring about efficient relaying in a non-cooperative setting. We consider a system where a source seeks to offload data to an access point (AP) while balancing both the timeliness and energy-efficiency of the transmission. A deep fade in the communication channel (due to, e.g., a line-of-sight blockage) makes direct communication costly, and the source may alternatively rely on non-cooperative UEs to act as relays. We propose a multi-attribute auction to select a UE and to determine the duration and power of the transmission, with payments to the UE taking the form of energy sent via wireless power transfer (WPT). The quality of the channel from a UE to the AP constitutes private information, and bids consist of a transmission time and transmission power. We show that under a second-preferred-offer auction, truthful bidding by all candidate UEs forms a Nash Equilibrium. However, this auction is not incentive compatible, and we present a modified auction in which truthful bidding is in fact a dominant strategy. Extensive numerical experimentation illustrates the efficacy of our approach, which we compare to a cooperative baseline. We demonstrate that with as few as two candidates, our improved mechanism leads to as much as a 76% reduction in energy consumption, and that with as few as three candidates, the transmission time decreases by as much as 55\%. Further, we see that as the number of candidates increases, the performance of our mechanism approaches that of the cooperative baseline. Overall, our findings highlight the potential of multi-attribute auctions to enhance the efficiency of data transfer in non-cooperative settings.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑