Table of Contents
Fetching ...

Rate Adaptation in Delay-Sensitive and Energy-Constrained Large-Scale IoT Networks

Mostafa Emara, Nour Kouzayha, Hesham ElSawy, Tareq Y. Al-Naffouri

TL;DR

The paper tackles rate adaptation for delay-sensitive, energy-constrained IoT in large-scale networks by explicitly modeling imperfect feedback. It develops a coupled spatiotemporal framework that combines stochastic geometry with absorbing Markov chains to analyze CLRA and OLRA schemes, using a beta-approximated meta-distribution for forward fragment delivery and a closed-form expression for feedback success. The key contributions include a detailed CLRA/OLRA analysis under feedback impairments, a discretized FSD-class approach for tractable evaluation, and quantitative comparisons of PSD, latency, and energy, validated by Monte Carlo simulations. The results show fragmentation improves reliability but increases latency, while OLRA can substantially reduce receiver energy consumption, albeit at some loss in reliability depending on feedback quality. Overall, the work provides design insights for rate adaptation strategies in IoT networks balancing reliability, delay, and energy under realistic feedback conditions.

Abstract

Feedback transmissions are used to acknowledge correct packet reception, trigger erroneous packet re-transmissions, and adapt transmission parameters (e.g., rate and power). Despite the paramount role of feedback in establishing reliable communication links, the majority of the literature overlooks its impact by assuming genie-aided systems relying on flawless and instantaneous feedback. An idealistic feedback assumption is no longer valid for large-scale Internet of Things (IoT), which has energy-constrained devices, susceptible to interference, and serves delay-sensitive applications. Furthermore, feedback-free operation is necessitated for IoT receivers with stringent energy constraints. In this context, this paper explicitly accounts for the impact of feedback in energy-constrained and delay-sensitive large-scale IoT networks. We consider a time-slotted system with closed-loop and open-loop rate adaptation schemes, where packets are fragmented to operate at a reliable transmission rate satisfying packet delivery deadlines. In the closed-loop scheme, the delivery of each fragment is acknowledged through an error-prone feedback channel. The open-loop scheme has no feedback mechanism, and hence, a predetermined fragment repetition strategy is employed to improve transmission reliability. Using tools from stochastic geometry and queueing theory, we develop a novel spatiotemporal framework to optimize the number of fragments for both schemes and repetitions for the open-loop scheme. To this end, we quantify the impact of feedback on the network performance in terms of transmission reliability, latency, and energy consumption.

Rate Adaptation in Delay-Sensitive and Energy-Constrained Large-Scale IoT Networks

TL;DR

The paper tackles rate adaptation for delay-sensitive, energy-constrained IoT in large-scale networks by explicitly modeling imperfect feedback. It develops a coupled spatiotemporal framework that combines stochastic geometry with absorbing Markov chains to analyze CLRA and OLRA schemes, using a beta-approximated meta-distribution for forward fragment delivery and a closed-form expression for feedback success. The key contributions include a detailed CLRA/OLRA analysis under feedback impairments, a discretized FSD-class approach for tractable evaluation, and quantitative comparisons of PSD, latency, and energy, validated by Monte Carlo simulations. The results show fragmentation improves reliability but increases latency, while OLRA can substantially reduce receiver energy consumption, albeit at some loss in reliability depending on feedback quality. Overall, the work provides design insights for rate adaptation strategies in IoT networks balancing reliability, delay, and energy under realistic feedback conditions.

Abstract

Feedback transmissions are used to acknowledge correct packet reception, trigger erroneous packet re-transmissions, and adapt transmission parameters (e.g., rate and power). Despite the paramount role of feedback in establishing reliable communication links, the majority of the literature overlooks its impact by assuming genie-aided systems relying on flawless and instantaneous feedback. An idealistic feedback assumption is no longer valid for large-scale Internet of Things (IoT), which has energy-constrained devices, susceptible to interference, and serves delay-sensitive applications. Furthermore, feedback-free operation is necessitated for IoT receivers with stringent energy constraints. In this context, this paper explicitly accounts for the impact of feedback in energy-constrained and delay-sensitive large-scale IoT networks. We consider a time-slotted system with closed-loop and open-loop rate adaptation schemes, where packets are fragmented to operate at a reliable transmission rate satisfying packet delivery deadlines. In the closed-loop scheme, the delivery of each fragment is acknowledged through an error-prone feedback channel. The open-loop scheme has no feedback mechanism, and hence, a predetermined fragment repetition strategy is employed to improve transmission reliability. Using tools from stochastic geometry and queueing theory, we develop a novel spatiotemporal framework to optimize the number of fragments for both schemes and repetitions for the open-loop scheme. To this end, we quantify the impact of feedback on the network performance in terms of transmission reliability, latency, and energy consumption.
Paper Structure (20 sections, 7 theorems, 31 equations, 8 figures, 1 table)

This paper contains 20 sections, 7 theorems, 31 equations, 8 figures, 1 table.

Key Result

Lemma 1

The transition matrix $\tilde{\boldsymbol{P}}_{\text{CLRA}}^{(m)}$ describing the absorbing MC for a generic packet sent from an $m$-FSD class IoT device consists of the submatrices $\boldsymbol{Q}^{(m)}_{t,\text{CLRA}}$ and $\boldsymbol{H}^{(m)}_{t,\text{CLRA}}$ for an arbitrary tuple $(n, T)$, whi where the elements of the matrices $\boldsymbol{QG}_{t}^{(m)}$, $\boldsymbol{QU}_{t}^{(m)}$ and $\b

Figures (8)

  • Figure 1: (a) Snapshot of the network. Nodes, squares, and dashed lines represent transmitters, receivers, and Tx/Rx links, respectively. The test Tx/Rx is red-colored and surrounded by HPF of interferers where the active Tx/Rx links are blue-colored and inactive ones are green-colored. (b) The activity of the test Tx/Rx link. The test transmitter has a buffer for the packet fragments. The fragment is successfully delivered with probability $\rm p_n$. (c) CLRA transmission scheme in the case of packet successful delivery. (d) OLRA transmission scheme in the case of packet successful delivery. Considering a packet of $n = 3$ fragments, indexed by $\{a,b,c\}$, and fragment repetition of $3$ times, indexed by $\{x_1, x_2, x_3\}$ for $x \in \{a,b,c\}$.
  • Figure 2: The absorbing MC of the CLRA scheme. The packet consists of $n=3$ fragments, denoted by $\{\text{a,b,c}\}$, and the packet deadline $T=8$.
  • Figure 3: The absorbing MC of the OLRA scheme. The packet consists of $n=3$ fragments, denoted as $\{a,b,c\}$ and the packet deadline $T=11$. So, $\kappa=\lfloor T/n\rfloor = 3$, and $\tau=\mod(T,n)=2$. Hence, each fragment is sent $\kappa$ times while $\tau=2$ fragments are randomly chosen to be sent one more time. We assume that $\{a,c\}$ are the selected fragments. The subscript in $x_i, x \in \{a,b,c\}$ denotes the $i$th decoding attempt.
  • Figure 4: Meta distribution of the FSD at different transmission rates $R_n,\, n\in\{1,\cdots,4\}$.
  • Figure 5: PSD probability and mean latency for OLRA transmission schemes.
  • ...and 3 more figures

Theorems & Definitions (12)

  • Definition 1: CLRA PSD
  • Definition 2: CLRA Packet Delivery Failure
  • Definition 3: OLRA PSD
  • Definition 4: OLRA Packet Delivery Failure
  • Lemma 1: CLRA Transition Matrix
  • Lemma 2: OLRA Transition Matrix
  • Remark 1
  • Lemma 3: Moments of FSD probability
  • Lemma 4: Feedback success probability
  • Theorem 1
  • ...and 2 more