Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834682
Hassan ZivariFard, M. Bloch, Aria Nosratinia
This paper is eligible for the Jack Keil Wolf ISIT Student Paper Award. This paper investigates covert communication in the presence of a cooperative jammer. Covert communication refers to the inability of an adversary to distinguish data transmission from a so-called innocent symbol at the input. We consider three related problems: (1) a jammer without direct communication or coordination with the transmitter, (2) a jammer that cribs the output of the transmitter, and (3) a jammer that is able to coordinate with the transmitter via a secret key that is also shared with the legitimate receiver. For each model, we derive inner and outer bounds on the capacity region that are tight in some special cases. Unlike prior results in the literature, the jammer in our model does not have access to unlimited local randomness. In fact, uncovering the fundamental interplay between the covert communication rate, local randomness, and secret key rate, is one of the distinctions and contributions of the present work. In the context of a few specific channels, we calculate achievable covert rates to illuminate our results.
这篇论文有资格获得Jack Keil Wolf ISIT学生论文奖。本文研究了协作干扰存在下的隐蔽通信。秘密通信是指攻击者无法从输入的所谓无害符号中区分数据传输。我们考虑三个相关问题:(1)与发射机没有直接通信或协调的干扰机，(2)窃取发射机输出的干扰机，以及(3)能够通过也与合法接收器共享的密钥与发射机协调的干扰机。对于每个模型，我们推导出在某些特殊情况下容量区域的内界和外界是紧的。与文献中先前的结果不同，我们模型中的干扰器不具有无限的局部随机性。事实上，揭示隐蔽通信速率、局部随机性和秘密密钥速率之间的基本相互作用，是本研究的区别和贡献之一。在一些特定通道的背景下，我们计算可实现的隐蔽率来阐明我们的结果。
{"title":"Covert Communication in the Presence of an Uninformed, Informed, and Coordinated Jammer","authors":"Hassan ZivariFard, M. Bloch, Aria Nosratinia","doi":"10.1109/ISIT50566.2022.9834682","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834682","url":null,"abstract":"This paper is eligible for the Jack Keil Wolf ISIT Student Paper Award. This paper investigates covert communication in the presence of a cooperative jammer. Covert communication refers to the inability of an adversary to distinguish data transmission from a so-called innocent symbol at the input. We consider three related problems: (1) a jammer without direct communication or coordination with the transmitter, (2) a jammer that cribs the output of the transmitter, and (3) a jammer that is able to coordinate with the transmitter via a secret key that is also shared with the legitimate receiver. For each model, we derive inner and outer bounds on the capacity region that are tight in some special cases. Unlike prior results in the literature, the jammer in our model does not have access to unlimited local randomness. In fact, uncovering the fundamental interplay between the covert communication rate, local randomness, and secret key rate, is one of the distinctions and contributions of the present work. In the context of a few specific channels, we calculate achievable covert rates to illuminate our results.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126969976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834651
Shibsankar Das, Adrish Banerjee, Zilong Liu
In this paper, we present a new family of cross Z-complementary pairs (CZCPs) based on generalized Boolean functions and two roots of unity. Our key idea is to consider an arbitrary partition of the set {1,2,⋯,n} with two subsets corresponding to two given roots of unity for which two truncated sequences of new alphabet size determined by the two roots of unity are obtained. We show that these two truncated sequences form a new q-ary CZCP with flexible sequence length and large zero-correlation zone width. Furthermore, we derive an enumeration formula by considering the Stirling number of the second kind for the partitions and show that the number of constructed CZCPs increases significantly compared to the existing works.
{"title":"New Family of Cross Z-Complementary Sequences With Large ZCZ Width","authors":"Shibsankar Das, Adrish Banerjee, Zilong Liu","doi":"10.1109/ISIT50566.2022.9834651","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834651","url":null,"abstract":"In this paper, we present a new family of cross Z-complementary pairs (CZCPs) based on generalized Boolean functions and two roots of unity. Our key idea is to consider an arbitrary partition of the set {1,2,⋯,n} with two subsets corresponding to two given roots of unity for which two truncated sequences of new alphabet size determined by the two roots of unity are obtained. We show that these two truncated sequences form a new q-ary CZCP with flexible sequence length and large zero-correlation zone width. Furthermore, we derive an enumeration formula by considering the Stirling number of the second kind for the partitions and show that the number of constructed CZCPs increases significantly compared to the existing works.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"696 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116116331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834484
A. Mahesh, B. Rajan
The paper "Adding transmitters dramatically boosts coded caching gains for finite file sizes" by E. Lampiris and P. Elia introduced multi antenna transmission as a possible strategy to increase coded caching gains. It showed that under the assumption of very high SNRs, if additive white Gaussian noise at the receivers is neglected, then full multiplexing as well as caching gain can be simultaneously obtained with reduced sub-packetization. In this paper, a more realistic setting where noise at the receivers is non-negligible is considered and a transmission scheme using space time codes is proposed to get diversity gain in addition to caching and multiplexing gains.
E. Lampiris和P. Elia的论文《在有限文件大小的情况下，增加发射机显著提高编码缓存增益》介绍了多天线传输作为增加编码缓存增益的可能策略。结果表明，在高信噪比的假设下，如果忽略接收机处的加性高斯白噪声，则可以在减少子分组的情况下同时获得完全复用和缓存增益。本文考虑了一个更现实的接收机噪声不可忽略的情况，提出了一种利用空时码的传输方案，除了高速缓存和复用增益外，还能获得分集增益。
{"title":"Space Time Codes in Multi-Antenna Coded Caching Systems","authors":"A. Mahesh, B. Rajan","doi":"10.1109/ISIT50566.2022.9834484","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834484","url":null,"abstract":"The paper \"Adding transmitters dramatically boosts coded caching gains for finite file sizes\" by E. Lampiris and P. Elia introduced multi antenna transmission as a possible strategy to increase coded caching gains. It showed that under the assumption of very high SNRs, if additive white Gaussian noise at the receivers is neglected, then full multiplexing as well as caching gain can be simultaneously obtained with reduced sub-packetization. In this paper, a more realistic setting where noise at the receivers is non-negligible is considered and a transmission scheme using space time codes is proposed to get diversity gain in addition to caching and multiplexing gains.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"472 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122493652","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834790
Osama A. Hanna, Xinlin Li, C. Fragouli, S. Diggavi
We consider a distributed detection problem where sensors observe dependent observations. We ask, if we can allow the sensors to locally exchange a few bits with each other, whether we can use these bits to "break" the dependency of the sensor observations, and thus reduce the dependent detection problem to the much better-studied and understood case of conditionally independent observations. To this end, we propose an optimization problem that we prove is equivalent to minimizing the dependency between the sensor observations. This problem is in general NP-hard, however, we show that for at least some cases of Gaussian distributions it can be solved efficiently. For general distributions, we propose to use alternating minimization and derive a constant factor approximation algorithm. Numerical evaluations indicate that our approach can offer significant improvement in detection accuracy over alternative schemes.
{"title":"Can we break the dependency in distributed detection?","authors":"Osama A. Hanna, Xinlin Li, C. Fragouli, S. Diggavi","doi":"10.1109/ISIT50566.2022.9834790","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834790","url":null,"abstract":"We consider a distributed detection problem where sensors observe dependent observations. We ask, if we can allow the sensors to locally exchange a few bits with each other, whether we can use these bits to \"break\" the dependency of the sensor observations, and thus reduce the dependent detection problem to the much better-studied and understood case of conditionally independent observations. To this end, we propose an optimization problem that we prove is equivalent to minimizing the dependency between the sensor observations. This problem is in general NP-hard, however, we show that for at least some cases of Gaussian distributions it can be solved efficiently. For general distributions, we propose to use alternating minimization and derive a constant factor approximation algorithm. Numerical evaluations indicate that our approach can offer significant improvement in detection accuracy over alternative schemes.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"396 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122817519","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834448
T. Wadayama
This paper presents fully analog noise-resilient dynamical systems for storing a binary sequence. The proposed dynamical system is a gradient descent dynamical system based on a potential energy function defined based on a parity check matrix of a binary linear code. We assume that the dynamical system operates with stochastic disturbances such as thermal noises. We formulate the whole system, including stochastic disturbances, using stochastic differential equations (SDE). From a discretized stochastic difference equation, i.e., the Euler-Maruyama equation, we can study the covariance evolution of error vectors regarding the random walk of the system state around an equilibrium state. Some numerical evaluations for the (7,4) Hamming code and related codes indicate the robustness of the proposed dynamical system against the stochastic disturbances.
{"title":"Fully Analog Noise-Resilient Dynamical Systems Storing Binary Sequence","authors":"T. Wadayama","doi":"10.1109/ISIT50566.2022.9834448","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834448","url":null,"abstract":"This paper presents fully analog noise-resilient dynamical systems for storing a binary sequence. The proposed dynamical system is a gradient descent dynamical system based on a potential energy function defined based on a parity check matrix of a binary linear code. We assume that the dynamical system operates with stochastic disturbances such as thermal noises. We formulate the whole system, including stochastic disturbances, using stochastic differential equations (SDE). From a discretized stochastic difference equation, i.e., the Euler-Maruyama equation, we can study the covariance evolution of error vectors regarding the random walk of the system state around an equilibrium state. Some numerical evaluations for the (7,4) Hamming code and related codes indicate the robustness of the proposed dynamical system against the stochastic disturbances.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128411093","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834620
I. Andriyanova, C. Poulliat
A new class of doubly-generalized LDPC codes over extended code alphabets has been recently proposed in [1]. These codes have been shown to have good asymptotic and minimum distance properties in the range of high code rates, and their structure is solely based on non-binary repetition and parity-check component codes. In this work we go further in the investigation of the new code class, called Repetition-parity-Parity (RPP) in the rest of the paper, by extending the definition of [1] to irregular degree distributions. One performs the asymptotic decoding analysis of the RPP ensemble over the binary erasure channel and formulates a degree distribution optimization problem by means of an approximated EXIT analysis. Some insights on the stability, minimum distance properties and low complexity encoding and decoding of RPP codes have been also developed.
{"title":"Analysis of Non-Binary High-Rate Repetition-Parity-Parity Codes Over the BEC","authors":"I. Andriyanova, C. Poulliat","doi":"10.1109/ISIT50566.2022.9834620","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834620","url":null,"abstract":"A new class of doubly-generalized LDPC codes over extended code alphabets has been recently proposed in [1]. These codes have been shown to have good asymptotic and minimum distance properties in the range of high code rates, and their structure is solely based on non-binary repetition and parity-check component codes. In this work we go further in the investigation of the new code class, called Repetition-parity-Parity (RPP) in the rest of the paper, by extending the definition of [1] to irregular degree distributions. One performs the asymptotic decoding analysis of the RPP ensemble over the binary erasure channel and formulates a degree distribution optimization problem by means of an approximated EXIT analysis. Some insights on the stability, minimum distance properties and low complexity encoding and decoding of RPP codes have been also developed.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128516848","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834406
Oisin Faust, Hamza Fawzi
A hierarchy of semidefinite programming relaxations is described which gives certified upper bounds on the strong data processing (SDPI) constant of a discrete channel. The relaxations rely on a combination of tools from approximation theory and sum-of-squares techniques. By leveraging the properties of rational Padé approximants, we prove that the hierarchy converges to the true SDPI constant. Numerical experiments are performed which verify that these relaxations are very accurate even at low levels of the hierarchy.
{"title":"Strong Data Processing Inequalities via Sums of Squares","authors":"Oisin Faust, Hamza Fawzi","doi":"10.1109/ISIT50566.2022.9834406","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834406","url":null,"abstract":"A hierarchy of semidefinite programming relaxations is described which gives certified upper bounds on the strong data processing (SDPI) constant of a discrete channel. The relaxations rely on a combination of tools from approximation theory and sum-of-squares techniques. By leveraging the properties of rational Padé approximants, we prove that the hierarchy converges to the true SDPI constant. Numerical experiments are performed which verify that these relaxations are very accurate even at low levels of the hierarchy.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128617826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834525
Ajaykrishnan Nageswaran
A user’s data is represented by a Gaussian random variable. Given a linear function of the data, a querier is required to recover, with at least a prescribed accuracy level, the function value based on a query response provided by the user. The user devises the query response, subject to the recoverability requirement, so as to maximize privacy of the data from the querier. Recoverability and privacy are both measured by ℓ2-distance criteria. An exact characterization is provided of maximum user data privacy under the recoverability condition. An explicit achievability scheme for the user is given and its privacy compared with a converse upper bound.
{"title":"Gaussian Data Privacy Under Linear Function Recoverability","authors":"Ajaykrishnan Nageswaran","doi":"10.1109/ISIT50566.2022.9834525","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834525","url":null,"abstract":"A user’s data is represented by a Gaussian random variable. Given a linear function of the data, a querier is required to recover, with at least a prescribed accuracy level, the function value based on a query response provided by the user. The user devises the query response, subject to the recoverability requirement, so as to maximize privacy of the data from the querier. Recoverability and privacy are both measured by ℓ2-distance criteria. An exact characterization is provided of maximum user data privacy under the recoverability condition. An explicit achievability scheme for the user is given and its privacy compared with a converse upper bound.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127003564","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834464
Netanel Raviv, Rawad Bitar, Eitan Yaakobi
In a Private Inference scenario, a server holds a model (e.g., a neural network), a user holds data, and the user wishes to apply the model on her data. The privacy of both parties must be protected; the user’s data might contain confidential information, and the server’s model is his intellectual property.Private inference has been studied extensively in recent years, mostly from a cryptographic perspective by incorporating homo-morphic encryption and multiparty computation protocols, which incur high computational overhead and degrade the accuracy of the model. In this work we take a perpendicular approach which draws inspiration from the expansive Private Information Retrieval literature. We view private inference as the task of retrieving an inner product of a parameter vector with the data, a fundamental step in most machine learning models.By combining binary arithmetic with real-valued one, we present a scheme which enables the retrieval of the inner product for models whose weights are either binarized, or given in fixed-point representation; such models gained increased attention recently, due to their ease of implementation and increased robustness. We also present a fundamental trade-off between the privacy of the user and that of the server, and show that our scheme is optimal in this sense. Our scheme is simple, universal to a large family of models, provides clear information-theoretic guarantees to both parties with zero accuracy loss, and in addition, is compatible with continuous data distributions and allows infinite precision.
{"title":"Information Theoretic Private Inference in Quantized Models","authors":"Netanel Raviv, Rawad Bitar, Eitan Yaakobi","doi":"10.1109/ISIT50566.2022.9834464","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834464","url":null,"abstract":"In a Private Inference scenario, a server holds a model (e.g., a neural network), a user holds data, and the user wishes to apply the model on her data. The privacy of both parties must be protected; the user’s data might contain confidential information, and the server’s model is his intellectual property.Private inference has been studied extensively in recent years, mostly from a cryptographic perspective by incorporating homo-morphic encryption and multiparty computation protocols, which incur high computational overhead and degrade the accuracy of the model. In this work we take a perpendicular approach which draws inspiration from the expansive Private Information Retrieval literature. We view private inference as the task of retrieving an inner product of a parameter vector with the data, a fundamental step in most machine learning models.By combining binary arithmetic with real-valued one, we present a scheme which enables the retrieval of the inner product for models whose weights are either binarized, or given in fixed-point representation; such models gained increased attention recently, due to their ease of implementation and increased robustness. We also present a fundamental trade-off between the privacy of the user and that of the server, and show that our scheme is optimal in this sense. Our scheme is simple, universal to a large family of models, provides clear information-theoretic guarantees to both parties with zero accuracy loss, and in addition, is compatible with continuous data distributions and allows infinite precision.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123909564","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-06-26DOI: 10.1109/ISIT50566.2022.9834502
A. Maatouk, M. Assaad, A. Ephremides
In this paper, we provide an analysis of a status update system modeled through the Stochastic Hybrid Systems (SHSs) tool. Contrary to previous works, which assumed constant transition rates, we allow the system’s transition dynamics to be functions of the Age of Information (AoI). This dependence allows us to encapsulate many applications and opens the door for more sophisticated systems to be studied. However, this same dependence on the AoI engenders technical and analytical difficulties. Our paper provides a first step in addressing these difficulties. Specifically, we first showcase the regularity and other critical characteristics of the age process in our system of interest. Then, we provide a framework to establish the Lagrange stability and positive recurrence of the process. Building on these results, we provide an approach, dubbed as the moment closure technique, to compute the m-th moment of the age process for any m≥1. Interestingly, this technique allows us to approximate the average age of various systems by solving a simple set of linear equations.
{"title":"Analysis of an Age-Dependent Stochastic Hybrid System","authors":"A. Maatouk, M. Assaad, A. Ephremides","doi":"10.1109/ISIT50566.2022.9834502","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834502","url":null,"abstract":"In this paper, we provide an analysis of a status update system modeled through the Stochastic Hybrid Systems (SHSs) tool. Contrary to previous works, which assumed constant transition rates, we allow the system’s transition dynamics to be functions of the Age of Information (AoI). This dependence allows us to encapsulate many applications and opens the door for more sophisticated systems to be studied. However, this same dependence on the AoI engenders technical and analytical difficulties. Our paper provides a first step in addressing these difficulties. Specifically, we first showcase the regularity and other critical characteristics of the age process in our system of interest. Then, we provide a framework to establish the Lagrange stability and positive recurrence of the process. Building on these results, we provide an approach, dubbed as the moment closure technique, to compute the m-th moment of the age process for any m≥1. Interestingly, this technique allows us to approximate the average age of various systems by solving a simple set of linear equations.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114701778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：