it is composed of the convex combination of terms $\|A+BK\|$ and $\|A\|$ weighted respectively with the lower bound $(1-\hat{p}(\hat{v}))$ of the long-term ratio of successful transmissions and upper bound $\hat{p}(\hat{v})$ of the long-term ratio of failed transmissions.

Our analysis approach differs from the more classical approaches utilized in the cases where the transmission failure indicator process $\{l(t)\in\{0,1\}\}_{t\in\mathbb{N}_{0}}$ is a Bernoulli process or a Markov chain. In those cases, stability analysis can rely on the probability of failures $\mathbb{P}[l(t)=1]$ and conditional failure probabilities $\mathbb{P}[l(t)=q|l(t-1)=r]$, $q,r\in\{0,1\}$, (see [@quevedo2011packetized; @costa2004discrete]). We remark that in our case, precise information of such probability terms is not available due to the uncertainty in the generation of attacks. Specifically, the interference power $v(t)$ at a given time $t$ is part of attacker’s strategy and cannot be known with certainty. As a result, the transmission failure probability at that time is also uncertain and cannot be used in the analysis.

A crucial role in our analysis is played by the following lemma, where we investigate the products of affine functions that involve the transmission failure indicator $l(\cdot)$ and obtain upper bounds for their expected values. As shown later in the proof of Theorem \[TheoremBoundedDisturbance\], such upper bounds allow 