935 research outputs found
Average age of information with hybrid ARQ under a resource constraint
Scheduling the transmission of status updates over an error-prone communication channel is studied in order to minimize the long-term average age of information (AoI) at the destination under a constraint on the average number of transmissions at the source node. After each transmission, the source receives an instantaneous ACK/NACK feedback, and decides on the next update without prior knowledge on the success of future transmissions. First, the optimal scheduling policy is studied under different feedback mechanisms when the channel statistics are known; in particular, the standard automatic repeat request (ARQ) and hybrid ARQ (HARQ) protocols are considered. Then, for an unknown environment, an average-cost reinforcement learning (RL) algorithm is proposed that learns the system parameters and the transmission policy in real time. The effectiveness of the proposed methods are verified through numerical simulations
Green Communication via Power-optimized HARQ Protocols
Recently, efficient use of energy has become an essential research topic for
green communication. This paper studies the effect of optimal power controllers
on the performance of delay-sensitive communication setups utilizing hybrid
automatic repeat request (HARQ). The results are obtained for repetition time
diversity (RTD) and incremental redundancy (INR) HARQ protocols. In all cases,
the optimal power allocation, minimizing the outage-limited average
transmission power, is obtained under both continuous and bursting
communication models. Also, we investigate the system throughput in different
conditions. The results indicate that the power efficiency is increased
substantially, if adaptive power allocation is utilized. For instance, assume
Rayleigh-fading channel, a maximum of two (re)transmission rounds with rates
nats-per-channel-use and an outage probability constraint
. Then, compared to uniform power allocation, optimal power
allocation in RTD reduces the average power by 9 and 11 dB in the bursting and
continuous communication models, respectively. In INR, these values are
obtained to be 8 and 9 dB, respectively.Comment: Accepted for publication on IEEE Transactions on Vehicular Technolog
Reliable Transmission of Short Packets through Queues and Noisy Channels under Latency and Peak-Age Violation Guarantees
This work investigates the probability that the delay and the peak-age of
information exceed a desired threshold in a point-to-point communication system
with short information packets. The packets are generated according to a
stationary memoryless Bernoulli process, placed in a single-server queue and
then transmitted over a wireless channel. A variable-length stop-feedback
coding scheme---a general strategy that encompasses simple automatic repetition
request (ARQ) and more sophisticated hybrid ARQ techniques as special
cases---is used by the transmitter to convey the information packets to the
receiver. By leveraging finite-blocklength results, the delay violation and the
peak-age violation probabilities are characterized without resorting to
approximations based on large-deviation theory as in previous literature.
Numerical results illuminate the dependence of delay and peak-age violation
probability on system parameters such as the frame size and the undetected
error probability, and on the chosen packet-management policy. The guidelines
provided by our analysis are particularly useful for the design of low-latency
ultra-reliable communication systems.Comment: To appear in IEEE journal on selected areas of communication (IEEE
JSAC
Peak-Age Violation Guarantees for the Transmission of Short Packets over Fading Channels
We investigate the probability that the peak age of information in a
point-to-point communication system operating over a multiantenna wireless
fading channel exceeds a predetermined value. The packets are scheduled
according to a last-come first-serve policy with preemption in service, and are
transmitted over the channel using a simple automatic repetition request
protocol. We consider quadrature phase shift keying modulation, pilot-assisted
transmission, maximum-likelihood channel estimation, and mismatched scaled
nearest-neighbor decoding. Our analysis, which exploits nonasymptotic tools in
information theory, allows one to determine, for a given information packet
size, the physical layer parameters such as the SNR, the number of transmit and
receive antennas, the amount of frequency diversity to exploit, and the number
of pilot symbols, to ensure that the system operates below a target peak-age
violation probability.Comment: 6 pages, 6 figures. To be presented at Infocom 201
On the Performance of NOMA with Hybrid ARQ
In this paper, we investigate the outage performance of hybrid automatic
repeat request with chase combining (HARQ-CC) assisted downlink non-orthogonal
multiple access (NOMA) systems. A closed-form expression of the individual
outage probability and the diversity gain are obtained firstly. Based on the
developed analytical outage probability, a tradeoff between the minimum number
of retransmissions and the transmit power allocation coefficient is then
provided for a given target rate. The provided simulation results demonstrate
the accuracy of the developed analytical results. Moreover, it is shown that
NOMA combined with the HARQ-CC can achieve a significant advantage when only
average channel state information is known at the transmitter. Particularly,
the performance of the user with less transmit power in NOMA systems can be
efficiently improved by utilizing HARQ-CC
Resource allocation for transmit hybrid beamforming in decoupled millimeter wave multiuser-MIMO downlink
This paper presents a study on joint radio resource allocation and hybrid precoding in multicarrier massive multiple-input multiple-output communications for 5G cellular networks. In this paper, we present the resource allocation algorithm to maximize the proportional fairness (PF) spectral efficiency under the per subchannel power and the beamforming rank constraints. Two heuristic algorithms are designed. The proportional fairness hybrid beamforming algorithm provides the transmit precoder with a proportional fair spectral efficiency among users for the desired number of radio-frequency (RF) chains. Then, we transform the number of RF chains or rank constrained optimization problem into convex semidefinite programming (SDP) problem, which can be solved by standard techniques. Inspired by the formulated convex SDP problem, a low-complexity, two-step, PF-relaxed optimization algorithm has been provided for the formulated convex optimization problem. Simulation results show that the proposed suboptimal solution to the relaxed optimization problem is near-optimal for the signal-to-noise ratio SNR <= 10 dB and has a performance gap not greater than 2.33 b/s/Hz within the SNR range 0-25 dB. It also outperforms the maximum throughput and PF-based hybrid beamforming schemes for sum spectral efficiency, individual spectral efficiency, and fairness index
- …