Timely updates are critical for real-time monitoring and control applications powered by the Internet of Things (IoT). As these systems scale, they become increasingly vulnerable to adversarial attacks, where malicious agents interfere with legitimate transmissions to reduce data rates, thereby inflating the age of information (AoI). Existing adversarial AoI models often assume stationary channels and overlook queueing dynamics arising from compromised sensing sources operating under resource constraints. Motivated by the G-queue framework, this paper investigates a two-source M/G/1/1 system in which one source is adversarial and disrupts the update process by injecting negative arrivals according to a Poisson process and inducing i.i.d. service slowdowns, bounded in attack rate and duration. Using moment generating functions, we then derive closed-form expressions for average and peak AoI for an arbitrary number of sources. Moreover, we introduce a worst-case constrained attack model and employ stochastic dominance arguments to establish analytical AoI bounds. Numerical results validate the analysis and highlight the impact of resource-limited adversarial interference under general service time distributions.
翻译:实时监测与控制应用依赖于物联网技术,其数据更新的及时性至关重要。随着系统规模扩大,这些系统愈发容易受到对抗性攻击的威胁,恶意代理通过干扰合法传输来降低数据速率,从而增加信息年龄。现有的对抗性信息年龄模型通常假设信道平稳,且忽视了在资源约束下受损感知源所产生的排队动态。受G-队列框架启发,本文研究了一个双源M/G/1/1系统,其中一个源为对抗源,通过按泊松过程注入负到达并引入独立同分布的服务减速(攻击速率和持续时间有界)来破坏更新过程。利用矩生成函数,我们推导了任意数量源的平均信息年龄与峰值信息年龄的闭式表达式。此外,我们引入了一种最坏情况约束攻击模型,并运用随机占优论证建立了信息年龄的理论界。数值结果验证了分析的有效性,并突显了在一般服务时间分布下资源受限对抗性干扰的影响。