The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Ensuring a high customer satisfaction by monitoring Quality of Experience (QoE) aspects has become common practice for service providers. Such monitoring solutions, together with underlying QoE models, are mostly limited to measures captured in the core or access network and may thus neglect the QoE impact of recovery mechanisms deployed at client-side, e.g., FEC or ARQ. This limitation makes QoE...
The probability of instantaneous accepted packet error outage (IAPEO) is proposed as a performance measure for packet transmission with automatic-repeat-request (ARQ) schemes over wireless channels. It is defined as the probability that the instantaneous accepted packet error probability (IAPEP) exceeds an IAPEP threshold. We obtain a closed-form upper bound expression for IAPEO of a pure ARQ over...
In contrast to the outage analysis, the packet error rates (PERs) of two types of cooperative automatic retransmission request (ARQ) protocols with opportunistic selective amplified-and-forward (OSAF) relaying are investigated from the perspective of the maximum likelihood sequence detection (MLSD). The results show that PERs with the threshold requirements derived from the outage analysis cannot...
Most studies on hybrid automatic repeat request (HARQ) with respect to rate adaptation have been focused on throughput maximization. However, for real-time traffic, resource minimization is a more efficient rate adaptation method in OFDMA-based systems. Moreover, most previous work have dealt with either slow or fast fading channel although practical wireless channels typically exhibit a time-correlated...
We study optimal transmission strategies in interfering wireless networks, under Quality of Service constraints. A buffered, dynamic network with multiple sources is considered, and sources use a retransmission strategy in order to improve packet delivery probability. The optimization problem is formulated as a Markov Decision Process, where constraints and objective functions are ratios of time-averaged...
In this paper, we present a practical and provably secure two-way wireless communication scheme in the presence of a passive eavesdropper. The scheme implements a randomized scheduling and power allocation mechanism, where each legitimate node transmits in random time slots and with random transmit power. Such randomization results in ambiguity at the eavesdropper with regard to the origin of each...
We consider the problem of multicasting from a single source to multiple destinations over the erasure channel. We are interested in energy efficient communication. Our performance metric is the number of bits sent per joule of energy spent until a finite amount of packets is delivered from the source to all destinations. We compare the performance of Random Linear Network Coding (RLNC) and Automatic...
In this paper we introduce a novel Automatic Repeat reQuest (ARQ) scheme for cooperative wireless networks. Our scheme adopts network coding techniques in order to enhance the total bandwidth of the network by minimizing the total number of transmissions. The performance of the proposed approach is evaluated by means of computer simulations and compared to other cooperative schemes, while an analytical...
Interference in wireless networks is one of the key capacity-limiting factors. Recently developed interference-embracing techniques show promising performance on turning collisions into useful transmissions. However, the interference-embracing techniques are hard to apply in practical applications due to their strict requirements. In this paper, we consider utilizing the interference-embracing techniques...
Theoretical analysis has long indicated that feedback improves the error exponent but not the capacity of memoryless Gaussian channels. Recently, Chen et al. demonstrated that an incremental redundancy scheme can use noiseless feedback to help short convolutional codes deliver the bit-error-rate performance of a long blocklength turbo code, but with much lower latency. Such a latency improvement is...
In this paper we propose framework for energy efficient (margin adaptive, MA) resource allocation in multiuser SC-FDMA under synchronous HARQ constraints. Resource allocation is formulated as a two-stage problem where resources are allocated in both time and frequency. To limit the impact of retransmissions on the time-frequency problem segmentation, we propose use of a block scheduling interval that...
Mobile internet devices are among the fastest growing markets in consumer electronics. A big issue with these devices is the low battery capacity that requires the user to recharge the device regularly. This paper aims to reduce the energy consumption of LTE modems used in future devices. For this, the LTE HARQ process is modeled as a Markov chain and a simple generic model for energy consumption...
We present in this paper the evaluation of the energy consumption of PRCSMA, an 802.11-based medium access control protocol designed to coordinate the retransmissions from the relays in a wireless network implementing a Cooperative Automatic Retransmission Request (C-ARQ) scheme. A comparison in terms of energy efficiency with non-cooperative ARQ schemes (retransmissions performed only from the source)...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.