Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEffective Capacity for Renewal Service Processes with Applications to HARQ Systems
103
0
0.0
(
0
)
Added by
Zheng Shi
Publication date
2018
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Considering the widespread use of effective capacity in cross-layer design and the extensive existence of renewal service processes in communication networks, this paper thoroughly investigates the effective capacity for renewal processes. Based on Z-transform, we derive exact analytical expressions for the effective capacity at a given quality of service (QoS) exponent for both the renewal processes with constant reward and with variable rewards. Unlike prior literature that the effective capacity is approximated with no many insightful discussions, our expression is simple and reveals further meaningful results, such as the monotonicity and bounds of effective capacity. The analytical results are then applied to evaluate the cross-layer throughput for diverse hybrid automatic repeat request (HARQ) systems, including fixed-rate HARQ (FR-HARQ, e.g., Type I HARQ, HARQ with chase combining (HARQ-CC) and HARQ with incremental redundancy (HARQ-IR)), variable-rate HARQ (VR-HARQ) and cross-packet HARQ (XP-HARQ). Numerical results corroborate the analytical ones and prove the superiority of our proposed approach. Furthermore, targeting at maximizing the effective capacity via the optimal rate selection, it is revealed that VR-HARQ and XP-HARQ attain almost the same performance, and both of them perform better than FR-HARQ.
rate research
Read More
The channel law for amplitude-modulated solitons transmitted through a nonlinear optical fibre with ideal distributed amplification and a receiver based on the nonlinear Fourier transform is a noncentral chi-distribution with $2n$ degrees of freedom, where $n=2$ and $n=3$ correspond to the single- and dual-polarisation cases, respectively. In this paper, we study capacity lower bounds of this channel under an average power constraint in bits per channel use. We develop an asymptotic semi-analytic approximation for a capacity lower bound for arbitrary $n$ and a Rayleigh input distribution. It is shown that this lower bound grows logarithmically with signal-to-noise ratio (SNR), independently of the value of $n$. Numerical results for other continuous input distributions are also provided. A half-Gaussian input distribution is shown to give larger rates than a Rayleigh input distribution for $n=1,2,3$. At an SNR of $25$ dB, the best lower bounds we developed are approximately $3.68$ bit per channel use. The practically relevant case of amplitude shift-keying (ASK) constellations is also numerically analysed. For the same SNR of $25$ dB, a $16$-ASK constellation yields a rate of approximately $3.45$ bit per channel use.
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. First, 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.
In this paper, a framework is proposed to simplify solving the infinite horizon average cost problem for the weakly coupled multi-dimensional systems. Specifically, to address the computational complexity issue, we first introduce a virtual continuous time system (VCTS) and obtain the associated fluid value function. The relationship between the VCTS and the original discrete time system is further established. To facilitate the low complexity distributed implementation and address the coupling challenge, we model the weakly coupled system as a perturbation of a decoupled base system and study the decoupled base system. The fluid value function of the VCTS is approximated by the sum of the per-flow fluid value functions and the approximation error is established using perturbation analysis. Finally, we obtain a low complexity distributed solution based on the per-flow fluid value function approximation. We apply the framework to solve a delay-optimal control problem for the K-pair interference networks and obtain a distributed power control algorithm. The proposed algorithm is compared with various baseline schemes through simulations and it is shown that significant delay performance gain can be achieved.
Multibeam high throughput satellite (MB-HTS) systems will play a key role in delivering broadband services to a large number of users with diverse Quality of Service (QoS) requirements. This paper focuses on MB-HTS where the same spectrum is re-used by all user links and, in particular, we propose a novel user scheduling design capable to provide guarantees in terms of individual QoS requirements while maximizing the system throughput. This is achieved by precoding to mitigate mutual interference. The combinatorial optimization structure requires an extremely high cost to obtain the global optimum even with a reduced number of users. We, therefore, propose a heuristic algorithm yielding a good local solution and tolerable computational complexity, applicable for large-scale networks. Numerical results demonstrate the effectiveness of our proposed algorithm on scheduling many users with better sum throughput than the other benchmarks. Besides, the QoS requirements for all scheduled users are guaranteed.
Transfer entropy has been used to quantify the directed flow of information between source and target variables in many complex systems. While transfer entropy was originally formulated in discrete time, in this paper we provide a framework for considering transfer entropy in continuous time systems, based on Radon-Nikodym derivatives between measures of complete path realizations. To describe the information dynamics of individual path realizations, we introduce the pathwise transfer entropy, the expectation of which is the transfer entropy accumulated over a finite time interval. We demonstrate that this formalism permits an instantaneous transfer entropy rate. These properties are analogous to the behavior of physical quantities defined along paths such as work and heat. We use this approach to produce an explicit form for the transfer entropy for pure jump processes, and highlight the simplified form in the specific case of point processes (frequently used in neuroscience to model neural spike trains). Finally, we present two synthetic spiking neuron model examples to exhibit the pertinent features of our formalism, namely, that the information flow for point processes consists of discontinuous jump contributions (at spikes in the target) interrupting a continuously varying contribution (relating to waiting times between target spikes). Numerical schemes based on our formalism promise significant benefits over existing strategies based on discrete time formalisms.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
