Journal of Communications and Networks最新文献_第8页

On the age of information of processor sharing systems 论处理器共享系统的信息时代

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2023-10-01 DOI: 10.23919/JCN.2023.000042

Benat Gandarias;Josu Doncel;Mohamad Assaad

引用次数: 0

AoI analysis and optimization in systems with computations-intensive updates 具有计算密集型更新的系统中的AoI分析和优化

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2023-10-01 DOI: 10.23919/JCN.2023.000040

Saeid Sadeghi Vilni;Mohammad Moltafet;Markus Leinonen;Marian Codreanu

{"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}

引用次数: 0

Open access publishing agreement 开放获取出版协议

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2023-10-01 DOI: 10.23919/JCN.2023.000057

引用次数: 0

Age-optimal multi-flow status updating with errors: A sample-path approach 带错误的年龄最优多流状态更新:样本路径方法

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2023-10-01 DOI: 10.23919/JCN.2023.000041

Yin Sun;Sastry Kompella

引用次数: 0

Sampling for remote estimation of an Ornstein-Uhlenbeck process through channel with unknown delay statistics 带有未知延迟统计量信道的Ornstein-Uhlenbeck过程的远程估计抽样

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2023-10-01 DOI: 10.23919/JCN.2023.000037

Yuchao Chen;Haoyue Tang;Jintao Wang;Pengkun Yang;Leandros Tassiulas

{"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}

引用次数: 0

Special issue "a Festschrift in Honor of Prof. Anthony Ephremides' 80th birthday: A journey from age of information to semantics of information" 特刊“纪念Anthony Ephremides教授八十寿辰:从资讯时代到资讯语义学之旅”

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2023-10-01 DOI: 10.23919/JCN.2023.000058

Nikolaos Pappas;Yin Sun

引用次数: 0

Timely and covert communications under deep learning-based eavesdropping and jamming effects 基于深度学习的窃听和干扰效果下的及时秘密通信

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2023-10-01 DOI: 10.23919/JCN.2023.000034

Maice Costa;Yalin E. Sagduyu

{"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}

引用次数: 0

State-aware real-time tracking and remote reconstruction of a Markov source 状态感知实时跟踪和马尔可夫源的远程重建

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2023-10-01 DOI: 10.23919/JCN.2023.000035

Mehrdad Salimnejad;Marios Kountouris;Nikolaos Pappas

{"title":"State-aware real-time tracking and remote reconstruction of a Markov source","authors":"Mehrdad Salimnejad;Marios Kountouris;Nikolaos Pappas","doi":"10.23919/JCN.2023.000035","DOIUrl":"https://doi.org/10.23919/JCN.2023.000035","url":null,"abstract":"The problem of real-time remote tracking and reconstruction of a two-state Markov process is considered here. A transmitter sends samples from an observed information source to a remote monitor over an unreliable wireless channel. The receiver, in turn, performs an action according to the state of the reconstructed source. We propose a state-aware randomized stationary sampling and transmission policy which accounts for the importance of different states of the information source, and their impact on the goal of the communication process. We then analyze the performance of the proposed policy, and compare it with existing goal-oriented joint sampling and transmission policies, with respect to a set of performance metrics. Specifically, we study the real-time reconstruction error, the cost of actuation error, the consecutive error, and a new metric, coined importance-aware consecutive error. In addition, we formulate and solve a constrained optimization problem that aims to obtain the optimal sampling probabilities that minimize the average cost of actuation error. Our results show that in the scenario of constrained sampling generation, the optimal state-aware randomized stationary policy outperforms all other sampling policies for fast evolving sources, and, under certain conditions, for slowly varying sources. Otherwise, a semantics-aware policy performs better only when the source is slowly varying.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"657-669"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323428","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431267","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}

引用次数: 0

Fresh multiple access: A unified framework based on large models and mean-field approximations 新的多址访问:基于大模型和平均场近似的统一框架

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2023-10-01 DOI: 10.23919/JCN.2023.000044

Haiming Hui;Shuqi Wei;Wei Chen

{"title":"Fresh multiple access: A unified framework based on large models and mean-field approximations","authors":"Haiming Hui;Shuqi Wei;Wei Chen","doi":"10.23919/JCN.2023.000044","DOIUrl":"https://doi.org/10.23919/JCN.2023.000044","url":null,"abstract":"Information freshness has attracted increasingly attention in the past decade as it plays a critical role in the emerging real-time applications. Age of information (Aol) holds the promise of effectively characterizing the information freshness, hence widely considered as a fundamental performance metric. However, in multiple-device scenarios, most existing works focus on the analysis and optimization of AoI based on queueing systems. The study for a unified approach for general multiple access control scheme in freshness-oriented scenarios remains open. In this paper, we take into consideration the combination of the fundamental freshness metric AoI and multiple access control schemes to achieve efficient cross-layer analysis and optimization in freshness-oriented scenarios, which is referred to as fresh multiple access. To this end, we build a unified framework with a discrete-time tandem queue model for fresh multiple access. The unified framework enables the analysis and optimization for general multiple access protocols in fresh multiple access. To handle the high dimension framework embedded in fresh multiple access, we introduce large model approaches for the Markov chain formulation in AoI oriented scenarios. Two typical AoI-based metric are studied including age of incorrect information (AoII) and peak AoII. Moreover, to address the computational complexity of the large model, we present mean-field approximations which significantly reduces the dimension of the Markov chain model by approximating the integral affect of massive devices in fresh multiple access.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 5","pages":"598-620"},"PeriodicalIF":3.6,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10323424","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431280","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}

引用次数: 0

GaMiCO: Game-slicing based multi-interface computation offloading in 5G vehicular networks GaMiCO:基于游戏切片的5G车载网络多接口计算卸载

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2023-08-01 DOI: 10.23919/JCN.2023.000027

Suhwan Jung;Hyoil Kim;Xinyu Zhang;Sujit Dey

{"title":"GaMiCO: Game-slicing based multi-interface computation offloading in 5G vehicular networks","authors":"Suhwan Jung;Hyoil Kim;Xinyu Zhang;Sujit Dey","doi":"10.23919/JCN.2023.000027","DOIUrl":"https://doi.org/10.23919/JCN.2023.000027","url":null,"abstract":"Smart vehicles require constantly running heavy vehicular computations with their limited computation/energy resources. 5G vehicular networks have potential to resolve the issue, by letting the vehicular tasks offloaded to 5G mobile edge computing (MEC) servers. To better support vehicular computation offloading, this paper proposes a road-side 5G infrastructure consisting of multiple millimeter-wave (mmWave) small-cell base stations (BSs) and a cellular mid-band based macro-cell BS where each BS is equipped with an MEC server. Then, the vehicles with mmWave/mid-band dual interfaces can decide which BS to choose for offloading. We propose a decentralized offloading decision mechanism where each vehicle tries to minimize the time-energy joint cost with three choices: local computing, offloading to a small-cell MEC, offloading to a macro-cell MEC. In particular, we model the problem as an ordinal potential game, derive its potential function to ensure the existence of and finite-time convergence to a Nash equilibrium (NE), analyze its Price-of-Anarchy, and develop an iterative offloading decision update algorithm. In doing so, we also consider slicing the global game into multiple non-overlapping smaller games and running them in parallel, to investigate the best slicing strategy. Our extensive simulations show the game's real-time convergence to an NE, reveal the NE's near-optimal performance, and present the efficacy of the proposed game slicing.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 4","pages":"491-506"},"PeriodicalIF":3.6,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/5449605/10251734/10251735.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49941880","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}

引用次数: 0