论文标题

通过新颖的停电概率结合和几何编程,能源有效的HARQ可实现超元性

Energy Efficient HARQ for Ultrareliability via Novel Outage Probability Bound and Geometric Programming

论文作者

Shen, Kaiming, Yu, Wei, Chen, Xihan, Khosravirad, Saeed R.

论文摘要

混合自动重复1请求(HARQ)是超级通信的关键推动器。本文优化了最初传输的发射功率和随后的HARQ重新冗余或追逐组合的重传功率,旨在最大程度地减少预期的能源消耗,因为目标中断概率和目标潜伏期。主要的挑战是由于以下事实:中断概率是嵌套在连续卷积中的功率变量的复杂函数。现有作品主要使用经典的上限来通过假设无界传输功率,然后将原始问题转换为几何编程(GP)问题来近似停电概率。相比之下,我们提出了一个新颖而更紧密的上限,通过考虑实用的功率限制。新的界限和由此产生的新GP方法将进一步扩展到具有各种褪色,多个天线和多个接收器的更广泛的通道模型。如模拟所示,基于新界限的GP方法显着优于固定传输功率或通过经典边界技术优化功率的现有策略。

Hybrid automatic repeat 1 request (HARQ) is a key enabler for ultrareliable communications. This paper optimizes transmit power for the initial transmission and the subsequent retransmissions of HARQ with either incremental redundancy or Chase combining, aiming to minimize the expected energy consumption given the target outage probability and the target latency. The main challenge is due to the fact that the outage probability is a complicated function of the power variables which are nested in successive convolutions. The existing works mostly use a classic upper bound to approximate the outage probability by assuming unbounded transmit power, then convert the original problem to a geometric programming (GP) problem. In contrast, we propose a novel and much tighter upper bound by taking the practical power limit into consideration. The new bound and the resulting new GP method are further extended to a broader group of channel models with various fading, multiple antennas, and multiple receivers. As shown in simulations, the GP method based on the new bound significantly outperforms the existing strategies that either fix transmit power or optimize power by the classic bounding technique.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源