Pub Date : 2023-10-01DOI: 10.23919/JCN.2023.000036
Polina Kutsevol;Onur Ayan;Wolfgang Kellerer
With the proliferation of wireless networks as an indispensable component for a wide range of distributed Cyber-Physical Systems applications, the paradigm of the networking algorithms design independent from application goals abolishes. Thus, the control-aware design of the wireless resource management for wireless networked control systems (WNCSs) is shown to be more effective from the application perspective than the conventional approaches. In WNCS, the controller monitors and actuates the plant through the status updates received from the sensor over the network. This work focuses on application-aware transmission scheduling over multi-hop networks for WNCSs. As an intermediate metric, we use age of information (AoI) that captures the freshness of the data on the controller. Being a widely adopted metric for real-time applications, AoI does not consider the particular goal of control applications. Nevertheless, AoI is tightly coupled with the estimation error at the controller that, in turn, directly impacts control performance. We derive the distribution of AoI in the multi-hop network that exploits a time-varying transmission schedule. Using this distribution, we express the expected estimation error to formulate a minimization objective for the scheduling. We propose exact and heuristic methods for solving the optimization and compare different approaches to resource allocation with respect to estimation error and control costs. The proposed scheduling algorithm improves the control performance by at least 15% compared to the scheduling minimizing AoI. Introducing the schedule variability over time allows for further performance improvement by 30% in scenarios with scarce network resources.
{"title":"Control-aware scheduling over multi-hop networks","authors":"Polina Kutsevol;Onur Ayan;Wolfgang Kellerer","doi":"10.23919/JCN.2023.000036","DOIUrl":"https://doi.org/10.23919/JCN.2023.000036","url":null,"abstract":"With the proliferation of wireless networks as an indispensable component for a wide range of distributed Cyber-Physical Systems applications, the paradigm of the networking algorithms design independent from application goals abolishes. Thus, the control-aware design of the wireless resource management for wireless networked control systems (WNCSs) is shown to be more effective from the application perspective than the conventional approaches. In WNCS, the controller monitors and actuates the plant through the status updates received from the sensor over the network. This work focuses on application-aware transmission scheduling over multi-hop networks for WNCSs. As an intermediate metric, we use age of information (AoI) that captures the freshness of the data on the controller. Being a widely adopted metric for real-time applications, AoI does not consider the particular goal of control applications. Nevertheless, AoI is tightly coupled with the estimation error at the controller that, in turn, directly impacts control performance. We derive the distribution of AoI in the multi-hop network that exploits a time-varying transmission schedule. Using this distribution, we express the expected estimation error to formulate a minimization objective for the scheduling. We propose exact and heuristic methods for solving the optimization and compare different approaches to resource allocation with respect to estimation error and control costs. The proposed scheduling algorithm improves the control performance by at least 15% compared to the scheduling minimizing AoI. Introducing the schedule variability over time allows for further performance improvement by 30% in scenarios with scarce network resources.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"688-698"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323430","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431264","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We consider a time slotted communication network consisting of a base station (BS), an adversary, Ν users and N s communication channels. In the first part of the paper, we consider the setting where N s communication channels N s are heterogeneously divided among Ν users. The BS transmits an update to the ¿th user on a subset of the communication channels N s,i where N s,i ∩ N s,j is not necessarily an empty set. At each time slot, the BS transmits an update packet to a user through a communication channel and the adversary aims to block the update packet sent by the BS by blocking a communication channel. The BS has η discrete transmission power levels to communicate with the users and the adversary has m discrete blocking power levels to block the communication channels. The probability of successful transmission of an update packet depends on these power levels. The BS and the adversary have a transmission and blocking average power constraint, respectively. We provide a universal lower bound for the average age of information for this communication network. We prove that the uniform user choosing policy, the uniform communication channel choosing policy with any arbitrary feasible transmission power choosing policy is 4 optimal; and the max-age user choosing policy, the uniform communication channel choosing policy with any arbitrary feasible transmission power choosing policy is 2 optimal. In the second part of the paper, we consider the setting where the BS chooses a transmission policy and the adversary chooses a blocking policy from the set of randomized stationary policies and N s,i = N s for all i, i.e., all users can receive updates on all channels. We show that a Nash equilibrium may or may not exist for this communication network, and identify special cases where a Nash equilibrium always exists.
{"title":"Age of information games between power constrained schedulers and adversaries","authors":"Subhankar Banerjee;Sennur Ulukus;Anthony Ephremides","doi":"10.23919/JCN.2023.000046","DOIUrl":"https://doi.org/10.23919/JCN.2023.000046","url":null,"abstract":"We consider a time slotted communication network consisting of a base station (BS), an adversary, Ν users and N\u0000<inf>s</inf>\u0000 communication channels. In the first part of the paper, we consider the setting where N\u0000<inf>s</inf>\u0000 communication channels N\u0000<inf>s</inf>\u0000 are heterogeneously divided among Ν users. The BS transmits an update to the ¿th user on a subset of the communication channels N\u0000<inf>s,i</inf>\u0000 where N\u0000<inf>s,i</inf>\u0000 ∩ N\u0000<inf>s,j</inf>\u0000 is not necessarily an empty set. At each time slot, the BS transmits an update packet to a user through a communication channel and the adversary aims to block the update packet sent by the BS by blocking a communication channel. The BS has η discrete transmission power levels to communicate with the users and the adversary has m discrete blocking power levels to block the communication channels. The probability of successful transmission of an update packet depends on these power levels. The BS and the adversary have a transmission and blocking average power constraint, respectively. We provide a universal lower bound for the average age of information for this communication network. We prove that the uniform user choosing policy, the uniform communication channel choosing policy with any arbitrary feasible transmission power choosing policy is 4 optimal; and the max-age user choosing policy, the uniform communication channel choosing policy with any arbitrary feasible transmission power choosing policy is 2 optimal. In the second part of the paper, we consider the setting where the BS chooses a transmission policy and the adversary chooses a blocking policy from the set of randomized stationary policies and N\u0000<inf>s,i</inf>\u0000 = N\u0000<inf>s</inf>\u0000 for all i, i.e., all users can receive updates on all channels. We show that a Nash equilibrium may or may not exist for this communication network, and identify special cases where a Nash equilibrium always exists.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"631-642"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323426","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431278","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-01DOI: 10.23919/JCN.2023.000055
{"title":"Information for authors","authors":"","doi":"10.23919/JCN.2023.000055","DOIUrl":"https://doi.org/10.23919/JCN.2023.000055","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"700-704"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323431","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431268","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-01DOI: 10.23919/JCN.2023.000042
Benat Gandarias;Josu Doncel;Mohamad Assaad
In this paper, we examine the age of information (AoI) of a source sending status updates to a monitor through a queue operating under the processor sharing (PS) discipline. In the PS queueing discipline, all the updates are served simultaneously and, therefore, none of of the jobs wait in the queue to get service. While AoI has been well studied for various queuing models and policies, less attention has been given so far to the PS discipline. We first consider the M/M/1/2 queue with and without preemption and provide closed-form expressions for the average AoI in this case. We overcome the challenges of deriving the AoI expression by employing the stochastic hybrid systems (SHS) tool. We then extend the analysis to the M/M/1 queue with one and two sources and provide numerical results for these cases. Our results show that PS can outperform the M/M/1/1∗ queue in some cases.
{"title":"On the age of information of processor sharing systems","authors":"Benat Gandarias;Josu Doncel;Mohamad Assaad","doi":"10.23919/JCN.2023.000042","DOIUrl":"https://doi.org/10.23919/JCN.2023.000042","url":null,"abstract":"In this paper, we examine the age of information (AoI) of a source sending status updates to a monitor through a queue operating under the processor sharing (PS) discipline. In the PS queueing discipline, all the updates are served simultaneously and, therefore, none of of the jobs wait in the queue to get service. While AoI has been well studied for various queuing models and policies, less attention has been given so far to the PS discipline. We first consider the M/M/1/2 queue with and without preemption and provide closed-form expressions for the average AoI in this case. We overcome the challenges of deriving the AoI expression by employing the stochastic hybrid systems (SHS) tool. We then extend the analysis to the M/M/1 queue with one and two sources and provide numerical results for these cases. Our results show that PS can outperform the M/M/1/1∗ queue in some cases.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"643-656"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323427","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431266","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We consider a status update system consisting of a sampler, a controller, a processing unit, a transmitter, and a sink. The sampler generates a sample upon receiving a request from the controller and the sample requires further processing before transmission, hence is computation-intensive. This is mathematically modeled by a server called process server. After processing the sample, the status update packet is generated and sent to the transmitter for delivery to the sink. This is mathematically modeled by a server called transmit server. The service time of each packet at the transmit and process servers follow geometric distributions. Moreover, we consider that the servers serve packets under the blocking policy, i.e., whenever a server is busy at the arrival time of a new packet, the new arriving packet is blocked and discarded. We analyze the average age of information (AoI) for two fixed policies, namely, 1) zero-wait-one policy and 2) zero-wait-blocking policy. According to the former policy, the controller requests sampling when there is no packet in the system. According to the zero-wait-blocking policy, the controller requests a sample whenever the process server is idle. Furthermore, we develop an optimal control policy to minimize the average AoI using the tools of Markov decision process (MDP). In numerical results, we evaluate the performance of the policies under different system parameters. Moreover, we analyze the structure of the optimal policy.
{"title":"AoI analysis and optimization in systems with computations-intensive updates","authors":"Saeid Sadeghi Vilni;Mohammad Moltafet;Markus Leinonen;Marian Codreanu","doi":"10.23919/JCN.2023.000040","DOIUrl":"https://doi.org/10.23919/JCN.2023.000040","url":null,"abstract":"We consider a status update system consisting of a sampler, a controller, a processing unit, a transmitter, and a sink. The sampler generates a sample upon receiving a request from the controller and the sample requires further processing before transmission, hence is computation-intensive. This is mathematically modeled by a server called process server. After processing the sample, the status update packet is generated and sent to the transmitter for delivery to the sink. This is mathematically modeled by a server called transmit server. The service time of each packet at the transmit and process servers follow geometric distributions. Moreover, we consider that the servers serve packets under the blocking policy, i.e., whenever a server is busy at the arrival time of a new packet, the new arriving packet is blocked and discarded. We analyze the average age of information (AoI) for two fixed policies, namely, 1) zero-wait-one policy and 2) zero-wait-blocking policy. According to the former policy, the controller requests sampling when there is no packet in the system. According to the zero-wait-blocking policy, the controller requests a sample whenever the process server is idle. Furthermore, we develop an optimal control policy to minimize the average AoI using the tools of Markov decision process (MDP). In numerical results, we evaluate the performance of the policies under different system parameters. Moreover, we analyze the structure of the optimal policy.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"585-597"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323423","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-01DOI: 10.23919/JCN.2023.000057
{"title":"Open access publishing agreement","authors":"","doi":"10.23919/JCN.2023.000057","DOIUrl":"https://doi.org/10.23919/JCN.2023.000057","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"705-707"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323433","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-01DOI: 10.23919/JCN.2023.000041
Yin Sun;Sastry Kompella
In this paper, we study an age of information minimization problem in continuous-time and discrete-time status updating systems that involve multiple packet flows, multiple servers, and transmission errors. Four scheduling policies are proposed. We develop a unifying sample-path approach and use it to show that, when the packet generation and arrival times are synchronized across the flows, the proposed policies are (near) optimal for minimizing any time-dependent, symmetric, and non-decreasing penalty function of the ages of the flows over time in a stochastic ordering sense.
{"title":"Age-optimal multi-flow status updating with errors: A sample-path approach","authors":"Yin Sun;Sastry Kompella","doi":"10.23919/JCN.2023.000041","DOIUrl":"https://doi.org/10.23919/JCN.2023.000041","url":null,"abstract":"In this paper, we study an age of information minimization problem in continuous-time and discrete-time status updating systems that involve multiple packet flows, multiple servers, and transmission errors. Four scheduling policies are proposed. We develop a unifying sample-path approach and use it to show that, when the packet generation and arrival times are synchronized across the flows, the proposed policies are (near) optimal for minimizing any time-dependent, symmetric, and non-decreasing penalty function of the ages of the flows over time in a stochastic ordering sense.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"570-584"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323422","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we consider sampling an Ornstein-Uhlenbeck (OU) process through a channel for remote estimation. The goal is to minimize the mean square error (MSE) at the estimator under a sampling frequency constraint when the channel delay statistics is unknown. Sampling for MSE minimization is reformulated into an optimal stopping problem. By revisiting the threshold structure of the optimal stopping policy when the delay statistics is known, we propose an online sampling algorithm to learn the optimum threshold using stochastic approximation algorithm and the virtual queue method. We prove that with probability 1, the MSE of the proposed online algorithm converges to the minimum MSE that is achieved when the channel delay statistics is known. The cumulative MSE gap of our proposed algorithm compared with the minimum MSE up to the (k + 1)th sample grows with rate at most O(In k). Our proposed online algorithm can satisfy the sampling frequency constraint theoretically. Finally, simulation results are provided to demonstrate the performance of the proposed algorithm.
在本文中，我们考虑通过一个通道对一个Ornstein-Uhlenbeck (OU)过程进行采样以进行远程估计。目标是在信道延迟统计未知的情况下，在采样频率约束下最小化估计器的均方误差(MSE)。最小均方差的采样被重新表述为最优停止问题。通过回顾已知延迟统计量时最优停止策略的阈值结构，提出了一种使用随机逼近算法和虚拟队列方法学习最优阈值的在线抽样算法。我们以1的概率证明了所提出的在线算法的MSE收敛于信道延迟统计已知时所达到的最小MSE。与(k + 1)个样本的最小MSE相比，本文算法的累积MSE差以最大0 (In k)的速率增长。本文算法在理论上可以满足采样频率约束。最后给出了仿真结果，验证了所提算法的性能。
{"title":"Sampling for remote estimation of an Ornstein-Uhlenbeck process through channel with unknown delay statistics","authors":"Yuchao Chen;Haoyue Tang;Jintao Wang;Pengkun Yang;Leandros Tassiulas","doi":"10.23919/JCN.2023.000037","DOIUrl":"https://doi.org/10.23919/JCN.2023.000037","url":null,"abstract":"In this paper, we consider sampling an Ornstein-Uhlenbeck (OU) process through a channel for remote estimation. The goal is to minimize the mean square error (MSE) at the estimator under a sampling frequency constraint when the channel delay statistics is unknown. Sampling for MSE minimization is reformulated into an optimal stopping problem. By revisiting the threshold structure of the optimal stopping policy when the delay statistics is known, we propose an online sampling algorithm to learn the optimum threshold using stochastic approximation algorithm and the virtual queue method. We prove that with probability 1, the MSE of the proposed online algorithm converges to the minimum MSE that is achieved when the channel delay statistics is known. The cumulative MSE gap of our proposed algorithm compared with the minimum MSE up to the (k + 1)th sample grows with rate at most O(In k). Our proposed online algorithm can satisfy the sampling frequency constraint theoretically. Finally, simulation results are provided to demonstrate the performance of the proposed algorithm.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"670-687"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323429","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-01DOI: 10.23919/JCN.2023.000058
Nikolaos Pappas;Yin Sun
Age of Information (AoI) is an end-to-end metric that can capture one semantic property known as the timeliness of information, which is essential in status-updating systems. Semantics of Information (SoI) captures properties of information that relate to the "goal" and "purpose" of information, which is to improve the performance of systems using the information. As a new paradigm shift toward 6G communications systems, SoI will create systems that generate, process, and transmit only a small fraction of information. Thus, they consume less energy and channel resources without sacrificing their effectiveness.
信息时代(Age of Information, AoI)是一个端到端度量，它可以捕获一种称为信息时效性的语义属性，这在状态更新系统中是必不可少的。信息语义(SoI)捕获与信息的“目标”和“目的”相关的信息属性，这是为了提高使用信息的系统的性能。随着向6G通信系统的新范式转变，SoI将创建仅生成、处理和传输一小部分信息的系统。因此，他们消耗更少的能源和渠道资源，而不牺牲他们的效率。
{"title":"Special issue \"a Festschrift in Honor of Prof. Anthony Ephremides' 80th birthday: A journey from age of information to semantics of information\"","authors":"Nikolaos Pappas;Yin Sun","doi":"10.23919/JCN.2023.000058","DOIUrl":"https://doi.org/10.23919/JCN.2023.000058","url":null,"abstract":"Age of Information (AoI) is an end-to-end metric that can capture one semantic property known as the timeliness of information, which is essential in status-updating systems. Semantics of Information (SoI) captures properties of information that relate to the \"goal\" and \"purpose\" of information, which is to improve the performance of systems using the information. As a new paradigm shift toward 6G communications systems, SoI will create systems that generate, process, and transmit only a small fraction of information. Thus, they consume less energy and channel resources without sacrificing their effectiveness.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"553-555"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323434","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431272","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-01DOI: 10.23919/JCN.2023.000034
Maice Costa;Yalin E. Sagduyu
This paper explores the concept of timeliness in covert communications when faced with eavesdropping and jamming. Time-sensitive information is to be transmitted through a wireless channel between a transmitter and a receiver, while an adversary seeks to detect the communication attempts with a deep learning-based classifier (using feedforward or convolutional neural networks). The adversary jams any detected transmission, subject to an average power budget. When the transmit power is set at a high level, the outage probability decreases, resulting in more reliable communication. However, this also increases the accuracy of the adversary's detection, making it more likely for the jammer to successfully identify and jam the communication. On the other hand, using a low transmit power leads to a higher outage probability for communication but decreases the accuracy of the adversary in detecting and disrupting a transmission. The trade-off between reliability, timeliness, and stealthiness in wireless communications is analyzed in this paper by characterizing the Age of Information and its behavior under the influence of eavesdropping and jamming effects. Results indicate novel operation modes for timely and covert communications under eavesdropping and jamming effects.
{"title":"Timely and covert communications under deep learning-based eavesdropping and jamming effects","authors":"Maice Costa;Yalin E. Sagduyu","doi":"10.23919/JCN.2023.000034","DOIUrl":"https://doi.org/10.23919/JCN.2023.000034","url":null,"abstract":"This paper explores the concept of timeliness in covert communications when faced with eavesdropping and jamming. Time-sensitive information is to be transmitted through a wireless channel between a transmitter and a receiver, while an adversary seeks to detect the communication attempts with a deep learning-based classifier (using feedforward or convolutional neural networks). The adversary jams any detected transmission, subject to an average power budget. When the transmit power is set at a high level, the outage probability decreases, resulting in more reliable communication. However, this also increases the accuracy of the adversary's detection, making it more likely for the jammer to successfully identify and jam the communication. On the other hand, using a low transmit power leads to a higher outage probability for communication but decreases the accuracy of the adversary in detecting and disrupting a transmission. The trade-off between reliability, timeliness, and stealthiness in wireless communications is analyzed in this paper by characterizing the Age of Information and its behavior under the influence of eavesdropping and jamming effects. Results indicate novel operation modes for timely and covert communications under eavesdropping and jamming effects.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"621-630"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323425","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：