Joint Sum Rate and Error Probability Optimization: Finite Blocklength Analysis

Haghifam, Mahdi; Mili, Mohammad Robat; Makki, Behrooz; Nasiri-Kenari, Masoumeh; Svensson, Tommy

doi:10.1109/lwc.2017.2736539

Cited by 29 publications

(11 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, depending on the Reader energy budget and the number of nodes, the BCN may be of interest in the cases with short packets and low order modulations. For this reason, using the fundamental results of [31]- [35] on the achievable rates of short packets, one can investigate the effect of the finite length codewords on system performance. Particularly, with short packets, one can replace (6) with [31, Theorem 45]…”

Section: Implementation Considerationsmentioning

confidence: 99%

“…Furthermore, considering each utility function, we solve the corresponding data admission problem and find closed-form solutions. Finally, 1) we use the results on the achievable rates of finite blocklength codes [31]- [35] to study the system performance in the cases with short packets, 2) analyze the performance of the BCNs in the cases with different modulation schemes, and 3) verify the effect of the BNs circuit power consumption on the achievable throughput.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On Energy Allocation and Data Scheduling in Backscatter Networks With Multi-Antenna Readers

Movahednasab

Pakravan

Makki

et al. 2021

IEEE Open J. Commun. Soc.

Self Cite

View full text Add to dashboard Cite

In this paper, we study the throughput utility functions in buffer-equipped monostatic backscatter communication networks with multi-antenna Readers. In the considered model, the backscatter nodes (BNs) store the data in their buffers before transmission to the Reader. We investigate three utility functions, namely, the sum, the proportional and the common throughput. We design online admission policies, corresponding to each utility function, to determine how much data can be admitted in the buffers. Moreover, we propose an online data link control policy for jointly controlling the transmit and receive beamforming vectors as well as the reflection coefficients of the BNs. The proposed policies for data admission and data link control jointly optimize the throughput utility, while stabilizing the buffers. We adopt the min-drift-plus-penalty (MDPP) method in designing the control policies. Following the MDPP method, we cast the optimal data link control and the data admission policies as solutions of two independent optimization problems which should be solved in each time slot. The optimization problem corresponding to the data link control is non-convex and does not have a trivial solution. Using Lagrangian dual and quadratic transforms, we find a closed-form iterative solution. Finally, we use the results on the achievable rates of finite blocklength codes to study the system performance in the cases with short packets. As demonstrated, the proposed policies achieve optimal utility and stabilize the data buffers in the BNs.

show abstract

Section: Implementation Considerationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

On Energy Allocation and Data Scheduling in Backscatter Networks With Multi-Antenna Readers

Movahednasab

Pakravan

Makki

et al. 2021

IEEE Open J. Commun. Soc.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Here, we consider BCNs with BNs located circularly around the Reader. Using the fundamental results of [31]- [34] on the achievable rates of short packets, we replace (6) with [31,Theorem 45],…”

Section: A Finite Blocklength Analysis Of the Proposed Schemementioning

confidence: 99%

On Energy Allocation and Data Scheduling in Backscatter Networks with Multi-antenna Readers

Movahednasab¹,

Pakravan²,

Makki³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

In this paper, we study the throughput utility functions in buffer-equipped monostatic backscatter communication networks with multi-antenna Readers. In the considered model, the backscatter nodes (BNs) store the data in their buffers before transmission to the Reader. We investigate three utility functions, namely, the sum, the proportional and the common throughput. We design online admission policies, corresponding to each utility function, to determine how much data can be admitted in the buffers. Moreover, we propose an online data link control policy for jointly controlling the transmit and receive beamforming vectors as well as the reflection coefficients of the BNs. The proposed policies for data admission and data link control jointly optimize the throughput utility, while stabilizing the buffers.We adopt the min-drift-plus-penalty (MDPP) method in designing the control policies. Following the MDPP method, we cast the optimal data link control and the data admission policies as solutions of two independent optimization problems which should be solved in each time slot. The optimization problem corresponding to the data link control is non-convex and does not have a trivial solution. Using Lagrangian dual and quadratic transforms, we find a closed-form iterative solution. Finally, we use the results on the achievable rates of finite blocklength codes to study the system performance in the cases with short packets. As demonstrated, the proposed policies achieve optimal utility and stabilize the data buffers in the BNs.

show abstract

“…Finally, the closed-form approximation forR can be derived by usingR = (1 − ǫ) C − β m,ǫ E √ V and is given in (11).…”

Section: Appendix B: Proof Of Theoremmentioning

confidence: 99%

“…With sufficient studies in classical cognitive radio networks, the applications of opportunistic spectrum access and corresponding access protocols in supporting URLLC scenarios remain inadequate [8]- [10]. For example, resource allocation strategies were analyzed and investigated in [11]- [13], aiming to improve system performance metrics in URLLC scenarios, such as energy efficiency and total transmission rate. However, the above mentioned papers mainly focused on providing efficient resource allocation algorithms, rather than proposing the analytical closed-form expressions and investigating the impact of different system parameters.…”

Section: Introductionmentioning

confidence: 99%

Opportunistic Spectrum Access in Support of Ultra-Reliable and Low Latency Communications

Quddus

Vahid

et al. 2018

2018 IEEE Globecom Workshops (GC Wkshps)

View full text Add to dashboard Cite

This paper addresses the problem of opportunistic spectrum access in support of mission-critical ultra-reliable and low latency communications (URLLC). Considering the ability of supporting short packet transmissions in URLLC scenarios, a new capacity metric in finite blocklength regime is introduced as the traditional performance metrics such as ergodic capacity and outage capacity are no longer applicable. We focus on an opportunistic spectrum access system in which the secondary user (SU) opportunistically occupies the frequency resources of the primary user (PU) and transmits reliable short packets to its destination. An achievable rate maximization problem is then formulated for the SU in supporting URLLC services, subject to a probabilistic received-power constraint at the PU receiver and imperfect channel knowledge of the SU-PU link. To tackle this problem, an optimal power allocation policy is proposed. Closedform expressions are then derived for the maximum achievable rate in finite blocklength regime, the approximate transmission rate at high signal-to-noise ratios (SNRs) and the optimal average power. Numerical results validate the accuracy of the proposed closed-form expressions and further reveal the impact of channel estimation error, block error probability, finite blocklength and received-power constraint.Index Terms-URLLC, spectrum sharing, finite blocklength, achievable coding rate, imperfect channel information.

show abstract

Joint Sum Rate and Error Probability Optimization: Finite Blocklength Analysis

Cited by 29 publications

References 8 publications

On Energy Allocation and Data Scheduling in Backscatter Networks With Multi-Antenna Readers

On Energy Allocation and Data Scheduling in Backscatter Networks With Multi-Antenna Readers

On Energy Allocation and Data Scheduling in Backscatter Networks with Multi-antenna Readers

Opportunistic Spectrum Access in Support of Ultra-Reliable and Low Latency Communications

Contact Info

Product

Resources

About