اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدUltra Reliable Communication via Optimum Power Allocation for HARQ Retransmission Schemes
130
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this work, we develop low complexity, optimal power allocation algorithms that would allow ultra reliable operation at any outage probability target with minimum power consumption in the finite blocklength regime by utilizing Karush-Kuhn-Tucker (KKT) conditions. In our setup, we assume that the transmitter does not know the channel state information (CSI). First, we show that achieving a very low packet outage probability by using an open loop setup requires extremely high power consumption. Thus, we resort to retransmission schemes as a solution, namely Automatic Repeat Request (ARQ), Chase Combining Hybrid ARQ (CC-HARQ) and Incremental Redundancy (IR) HARQ. Countrary to classical approaches, where it is optimal to allocate equal power with each transmission, we show that for operation in the ultra reliable regime (URR), the optimal strategy suggests transmission with incremental power in each round. Numerically, we evaluate the power gains of the proposed protocol. We show that the best power saving is given by IR-HARQ protocol. Further, we show that when compared to the one shot transmission, these protocols enable large average and maximum power gains. Finally, we show that the larger the number of transmissions is, the larger power gains will be attained.
قيم البحث
اقرأ أيضاً
Hybrid Automatic ReQuest (HARQ) protocol enables reliable communications in wireless systems. Usually, several parallel streams are sent in successive timeslots following a time-sharing approach. Recently, multi-layer HARQ has been proposed by superp
osing packets within a timeslot. In this paper, we evaluate the potential of this multi-layer HARQ by playing with some design parameters. We show that a gain in throughput is only obtained at mid-Signal-to-Noise Ratio (SNR).
Effective capacity (EC) determines the maximum communication rate subject to a particular delay constraint. In this work, we analyze the EC of ultra reliable Machine Type Communication (MTC) networks operating in the finite blocklength (FB) regime. F
irst, we present a closed form approximation for EC in quasi-static Rayleigh fading channels. Our analysis determines the upper bounds for EC and delay constraint when varying transmission power. Finally, we characterize the power-delay trade-off for fixed EC and propose an optimum power allocation scheme which exploits the asymptotic behavior of EC in the high SNR regime. The results illustrate that the proposed scheme provides significant power saving with a negligible loss in EC.
Novel bitwise retransmission schemes are devised which retransmit only the bits received with small reliability. The retransmissions are used to accumulate the reliabilities of individual bits. Unlike the conventional automatic repeat request (ARQ) s
chemes, the proposed scheme does not require a checksum for the error detection. The bits to be retransmitted are reported as a combination number, or two synchronized random number generators (RNGs) at the transmitter and receiver are used to greatly compress the feedback message. The bitwise retransmission decisions and/or combining can be performed after the demodulation or after the channel decoding at the receiver. The bit-error rate (BER) expressions are derived for the case of one and two retransmissions, and verified by computer simulations. Assuming three specific retransmission strategies, the scheme parameters are optimized to minimize the overall BER. For the same number of retransmissions and packet length, the proposed schemes always outperform the frequently used stop-and-wait ARQ. The impact of feedback errors is also considered. Finally, practical designs of the bitwise retransmissions for data fusion from sensor nodes in Zigbee, Wifi and Bluetooth networks are presented.
Effective Capacity defines the maximum communication rate subject to a specific delay constraint, while effective energy efficiency (EEE) indicates the ratio between effective capacity and power consumption. We analyze the EEE of ultra-reliable netwo
rks operating in the finite blocklength regime. We obtain a closed form approximation for the EEE in quasi-static Nakagami-$m$ (and Rayleigh as sub-case) fading channels as a function of power, error probability, and latency. Furthermore, we characterize the QoS constrained EEE maximization problem for different power consumption models, which shows a significant difference between finite and infinite blocklength coding with respect to EEE and optimal power allocation strategy. As asserted in the literature, achieving ultra-reliability using one transmission consumes huge amount of power, which is not applicable for energy limited IoT devices. In this context, accounting for empty buffer probability in machine type communication (MTC) and extending the maximum delay tolerance jointly enhances the EEE and allows for adaptive retransmission of faulty packets. Our analysis reveals that obtaining the optimum error probability for each transmission by minimizing the non-empty buffer probability approaches EEE optimality, while being analytically tractable via Dinkelbachs algorithm. Furthermore, the results illustrate the power saving and the significant EEE gain attained by applying adaptive retransmission protocols, while sacrificing a limited increase in latency.
Age-of-information is a novel performance metric in communication systems to indicate the freshness of the latest received data, which has wide applications in monitoring and control scenarios. Another important performance metric in these applicatio
ns is energy consumption, since monitors or sensors are usually energy constrained. In this paper, we study the energy-age tradeoff in a status update system where data transmission from a source to a receiver may encounter failure due to channel error. As the status sensing process consumes energy, when a transmission failure happens, the source may either retransmit the existing data to save energy for sensing, or sense and transmit a new update to minimize age-of-information. A threshold-based retransmission policy is considered where each update is allowed to be transmitted no more than M times. Closed-form average age-of-information and energy consumption is derived and expressed as a function of channel failure probability and maximum number of retransmissions M. Numerical simulations validate our analytical results, and illustrate the tradeoff between average age-of-information and energy consumption.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
