Journal of Communications and Networks最新文献

筛选
英文 中文
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
Spectrum cartography based on dynamic compressed sensing by using multiple domains information 基于多域信息动态压缩感知的频谱制图
IF 3.6 3区 计算机科学
Journal of Communications and Networks Pub Date : 2023-08-01 DOI: 10.23919/JCN.2023.000028
Haiyang Xia;Song Zha;Jijun Huang;Jibin Liu;Peiguo Liu
{"title":"Spectrum cartography based on dynamic compressed sensing by using multiple domains information","authors":"Haiyang Xia;Song Zha;Jijun Huang;Jibin Liu;Peiguo Liu","doi":"10.23919/JCN.2023.000028","DOIUrl":"https://doi.org/10.23919/JCN.2023.000028","url":null,"abstract":"Radio maps have experienced their success in applications of wireless communications for years by offering metrics of radio frequency (RF) information, e.g., power spectral density (PSD), within a geographical region of interest. Spectrum cartography technique constructs radio maps to expand the abilities of RF awareness. However, seldom of existing methods aim at constructing radio maps by utilizing multiple domains information. In this paper, a novel framework inspired by dynamic compressed sensing (DCS) has been proposed firstly to solve this problem. This flexible framework first to apply joint group-Lasso for PSD map construction based on the different sparse patterns between space and frequency domains as well as innovatively utilizes transmitters' mobility patterns for support prediction of DCS. Simulation experiments have been processed to assess the performance of methods within the proposed framework and framework's superiority has been proven.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 4","pages":"507-515"},"PeriodicalIF":3.6,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/5449605/10251734/10251736.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49941879","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
Information for authors 作者信息
IF 3.6 3区 计算机科学
Journal of Communications and Networks Pub Date : 2023-08-01 DOI: 10.23919/JCN.2023.100029
{"title":"Information for authors","authors":"","doi":"10.23919/JCN.2023.100029","DOIUrl":"https://doi.org/10.23919/JCN.2023.100029","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 4","pages":"545-549"},"PeriodicalIF":3.6,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/5449605/10251734/10251738.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49941924","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-08-01 DOI: 10.23919/JCN.2023.100030
{"title":"Open access publishing agreement","authors":"","doi":"10.23919/JCN.2023.100030","DOIUrl":"https://doi.org/10.23919/JCN.2023.100030","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 4","pages":"550-552"},"PeriodicalIF":3.6,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/5449605/10251734/10251740.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49941922","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
Efficient end-to-end failure probing matrix construction in data center networks 数据中心网络中有效的端到端故障探测矩阵构建
IF 3.6 3区 计算机科学
Journal of Communications and Networks Pub Date : 2023-08-01 DOI: 10.23919/JCN.2023.000029
Zequn Jia;Qiang Liu;Ying He;Qianqian Wu;Ren Ping Liu;Yantao Sun
{"title":"Efficient end-to-end failure probing matrix construction in data center networks","authors":"Zequn Jia;Qiang Liu;Ying He;Qianqian Wu;Ren Ping Liu;Yantao Sun","doi":"10.23919/JCN.2023.000029","DOIUrl":"https://doi.org/10.23919/JCN.2023.000029","url":null,"abstract":"Data centers play an essential role in the functioning of modern society. However, failures are unavoidable in data center networks (DCN) and will lead to negative impact on all applications. Therefore, researchers are interested in the rapid detection and localization of failures in DCNs. In this paper, we present a theoretical model to analyze the end-to-end failure detection methods in data center networks. Our numerical results verify that the proposed theoretical model is accurate. In addition, we propose an algorithm to construct probing matrices based on an enhanced probing path selection indicator. We also introduce deep reinforcement learning (DRL) method to solve the problem and propose a DRL-based probing matrix construction algorithm. Our experimental results show that both of the proposed algorithms for constructing probing matrices achieve better performance in detection accuracy than existing methods. We discussed different scenarios that the algorithms are applicable to that can improve detection accuracy or construction speed performance.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 4","pages":"532-543"},"PeriodicalIF":3.6,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/5449605/10251734/10251737.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49941877","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
Joint association and resource allocation for multi-hop integrated access and backhaul (IAB) network 多跳综合接入回程(IAB)网络的联合关联与资源分配
IF 3.6 3区 计算机科学
Journal of Communications and Networks Pub Date : 2023-07-21 DOI: 10.23919/JCN.2022.000041
Byungju Lim;Ju-Hyung Lee;Jae-Hong Kwon;Ki-Hun Kim;Jong-Man Lee;Hyun Park;Young-Seok Ha;Young-Jin Han;Young-Chai Ko
{"title":"Joint association and resource allocation for multi-hop integrated access and backhaul (IAB) network","authors":"Byungju Lim;Ju-Hyung Lee;Jae-Hong Kwon;Ki-Hun Kim;Jong-Man Lee;Hyun Park;Young-Seok Ha;Young-Jin Han;Young-Chai Ko","doi":"10.23919/JCN.2022.000041","DOIUrl":"https://doi.org/10.23919/JCN.2022.000041","url":null,"abstract":"Integrated access and backhaul (IAB) network is envisioned as a novel network architecture for increasing the network capacity and coverage. To facilitate the IAB network, the appropriate methods of wireless link association and resource management are required. In this paper, we investigate the joint optimization problem of association and resource allocation in terms of subchannel and power for IAB network. In particular, we handle the association and resource allocation problems for wireless backhaul and access links considering multi-hop backhauling. Since the optimization problem for IAB network is formulated as a mixed integer non-linear programming (MINLP), we divide it into three subproblems for association, subchannel allocation, and power allocation, respectively, and these subproblems are solved alternatively to obtain a local optimal solution. For the association problem, we adopt the Lagrangian duality approach to configure the backhaul and access links and successive convex approximation (SCA) approach is used to solve the subchannel and power allocation problems efficiently. Simulation results demonstrate that the proposed algorithm achieves better performance than single-hop (SH) backhauling based network and enhances the capacity and coverage by configuring the multi-hop (MH) backhauling.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 4","pages":"440-455"},"PeriodicalIF":3.6,"publicationDate":"2023-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/5449605/10251734/10190213.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49941936","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}
引用次数: 2
A novel group management scheme of clustered federated learning for mobile traffic prediction in mobile edge computing systems 一种新的基于聚类联邦学习的移动流量预测组管理方案
IF 3.6 3区 计算机科学
Journal of Communications and Networks Pub Date : 2023-07-21 DOI: 10.23919/JCN.2023.000025
Faranaksadat Solat;Tae Yeon Kim;Joohyung Lee
{"title":"A novel group management scheme of clustered federated learning for mobile traffic prediction in mobile edge computing systems","authors":"Faranaksadat Solat;Tae Yeon Kim;Joohyung Lee","doi":"10.23919/JCN.2023.000025","DOIUrl":"https://doi.org/10.23919/JCN.2023.000025","url":null,"abstract":"This study developed a novel group management scheme based on clustered federated learning (FL) for mobile traffic prediction (referred to as FedGM) in mobile edge computing (MEC) systems. In FedGM, to improve the convergence time during the FL procedure, we considered multiple MEC servers to first be clustered based on their geographic locations and augmented data patterns as references for clustering. In each cluster, by alleviating the straggler impact owing to the heterogeneity of MEC servers, we then designed a group management scheme that optimizes i) the number of groups to be created and ii) the group association of the MEC servers by minimizing their average idle time and group creation cost. For this purpose, we rigorously formulated analytical models for the computation time for local training and estimated the average idle time by applying different frequencies of local training over the MEC servers. The optimization problem was designed using a non-convex problem, and thus a genetic-based heuristic approach was devised for determining a suboptimal solution. By reducing the average idle time, thereby increasing the workload of the MEC servers, the experimental results for two real-world mobile traffic datasets show that FedGM surpasses previous state-of-the-art methods in terms of convergence speed with an acceptable accuracy loss.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 4","pages":"480-490"},"PeriodicalIF":3.6,"publicationDate":"2023-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/5449605/10251734/10190215.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49941933","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
A pluggable module for enabling a trusted edge device management system based on microservice 一个可插拔模块,用于启用基于微服务的可信边缘设备管理系统
IF 3.6 3区 计算机科学
Journal of Communications and Networks Pub Date : 2023-06-08 DOI: 10.23919/JCN.2023.000023
Shih-Hsiung Lee;Jue-Zhi Liu
{"title":"A pluggable module for enabling a trusted edge device management system based on microservice","authors":"Shih-Hsiung Lee;Jue-Zhi Liu","doi":"10.23919/JCN.2023.000023","DOIUrl":"https://doi.org/10.23919/JCN.2023.000023","url":null,"abstract":"In the development of the intelligent Internet of things, edge computing plays a key role. Not only that it has the characteristics of a quick response, but it can also effectively reduce the burden of cloud computing. In addition, it can also extend the application of network edge through the coexistence and collaboration with the cloud system. However, with a large number of edge devices being deployed, the previous remote device management system will face the challenges of resource constraints and software firmware compatibility. In addition, implementing remote fault management, configuration management, accounting management, performance management, and security management through edge device management is a key task. Therefore, this study has designed and implemented a trusted edge device management system based on a microservice and a plug-and-play hardware management device. The running state of the edge device, the functions of remote device control, and system restart are monitored remotely by in- and out-of-band management modes. In addition, in terms of data transmission security, the design concept of a trusted platform module is introduced to realize data encryption and authentication, and ensure security and reliability. In this paper, the operational feasibility of management services based on containerized microservice in edge devices is verified with system benchmarking tools without affecting system performance. According to the experimental results, the proposed architecture in this study can be effective in edge device management.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"25 3","pages":"381-391"},"PeriodicalIF":3.6,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/5449605/10190217/10146579.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49950802","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信