Jixiang Zhang, Han Xu, Anqi Zheng, Daming Cao, Yinfei Xu, Chengyu Lin
{"title":"基于偷听器的Ber/Geo/1/2队列状态更新系统的实时更新。","authors":"Jixiang Zhang, Han Xu, Anqi Zheng, Daming Cao, Yinfei Xu, Chengyu Lin","doi":"10.3390/e27090972","DOIUrl":null,"url":null,"abstract":"<p><p>We consider that the source sends packets to the receiver through a Ber/Geo/1/2 queue modeled status updating system, where the transmitted packets are subject to potential eavesdropping. Time is discretized into identical time slots. This paper studies the tradeoffs between the information freshness and transmission security of a system, where freshness is characterized by the age of information (AoI) metric and transmission security is represented by the proportion of obtained insecure packets over a long period of time. We assume that in a time slot, the source generates a new packet with probability <i>p</i>, and a packet arrives at the receiver with probability γd. With probability γE, a transmitted packet is eavesdropped. At the receiver, AoI is defined as the elapsed time since the generation instant of the latest obtained packet. A packet is defined to be insecure if it is obtained by the eavesdropper earlier than the receiver. To control the proportion of insecure packets obtained in the receiver, we propose using the probabilistic deletion/retaining scheme. More specifically, when a packet is eavesdropped before arriving at the receiver, this packet is deleted with probability δ or retained with probability 1-δ. Under this transmission policy, we derive the system's average AoI which we call the average δ-secure AoI, and investigate its relations with the insecure packet proportion, which is denoted as η(δ). The obtained formulas are then calculated in three special cases, including γE=0, γE=1, and δ=1. We explain that these cases correspond to the average AoI of a basic status updating system with Ber/Geo/1/2 queue, packet with random geometric deadline in service process, and average age of secure information (AoSI), respectively. Numerical simulations of obtained results are provided. In particular, the tradeoffs between average δ-secure AoI and η(δ) are analyzed in detail. We demonstrate that depending on the value of the eavesdropping probability γE, average δ-secure AoI varies in different trends with η(δ), and in most cases the average δ-secure AoI and η(δ) can be minimized simultaneously.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 9","pages":""},"PeriodicalIF":2.0000,"publicationDate":"2025-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12468663/pdf/","citationCount":"0","resultStr":"{\"title\":\"Timely Updating on Ber/Geo/1/2 Queue Modeled Status Updating System with Eavesdropper.\",\"authors\":\"Jixiang Zhang, Han Xu, Anqi Zheng, Daming Cao, Yinfei Xu, Chengyu Lin\",\"doi\":\"10.3390/e27090972\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>We consider that the source sends packets to the receiver through a Ber/Geo/1/2 queue modeled status updating system, where the transmitted packets are subject to potential eavesdropping. Time is discretized into identical time slots. This paper studies the tradeoffs between the information freshness and transmission security of a system, where freshness is characterized by the age of information (AoI) metric and transmission security is represented by the proportion of obtained insecure packets over a long period of time. We assume that in a time slot, the source generates a new packet with probability <i>p</i>, and a packet arrives at the receiver with probability γd. With probability γE, a transmitted packet is eavesdropped. At the receiver, AoI is defined as the elapsed time since the generation instant of the latest obtained packet. A packet is defined to be insecure if it is obtained by the eavesdropper earlier than the receiver. To control the proportion of insecure packets obtained in the receiver, we propose using the probabilistic deletion/retaining scheme. More specifically, when a packet is eavesdropped before arriving at the receiver, this packet is deleted with probability δ or retained with probability 1-δ. Under this transmission policy, we derive the system's average AoI which we call the average δ-secure AoI, and investigate its relations with the insecure packet proportion, which is denoted as η(δ). The obtained formulas are then calculated in three special cases, including γE=0, γE=1, and δ=1. We explain that these cases correspond to the average AoI of a basic status updating system with Ber/Geo/1/2 queue, packet with random geometric deadline in service process, and average age of secure information (AoSI), respectively. Numerical simulations of obtained results are provided. In particular, the tradeoffs between average δ-secure AoI and η(δ) are analyzed in detail. We demonstrate that depending on the value of the eavesdropping probability γE, average δ-secure AoI varies in different trends with η(δ), and in most cases the average δ-secure AoI and η(δ) can be minimized simultaneously.</p>\",\"PeriodicalId\":11694,\"journal\":{\"name\":\"Entropy\",\"volume\":\"27 9\",\"pages\":\"\"},\"PeriodicalIF\":2.0000,\"publicationDate\":\"2025-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12468663/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Entropy\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://doi.org/10.3390/e27090972\",\"RegionNum\":3,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"PHYSICS, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Entropy","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.3390/e27090972","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
摘要
我们认为源端通过一个Ber/Geo/1/2队列模型状态更新系统向接收端发送数据包,在该系统中传输的数据包有可能被窃听。时间被离散成相同的时隙。本文研究了系统的信息新鲜度与传输安全性之间的权衡,新鲜度用信息年龄(age of information, AoI)度量来表示,传输安全性用长时间内获取的不安全数据包的比例来表示。我们假设在一个时隙中,源产生一个新数据包的概率为p,数据包到达接收者的概率为γd。传输的数据包被窃听的概率为γE。在接收端,AoI定义为从最近获得的数据包的生成瞬间开始经过的时间。如果一个数据包被窃听者比接收方更早获得,则定义为不安全。为了控制接收端获得的不安全数据包的比例,我们提出了概率删除/保留方案。更具体地说,当数据包在到达接收者之前被窃听时,该数据包被删除的概率为δ或保留的概率为1-δ。在此传输策略下,我们导出了系统的平均AoI,我们称之为平均δ-安全AoI,并研究了它与不安全数据包比例的关系,用η(δ)表示。然后在γE=0、γE=1和δ=1三种特殊情况下计算所得公式。我们解释了这些情况分别对应于具有Ber/Geo/1/2队列的基本状态更新系统的平均AoI、服务过程中具有随机几何截止日期的数据包和安全信息的平均年龄(AoSI)。给出了所得结果的数值模拟。详细分析了平均δ-安全AoI和η(δ)之间的权衡关系。结果表明,随着窃听概率γE的不同,δ-安全平均AoI随η(δ)的变化趋势不同,在大多数情况下δ-安全平均AoI和η(δ)可以同时最小化。
Timely Updating on Ber/Geo/1/2 Queue Modeled Status Updating System with Eavesdropper.
We consider that the source sends packets to the receiver through a Ber/Geo/1/2 queue modeled status updating system, where the transmitted packets are subject to potential eavesdropping. Time is discretized into identical time slots. This paper studies the tradeoffs between the information freshness and transmission security of a system, where freshness is characterized by the age of information (AoI) metric and transmission security is represented by the proportion of obtained insecure packets over a long period of time. We assume that in a time slot, the source generates a new packet with probability p, and a packet arrives at the receiver with probability γd. With probability γE, a transmitted packet is eavesdropped. At the receiver, AoI is defined as the elapsed time since the generation instant of the latest obtained packet. A packet is defined to be insecure if it is obtained by the eavesdropper earlier than the receiver. To control the proportion of insecure packets obtained in the receiver, we propose using the probabilistic deletion/retaining scheme. More specifically, when a packet is eavesdropped before arriving at the receiver, this packet is deleted with probability δ or retained with probability 1-δ. Under this transmission policy, we derive the system's average AoI which we call the average δ-secure AoI, and investigate its relations with the insecure packet proportion, which is denoted as η(δ). The obtained formulas are then calculated in three special cases, including γE=0, γE=1, and δ=1. We explain that these cases correspond to the average AoI of a basic status updating system with Ber/Geo/1/2 queue, packet with random geometric deadline in service process, and average age of secure information (AoSI), respectively. Numerical simulations of obtained results are provided. In particular, the tradeoffs between average δ-secure AoI and η(δ) are analyzed in detail. We demonstrate that depending on the value of the eavesdropping probability γE, average δ-secure AoI varies in different trends with η(δ), and in most cases the average δ-secure AoI and η(δ) can be minimized simultaneously.
期刊介绍:
Entropy (ISSN 1099-4300), an international and interdisciplinary journal of entropy and information studies, publishes reviews, regular research papers and short notes. Our aim is to encourage scientists to publish as much as possible their theoretical and experimental details. There is no restriction on the length of the papers. If there are computation and the experiment, the details must be provided so that the results can be reproduced.