betaFeedback

WorksComputer Science

Energy-Efficient Timely Relevant IoT Data Retrieval with Wireless Memory Approximation

Abstract

Collecting relevant data from Internet of Things devices under freshness and energy constraints is a key challenge in 6G edge networks. A lightweight neural network on the device filters irrelevant observations, but storing it in dynamic random access memory consumes refresh energy during standby. This letter proposes a pull-based framework where an edge server remotely activates and approximates memory and jointly selects the activation timing, refresh period, model size, and transmission threshold. We derive the expected freshness and energy over erasure channels in closed form and show that the scheme consumes less energy than an always-on baseline under the same freshness constraint.

Introduction

Internet of Things (IoT) networks collect multimodal sensory data to support emerging applications such as wildlife monitoring [1] and the remote control of mobile robots [2]. Because such data has complex patterns, a lightweight neural network (NN) on the IoT device can process observations locally and transmit only the data relevant to a given task, which reduces transmission energy [3], [4]. The computation cost this adds is incurred only per inference and is offset by the transmission cost it saves. Keeping the model in dynamic random access memory (DRAM), by contrast, consumes energy continuously through periodic refresh, even during standby [5]. This standby refresh cost has been overlooked in protocol design for 6G applications.

DRAM approximation lengthens the refresh period to reduce this refresh energy at the cost of a controlled level of bit errors [6, 7, 8]. Existing schemes adapt the refresh rate to data criticality [6] or to a user-specified quality level in smart-camera and multiview inference systems [9], [10]. However, none of them adapts the approximation to the receiver’s time-varying goals or to the relevance of the stored model to the current task, so the device keeps refreshing a model that no task requires.

To address this, the framework of wireless memory activation and approximation [5] lets an edge server (ES) remotely activate DRAM only when a relevant model is needed and set its refresh period according to the required approximation level. The device then spends refresh energy only when a task requires the model, and only on that model. This framework, however, does not address the energy-efficient retrieval of timely relevant data under a deadline. In particular, it accounts for neither the semantic relevance filtering performed at the device nor the model size.

This letter studies energy-efficient retrieval of timely and relevant data from a single IoT device by a deadline, a problem central to decision-making in applications such as rescue robotics and wildlife monitoring. We adopt the framework of [5] and extend it as follows: ii) we design a new energy-efficient communication framework and protocol that integrate memory, computation, and communication; iiii) we introduce an analytical model of the energy consumption of the IoT device and adopt a goal-oriented metric, the Grade of Effectiveness (GoE) [11], which captures the Age of Information (AoI) [12] of the freshest relevant observation at the deadline; iiiiii) we derive the expected GoE and energy consumption in closed form, jointly select the activation timing, refresh period, model size, and threshold for semantic filtering under a freshness constraint, and quantify the energy savings over an always-on baseline. This work is the first to tailor wireless memory activation and approximation to timely relevant data retrieval and to design an energy-efficient protocol that accounts for the interaction among memory, computation, and communication. Especially, compared with [5], this work newly investigates optimal selection of NN and threshold of semantic filtering for wireless memory approximation considering trade-off between energy consumption and information freshness with respect to the deadline based on our derived equations.

System Model

We consider a scenario in which an ES retrieves data from a single IoT device through a semantic query [1], which requires on-device inference. Figure 1 shows a configuration of the IoT device considered in this paper. The device has a vision sensor, a radio, non-volatile storage that holds a set of task-specific models M={Φ1,…,Φ∣M∣}\mathcal{M} = \{\Phi_1, \ldots, \Phi_{|\mathcal{M}|}\} of different sizes, and volatile DRAM that holds the active model Φ∈M\Phi\in\mathcal{M} for on-device inference with on-chip static random access memory (SRAM).

Image not extracted

Figure 1. A configuration of the IoT device under wireless memory activation and approximation.

Figure 2(a) shows the pull-based communication setup. Each episode is triggered by a query request from the cloud and occurs at random, infrequent instants. The request specifies the content of interest X\mathcal{X} (e.g., a desired bird), a deadline TT, and a freshness requirement Δth∈(0,∞)\Delta_{\mathrm{th}} \in(0,\infty). We focus on a single episode, which starts at t=0t = 0. During the episode, the vision sensor samples the environment with period TsT_s, which exceeds the time to transmit a single image.

Image not extracted

Figure 2. (a) Communication setup; (b) timely relevant data retrieval from a single IoT device. Images I1I_1, I3I_3, and I6I_6 are relevant, and I6I_6 is the freshest at TT.

To reduce the refresh energy, we adopt the wireless memory activation and approximation framework of [5], illustrated in Figure 2(b). When a new episode begins, the ES decides when to transmit the memory activation signal based on the deadline TT, and sends it ζ\zeta seconds after the episode begins. The signal identifies the relevant model by embedding its identity (ID). If the device detects the signal and the embedded ID matches one stored locally, it loads the corresponding model Φ\Phi from storage into DRAM and begins processing its new observations, so DRAM is activated on demand and consumes no refresh energy before activation. The ES then sets the refresh period to τ\tau, where a longer τ\tau saves refresh energy at the cost of greater degradation of the model held in DRAM.

After memory activation, the ES transmits the threshold VthV_{\mathrm{th}} and a semantic query, which embeds the desired content as a feature vector q=Φref(xq)∈RJ\mathbf{q} = \Phi_{\mathrm{ref}}(\mathbf{x}_q) \in\mathbb{R}^{J}, where xq\mathbf{x}_q is a query example and Φref\Phi_{\mathrm{ref}} is a reference model at the ES. On receiving the query, the device evaluates the relevance of each new observation with the activated model Φ\Phi and transmits the observation if its similarity measure is at least VthV_{\mathrm{th}}, as detailed in Sec. II-A2. We assume the downlink (DL) and uplink (UL) channels are erasure channels, in which packet loss occurs with probability peDLp_{\mathrm{e}}^{\mathrm{DL}} and peULp_{\mathrm{e}}^{\mathrm{UL}}, respectively, without retransmission within an episode. We denote by TΣT_{\Sigma} the total overhead from the activation signal to the start of processing, which comprises the DL reception and the model loading.

Observation Model

Let MpreM_{\mathrm{pre}} and MpostM_{\mathrm{post}} be the numbers of images that the IoT device captures before and after the memory activation, respectively, given by Mpre=⌊ζ+TΣTs⌋M_{\mathrm{pre}} = \left\lfloor\frac{\zeta+T_{\Sigma}}{T_s} \right\rfloor and Mpost=⌊T−ζ−TΣTs⌋M_{\mathrm{post}} = \left\lfloor\frac{T-\zeta-T_{\Sigma}}{T_s} \right\rfloor. The total number of images in the episode is M=Mpre+MpostM = M_{\mathrm{pre}} + M_{\mathrm{post}}. The images captured after memory activation are denoted by D=[xMpre+1,…,xM]T\mathcal{D} = [\mathbf{x}_{M_{\mathrm{pre}}+1}, \ldots, \mathbf{x}_M]^{\mathsf{T}}. Here, xm∈RdC×dH×dW\mathbf{x}_m \in\mathbb{R}^{d_C \times d_H \times d_W} is the mm-th image, where dCd_C, dHd_H, and dWd_W are the number of channels, height, and width, respectively.

  1. DRAM Retention Accuracy: Because DRAM cells store data as charge on leaking capacitors, DRAM must be refreshed periodically to retain the data. Let τ0\tau_0 denote the nominal refresh period, which retains the data without error.

For τ>τ0\tau> \tau_0, bit errors may occur in each refresh interval, as measured in [7]. Following [5], we model the bit error probability of a single refresh interval as Pe(τ)=12[1−exp⁡(−(τ−τ0)/γ)]∈[0,0.5]P_{\mathrm{e}}(\tau) = \frac{1}{2}[1-\exp(-(\tau-\tau_0)/\gamma)] \in[0,0.5], where γ\gamma is a hardware-specific constant, and a smaller γ\gamma gives faster memory degradation. The number of refresh operations between memory activation and the mm-th sample, denoted by wmw_m, is

wm=∑m′=Mpre+1m⌈m′Tsτ⌉−⌊(m′−1)Tsτ⌋.w_m = \sum_{m'=M_{\mathrm{pre}}+1}^{m} \left\lceil\frac{m'T_s}{\tau} \right\rceil- \left\lfloor\frac{(m'-1)T_s}{\tau} \right\rfloor.

Then, the bit error probability after wmw_m refresh operations is Pˉe(wm,τ)=12[1−(1−2Pe(τ))wm]\bar{P}_{\mathrm{e}}(w_m,\tau) = \frac{1}{2}[1-(1-2P_{\mathrm{e}}(\tau))^{w_m}].

  1. Similarity Measure: To infer the relevance of each observed image to the current task, the IoT device computes a similarity measure with the active model Φ\Phi, as in [1], [3], [4]. We assume Φ\Phi is a feature extractor that maps an image x\mathbf{x} to a feature vector y=Φ(x)∈RJ\mathbf{y} = \Phi(\mathbf{x}) \in\mathbb{R}^{J}. Let g(⋅,⋅)g(\cdot,\cdot) be a similarity function. Then, the observed similarity of the mm-th image xm\mathbf{x}_m, denoted by zm∈[0,1]z_m \in[0,1], is zm=g(Φ(xm),q)z_m = g(\Phi(\mathbf{x}_m),\mathbf{q}). The observed similarity zmz_m deviates from the true similarity βm=g(Φref(xm),q)∈[0,1]\beta_m = g(\Phi_{\mathrm{ref}}(\mathbf{x}_m),\mathbf{q}) \in[0,1] obtained using Φref\Phi_{\mathrm{ref}}. We assume that all device-side models have an embedding dimension of JJ and their outputs are aligned with the query embedding space.

This deviation has two sources, the limited size of the device model and the DRAM degradation under memory approximation [5], and we model the observed similarity of the mm-th sample as

zm=[βm+εm]01,εm∼N(0,σML2(N,τ,wm)),(1)z_m = [\beta_m + \varepsilon_m]_0^1,\quad\varepsilon_m \sim\mathcal{N}(0,\sigma_{\mathrm{ML}}^2(N,\tau,w_m)), \tag*{(1)}

where [x]ab=min⁡(max⁡(x,a),b)[x]_a^b = \min(\max(x,a),b), and the total variance σML2(N,τ,wm)=σc2(N)+σd,m2(τ,wm)\sigma_{\mathrm{ML}}^2(N,\tau,w_m) = \sigma_c^2(N) + \sigma_{d,m}^2(\tau,w_m) combines a static term σc2(N)\sigma_c^2(N) due to the limited model capacity and a time-varying term σd,m2(τ,wm)\sigma_{d,m}^2(\tau,w_m) due to memory degradation. Our experiment with the ImageNet validation set [13] and MCUNet [14] shows that the observed error approximately follows a Gaussian distribution whose variance increases under pruning and bit errors. We assume that εm\varepsilon_m is independent across samples and independent of βm\beta_m. In practice, bit errors persist in the stored weights, and the errors of successive samples are positively correlated. Missed detections then cluster, and the product forms of PGP_G and PFP_F in Sec. III give an optimistic GoE.

We model σc2\sigma_c^2 with empirical neural scaling laws [15], under which the reducible loss of a deep learning model decays as a power law in the model size and the data size. We neglect the data-dependent term, since the deployed model is trained on a large dataset, and model the capacity noise in terms of the number of parameters NN as σc2(N)=AN−2α\sigma_c^2(N)=AN^{-2\alpha}, where A>0A>0 is a scaling coefficient and α>0\alpha>0 is the scaling exponent.

Next, we model σd,m2(τ,wm)\sigma_{d,m}^2(\tau,w_m). After wmw_m refresh operations, each stored bit is in error with probability P‾e(wm,τ)\overline{P}_e(w_m,\tau). The bit errors perturb the quantized weights of the NN and hence the output feature vector, and we model the resulting variance as σd,m2=κP‾e(wm,τ)(1−P‾e(wm,τ))\sigma_{d,m}^2=\kappa\overline{P}_e(w_m,\tau)(1-\overline{P}_e(w_m,\tau)), where κ\kappa is an architecture-specific constant.

Grade of Effectiveness

To quantify the freshness of the relevant data at the deadline, we adopt the GoE [11], which measures the effectiveness of updates at the receiver. To define the GoE, we first extend the standard AoI metric [12]. Let tj′t'_j and tjt_j denote the reception and generation times of the jj-th received image, and let u(t)u(t) be the generation time of the latest image received by time tt whose true similarity is at least δ\delta, i.e., u(t)=max⁡j:(tj′≤t)∧(β⌊tj/Ts⌋≥δ)tju(t)=\max_{j:(t'_j\leq t)\wedge(\beta_{\lfloor t_j/T_s\rfloor}\geq\delta)}t_j. The AoI of relevant data at time tt is then Δ(t)=t−u(t)\Delta(t)=t-u(t), and, following the Query Age of Information (QAoI) [16], we define the GoE as ΔQ=T−u(T)\Delta_Q=T-u(T). If the ES receives no relevant image by the deadline, we set ΔQ=Γ\Delta_Q=\Gamma, as in [17].

Energy Model

Computation

The NN inference energy EinfE_{\mathrm{inf}} is the sum of the DRAM access energy (EDRAM=NEDE_{\mathrm{DRAM}}=NE_D) and on-chip processing energy (EHWE_{\mathrm{HW}}) [18]. Here, EDE_D denotes the energy per bqb_q-bit DRAM access.

At full precision, the read/write energy ELE_L of a small local SRAM or register file equals the energy EMUACE_{\mathrm{MUAC}} of a single multiply-accumulation (MUAC) operation, and an access to the main SRAM costs EM=2ELE_M=2E_L [18]. Then, EHW=EC+EW+EAE_{\mathrm{HW}}=E_C+E_W+E_A, where EC=EMUAC(NC+3As)E_C=E_{\mathrm{MUAC}}(N_C+3A_s), EW=NEM+ELNC/pE_W=NE_M+E_LN_C/\sqrt{p}, and EA=2EMAs+ELNC/pE_A=2E_MA_s+E_LN_C/\sqrt{p} are the compute, weight-access, and activation-access energies, respectively. Here, NCN_C is the inference complexity in terms of MUAC operations and AsA_s is the total number of activations across the model, and p=64×bmax⁡/bqp=64\times b_{\max}/b_q, where bmax⁡b_{\max} is the full-precision bit width.

Communication

Let R={xm∣zm≥Vth, ∀xm∈D}\mathcal{R}=\{x_m|z_m\geq V_{\mathrm{th}},\ \forall x_m\in\mathcal{D}\} denote the set of images that pass the filter. With transmit and receive powers ξtx\xi_{\mathrm{tx}} and ξrx\xi_{\mathrm{rx}}, the communication energy is Ecomm=ξtxtUL∣R∣+ξrxtDLE_{\mathrm{comm}}=\xi_{\mathrm{tx}}t_{\mathrm{UL}}|\mathcal{R}|+\xi_{\mathrm{rx}}t_{\mathrm{DL}}. Here, tUL=(bqdCdHdW)/RULt_{\mathrm{UL}}=(b_qd_Cd_Hd_W)/R_{\mathrm{UL}} and tDL=((J+3)bq)/RDLt_{\mathrm{DL}}=((J+3)b_q)/R_{\mathrm{DL}} are the UL and DL transmission times, and RULR_{\mathrm{UL}} and RDLR_{\mathrm{DL}} are the corresponding data rates.

Memory Refresh

The energy of a single refresh follows from its timing overhead and the DRAM current (IDD) values [19]. Let nre(ζ,τ)n_{\mathrm{re}}(\zeta,\tau) be the number of refresh operations between memory activation and the deadline. Then, the total refresh energy is Ere(ζ,τ)=(EAR+Nbq/browErow)nre(ζ,τ)E_{\mathrm{re}}(\zeta,\tau)=(E_{\mathrm{AR}}+Nb_q/b_{\mathrm{row}}E_{\mathrm{row}})n_{\mathrm{re}}(\zeta,\tau), where N=∣Φ∣N=|\Phi| is the number of parameters of NN Φ\Phi, while EARE_{\mathrm{AR}}, ErowE_{\mathrm{row}} and browb_{\mathrm{row}} respectively represent the energy consumed by a single Auto Refresh (AR) command, that of a single row refresh, and the number of bits stored per DRAM row. Loading the selected model from non-volatile storage into DRAM consumes power ξsys\xi_{\mathrm{sys}} over the loading time TΣ−tDLT_\Sigma-t_{\mathrm{DL}}, so the loading energy is (TΣ−tDL)ξsys(T_\Sigma-t_{\mathrm{DL}})\xi_{\mathrm{sys}}.

Analysis

The IoT device transmits the mm-th sample with probability

Ptr(m)=∫01Q(Vth−βσML(N,τ,wm))gT(β) dβ,(2)P_{\mathrm{tr}}(m)=\int_0^1Q\left(\frac{V_{\mathrm{th}}-\beta}{\sigma_{\mathrm{ML}}(N,\tau,w_m)}\right)g_T(\beta)\,\mathrm{d}\beta, \tag*{(2)}

where Q(x)=12π∫x∞exp⁡(−u22)duQ(x)=\frac{1}{\sqrt{2\pi}}\int_x^\infty\exp\left(-\frac{u^2}{2}\right)\mathrm{d}u and gT(β)g_T(\beta) is the probability density function of the true similarity. Then, the expected total energy consumption is:

E[Etot]=(1−peDL)[∑m=Mpre+1MPtr(m)tULξtx+MpostEinf+(EAR+NbqErowbrow)⌊T−ζ−TΣτ⌋]+ϱ,(3)\mathbb{E}[E_{\mathrm{tot}}]=(1-p_e^{\mathrm{DL}})\left[\sum_{m=M_{\mathrm{pre}}+1}^{M}P_{\mathrm{tr}}(m)t_{\mathrm{UL}}\xi_{\mathrm{tx}}+M_{\mathrm{post}}E_{\mathrm{inf}}+\left(E_{\mathrm{AR}}+\frac{Nb_qE_{\mathrm{row}}}{b_{\mathrm{row}}}\right)\left\lfloor\frac{T-\zeta-T_\Sigma}{\tau}\right\rfloor\right]+\varrho, \tag*{(3)}

where ϱ=ξrxtDL+(1−peDL)(TΣ−tDL)ξsys\varrho=\xi_{\mathrm{rx}}t_{\mathrm{DL}}+(1-p_e^{\mathrm{DL}})(T_\Sigma-t_{\mathrm{DL}})\xi_{\mathrm{sys}}.

The expected GoE follows from the Probability Mass Function (PMF) of the index of the freshest relevant sample that the ES receives. The mm-th sample is relevant and delivered to the ES with probability

PΩ(m)=(1−peUL)Pr⁡(zm≥Vth, βm≥δ)=(1−peUL)∫δ1Q(Vth−βσML(N,τ,wm))gT(β)dβ.(4)\begin{aligned} P_\Omega(m)=(1-p_e^{\mathrm{UL}})\Pr(z_m\geq V_{\mathrm{th}},\ \beta_m\geq\delta) \\ &=(1-p_e^{\mathrm{UL}})\int_\delta^1Q\left(\frac{V_{\mathrm{th}}-\beta}{\sigma_{\mathrm{ML}}(N,\tau,w_m)}\right)g_T(\beta)\mathrm{d}\beta. \tag*{(4)} \end{aligned}

Sample m∈[Mpre+1,M]m\in[M_{\mathrm{pre}}+1,M] is the freshest relevant sample at the ES if it is relevant, successfully delivered, and none of the later samples ℓ∈{m+1,…,M}\ell\in\{m+1,\ldots,M\} is both relevant and successfully delivered, so this event has probability PG(m)=PΩ(m)∏ℓ=m+1M(1−PΩ(ℓ))P_G(m)=P_\Omega(m)\prod_{\ell=m+1}^{M}(1-P_\Omega(\ell)). The ES receives no relevant sample, and ΔQ=Γ\Delta_Q=\Gamma, with probability PF=∏ℓ=Mpre+1M(1−PΩ(ℓ))P_F=\prod_{\ell=M_{\mathrm{pre}}+1}^{M}(1-P_\Omega(\ell)). Finally, the expected GoE is:

E[ΔQ]=(1−peDL)∑m=Mpre+1M(T−mTs)PG(m)+Γ[peDL+(1−peDL)PF].(5)\mathbb{E}[\Delta_Q]=(1-p_e^{\mathrm{DL}})\sum_{m=M_{\mathrm{pre}}+1}^{M}(T-mT_s)P_G(m)+\Gamma\left[p_e^{\mathrm{DL}}+(1-p_e^{\mathrm{DL}})P_F\right]. \tag*{(5)}

Using (3) and (5), we minimize the expected total energy consumption of the IoT device subject to the GoE constraint Δth\Delta_{\mathrm{th}}:

min⁡{ζ,τ,N,Vth} E[Etot]s.t.E[ΔQ]≤Δth.(6)\min_{\{\zeta,\tau,N,V_{\mathrm{th}}\}}\ \mathbb{E}[E_{\mathrm{tot}}]\quad\text{s.t.}\quad\mathbb{E}[\Delta_Q]\leq\Delta_{\mathrm{th}}. \tag*{(6)}

We solve (6) by grid search, in which we vary ζ∈[0,1000]\zeta\in[0,1000] s with a 50 s step subject to ζ≤T−TΣ\zeta\leq T-T_\Sigma, τ∈[64,1280]\tau\in[64,1280] ms with a 32 ms step, Vth∈[0.86,0.98]V_{\mathrm{th}}\in[0.86,0.98] with a 0.04 step, and N∈S={100K,250K,500K,1M,2M}N\in\mathcal{S}=\{100\mathrm{K},250\mathrm{K},500\mathrm{K},1\mathrm{M},2\mathrm{M}\}.

ParameterValueParameterValue
TT10310^3 sTsT_s10 s
Γ\Gamma2000peDL,peULp_e^{\mathrm{DL}},p_e^{\mathrm{UL}}0
RUL,RDLR_{\mathrm{UL}},R_{\mathrm{DL}}10610^6 bpsξtx/ξrx\xi_{\mathrm{tx}}/\xi_{\mathrm{rx}}170/160 mW
(dC,dH,dW)(d_C,d_H,d_W)(3, 128, 160)bq/bmax⁡b_q/b_{\max}8/16
NcN_c67.3 MAsA_s0.325 M
EMUACE_{\mathrm{MUAC}}1.56 pJELE_L1.85 pJ
EME_M3.70 pJEDE_D236.8 pJ
τ0\tau_064 msγ\gamma640 ms
EARE_{\mathrm{AR}}41.5 nJErowE_{\mathrm{row}}157 nJ
browb_{\mathrm{row}}8 Kbitκ\kappa0.2
α\alpha0.35AA197.6

Table I. Default parameters for numerical evaluations.

Numerical Evaluation

We present results for GoE and energy consumption obtained from analysis and Monte Carlo simulation over 2×1052 \times10^5 trials, shown by lines and markers, respectively. As a baseline, we consider a semantic query with always-on memory, in which DRAM is always active with the refresh period τ0\tau_0 and holds the model selected for the query before the episode begins, so the baseline incurs no overhead (TΣ=0T_{\Sigma}=0). The baseline uses the threshold VthV_{\mathrm{th}} and model size Nb⋆=∣Φ⋆b∣N_b^\star=|\Phi^{\star b}| that minimize its energy consumption under the GoE constraint.

Table I lists the default parameters, which follow [20] for the radio, [18] for the computation, with the energies scaled to bq/bmax⁡=0.5b_q/b_{\max}=0.5, [19] for the DRAM refresh, and [14] for the NN. We take α\alpha from [21] and set AA so that σc=0.25\sigma_c=0.25 at N=105N=10^5. For simplicity of analysis, we assume that gT(β)g_T(\beta) is uniform on [0,1][0,1] and set δ=0.9\delta=0.9. A non-uniform gT(β)g_T(\beta) changes only the integrals in PtrP_{\mathrm{tr}} and PΩP_{\Omega}.

Figure 3 shows the GoE and total energy consumption of our proposed scheme as a function of memory activation time ζ\zeta, where we set Vth={0.94,0.96,0.98}V_{\mathrm{th}}=\{0.94,0.96,0.98\}. The analytical and simulation results agree closely for both GoE and energy consumption, and this agreement validates the analysis. The activation time ζ\zeta trades GoE against energy consumption. An earlier activation (small ζ\zeta) gives the device more samples in which to detect and deliver a relevant image, so the GoE decreases, but the communication, computation, and refresh energy increase because all three are proportional to the active duration T−ζ−TΣT-\zeta-T_{\Sigma}. A later activation (large ζ\zeta) saves energy but increases the GoE, because the ES more often collects no relevant image. A higher VthV_{\mathrm{th}} passes fewer images through the filter and lowers PΩP_{\Omega}, so the GoE increases and the transmission energy decreases.

Image not extracted

Figure 3. GoE and energy consumption as a function of ζ\zeta.

Figure 4 shows GoE and total energy consumption as a function of the number of parameters NN, where we set τ={64,96,128}\tau=\{64,96,128\} ms. As NN increases, the GoE decreases and the total energy consumption increases. A larger model reduces σc2\sigma_c^2 and hence the probability of missed detection, but it occupies more DRAM rows and requires more DRAM accesses per inference, so the refresh and inference energy increase. A longer τ\tau reduces the number of refresh operations, and the slope of the energy in NN decreases roughly as 1/τ1/\tau. The longer τ\tau also increases σd,m2\sigma_{d,m}^2, which limits the benefit of a larger model: σc2\sigma_c^2 falls below 0.01 at N=2N=2 M, so for τ>τ0\tau>\tau_0 the degradation term dominates σM2\sigma_M^2 and the GoE flattens, whereas for τ=τ0\tau=\tau_0 the degradation term becomes zero and the GoE keeps decreasing.

Image not extracted

Figure 4. GoE and energy consumption as a function of model size.

Figure 5 shows GoE against packet error probability, in which we change the value of peDLp_e^{\mathrm{DL}} or peULp_e^{\mathrm{UL}}. The GoE increases with both error probabilities, but for different reasons. A DL error prevents the device from receiving the activation signal and the query, so the episode incurs the penalty Γ\Gamma, and by (5) the GoE grows linearly in peDLp_e^{\mathrm{DL}}. A UL error loses a single image, and an earlier relevant image can still reach the ES, so the GoE grows gradually with peULp_e^{\mathrm{UL}}. The DL control signal therefore requires stronger protection than the UL data.

Image not extracted

Figure 5. GoE as a function of UL/DL packet error probability.

Figure 6 shows the GoE and energy consumption as a function of TΣT_{\Sigma}. A larger TΣT_{\Sigma} shortens the interval between model loading and the deadline, so the device captures fewer images after activation. The GoE therefore increases, and the inference, transmission, and refresh energy decreases. In contrast, the loading energy (TΣ−τDL)ξsys(T_{\Sigma}-\tau_{\mathrm{DL}})\xi_{\mathrm{sys}} increases with TΣT_{\Sigma}, and a larger ξsys\xi_{\mathrm{sys}} increases the total energy.

Image not extracted

Figure 6. GoE and energy consumption as a function of TΣT_{\Sigma}.

To evaluate the energy efficiency of our proposed scheme, we consider the following configurations (γ,Γ,peDL,peUL)(\gamma,\Gamma,p_e^{\mathrm{DL}},p_e^{\mathrm{UL}}): setting 1 (3200, 2000, 0, 0); setting 2 (320, 2000, 0, 0); setting 3 (3200, 5000, 0, 0); setting 4 (3200, 2000, 0, 0.1); setting 5 (3200, 2000, 0.1, 0). We obtain the optimal sets of parameters {ζ⋆,τ⋆,Φ⋆,Vth⋆}\{\zeta^{\star}, \tau^{\star}, \Phi^{\star}, V_{\mathrm{th}}^{\star}\} by solving Eq. (6). Then, we define η=E[Etot(ζ⋆,τ⋆,Φ⋆,Vth⋆)]/E[Etot(0,τ0,Φ⋆b,Vth⋆b)]\eta= \mathbb{E}[E_{\mathrm{tot}}(\zeta^{\star}, \tau^{\star}, \Phi^{\star}, V_{\mathrm{th}}^{\star})] / \mathbb{E}[E_{\mathrm{tot}}(0, \tau_{0}, \Phi^{\star b}, V_{\mathrm{th}}^{\star b})], as the ratio of the total energy consumption of the proposed scheme to that of the baseline.

Figure 7 shows η\eta against Δth\Delta_{\mathrm{th}} for the different settings. Missing points indicate that no configuration satisfies the constraint. From Figure 7, our proposed scheme consumes less energy than the baseline when Δth>150\Delta_{\mathrm{th}} > 150 for settings 1 to 4. The ES achieves this saving by tuning the memory activation timing ζ\zeta and refresh period τ\tau under the GoE constraint. Setting 2 yields a higher η\eta than setting 1 at every Δth\Delta_{\mathrm{th}} because its smaller γ\gamma accelerates memory degradation and forces the ES to choose a shorter refresh period τ\tau. In setting 3, the larger penalty Γ\Gamma for failing to collect relevant data forces the ES to activate the memory earlier, so η\eta also exceeds that of setting 1. In setting 4, UL losses reduce PΩ(m)P_{\Omega}(m) by the factor 1−pUL1-p^{\mathrm{UL}}, so the ES must activate the memory earlier or lower VthV_{\mathrm{th}} to deliver at least one relevant image by the deadline, and this conservative choice keeps η\eta above that of setting 1 at every Δth\Delta_{\mathrm{th}}. The impact of channel error is larger for the DL signaling (setting 5). In setting 5, Eq. (5) gives E[ΔQ]≥ΓpeDL=200\mathbb{E}[\Delta Q] \ge\Gamma p_{\mathrm{e}}^{\mathrm{DL}} = 200, so no configuration satisfies Δth<200\Delta_{\mathrm{th}} < 200. For larger Δth\Delta_{\mathrm{th}}, the budget left for missed detections shrinks to Δth−200\Delta_{\mathrm{th}} - 200, and the ES must apply a smaller VthV_{\mathrm{th}}, a larger NN, a smaller τ\tau, and an earlier ζ\zeta, which increases energy consumption.

Image not extracted

Figure 7. Energy consumption ratio η\eta against the GoE constraint Δth\Delta_{\mathrm{th}}.

Conclusion

This letter studied energy-efficient, timely, and relevant data retrieval from an IoT device under wireless memory activation and approximation. We derived closed-form expressions for the expected energy consumption and the GoE. The numerical results characterized the energy-freshness trade-off and showed that the proposed scheme consumes less energy than the always-on baseline for relaxed freshness constraints. Future work includes an experimental feasibility study and a robust design that accounts for mismatched statistics and temporally correlated observations.

References

  1. [1]A. E. Kalør, P. Popovski, and K. Huang, “Data sourcing random access using semantic queries for massive IoT scenarios,” IEEE Trans. Commun., vol. 73, no. 12, pp. 14 381–14 396, 2025.
  2. [2]R. Bezerra, S. Tadokoro, and K. Ohno, “AI-IoT-robotics integration: Survey of frameworks, emerging trends, and the path toward connected robotics,” IEEE Internet Things J., 2026.DOI
  3. [3]K. Huang, Q. Lan, Z. Liu, and L. Yang, “Semantic data sourcing for 6G edge intelligence,” IEEE Commun. Mag., vol. 61, no. 12, pp. 70–76, 2023.arxiv.org/abs/2301.00403
  4. [4]J. Shiraishi, M. Thorsager, S. R. Pandey, and P. Popovski, “TinyAirNet: TinyML model transmission for energy-efficient image retrieval from IoT devices,” IEEE Commun. Lett., vol. 28, no. 9, pp. 2101–2105, 2024.arxiv.org/abs/2311.04788
  5. [5]J. Shiraishi, S. R. Pandey, I. Leyva-Mayorga, and P. Popovski, “Wireless less memory approximation for energy-efficient task-specific IoT data retrieval,” in Proc. ICC 2026-IEEE Int. Conf. Commun., 2026.arxiv.org/abs/2510.26473
  6. [6]S. Liu, K. Patabiraman, T. Mescobroda, and B. G. Zorn, “Flikker: Saving DRAM refresh-power through critical data partitioning,” in Proc. sixteenth Int. Conf. Architectural support Program. Lang. operating Syst., vol. 1, pp. 213–224.
  7. [7]A. Raha, S. Sutar, H. Jayakumar, and V. Raghunathan, “Quality configurable approximate DRAM,” IEEE Trans. Comput., vol. 66, no. 7, pp. 1172–1187, 2016.DOI
  8. [8]D. T. Nguyen, N. H. Hung, H. Kim, and H.-J. Lee, “An approximate memory architecture for energy saving in deep learning applications,” IEEE Trans. Circuits Syst. I: Regular Papers, vol. 67, no. 5, pp. 1588–1601, 2020.DOI
  9. [9]A. Raha and V. Raghunathan, “Approximating beyond the processor: Exploring full-system energy-accuracy tradeoffs in a smart camera system,” IEEE Trans. Very Large Scale Integration (VLSI) Syst., vol. 26, no. 12, pp. 2884–2897, 2018.DOI
  10. [10]A. Das, S. K. Ghosh, A. Raha, and V. Raghunathan, “Towards energy-efficient collaborative inference using multi-system approximations,” IEEE Internet Things J., 2024.
  11. [11]P. Agheli, N. Pappas, P. Popovski, and M. Kountouris, “Effective communication: When to pull updates?” in ICC 2024-IEEE Int. Conf. Commun. IEEE, 2024, pp. 183–188.arxiv.org/abs/2311.06432
  12. [12]A. Kosta, N. Pappas, and V. Angelakis, “Age of information: A new concept, metric, and tool,” Found. Trends Netw., vol. 12, no. 3, pp. 162–259, 2017.
  13. [13]J. Deng et al., “Imagenet: A large-scale hierarchical image database,” in 2009 IEEE Conf. comput. vision pattern recognit. IEEE, 2009, pp. 248–255.
  14. [14]J. Lin et al., “Mcunet: Tiny deep learning on iot devices,” Adv. Neural Inf. Process. Syst., vol. 33, pp. 11 711–11 722, 2020.
  15. [15]J. S. Rosenfeld, “Scaling laws for deep learning,” arXiv preprint arXiv:2108.07286, 2021.
  16. [16]F. Chiarotti et al., “Query age of information: Freshness in pull-based communication,” IEEE Trans. Commun., vol. 70, no. 3, pp. 1606–1622, 2022.
  17. [17]J. Shiraishi et al., “Content-based wake-up for energy-efficient and timely top-k IoT sensing data retrieval,” IEEE Trans. Commun., vol. 73, no. 12, pp. 13 983–13 998, 2025.arxiv.org/abs/2410.06026
  18. [18]B. Moons, K. Goetschalckx, N. Van Berckelaer, and M. Verhelst, “Minimum energy quantized neural networks,” in Proc. 2017 51st Asilomar Conf. Signals, Syst. Comput. IEEE, 2017, pp. 1921–1925.arxiv.org/abs/1711.00215
  19. [19]I. Bhati, Z. Chishti, S.-L. Lu, and B. Jacob, “Flexible auto-refresh: Enabling scalable and energy-efficient DRAM refresh reductions,” in Proc. 42nd Annu. Int. Symp. Comput. Architecture, 2015, pp. 235–246.
  20. [20]S. M. Z. Khan et al., “An empirical modeling for the baseline energy consumption of an NB-IoT radio transceiver,” IEEE Internet Things J., vol. 8, no. 19, pp. 14 756–14 772, 2021.
  21. [21]T. Besiroglu, E. Erdil, M. Barnett, and J. You, “Chinchilla scaling: A replication attempt,” arXiv preprint arXiv:2404.10102, 2024.arxiv.org/abs/2404.10102

Paper details

vlnc:W_naykkzqe
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents