IEEE Transactions on Network Science and Engineering最新文献

{"title":"Delay-Aware Robust Edge Network Hardening Under Decision-Dependent Uncertainty","authors":"Jiaming Cheng;Duong Thuy Anh Nguyen;Ni Trieu;Duong Tung Nguyen","doi":"10.1109/TNSE.2025.3548020","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3548020","url":null,"abstract":"Edge computing promises to offer low-latency and ubiquitous computation to numerous devices at the network edge. For delay-sensitive applications, link delays significantly affect service quality. These delays can fluctuate substantially over time due to various factors such as network congestion, changing traffic conditions, cyberattacks, component failures, and natural disasters. Thus, it is crucial to efficiently harden the edge network to mitigate link delay variation and ensure a stable and improved user experience. To this end, we propose a novel robust model for optimal edge network hardening, considering link delay uncertainty. Unlike existing literature that treats uncertainties as exogenous, our model incorporates an endogenous uncertainty set to properly capture the impact of hardening and workload allocation decisions on link delays. However, the endogenous set introduces additional complexity to the problem due to the interdependence between decisions and uncertainties. To address this, we present two efficient methods to transform the problem into a solvable form. Extensive numerical results demonstrate the effectiveness of the proposed approach in mitigating delay variations and enhancing system performance.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 3","pages":"2388-2401"},"PeriodicalIF":6.7,"publicationDate":"2025-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143871101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Mode-Dependent Filtering for Networked Semi-Markov Jump Systems by an AET-Based Round-Robin Protocol","authors":"Wei Qian;Wudi Li;Yanmin Wu;Bin Xu","doi":"10.1109/TNSE.2025.3547935","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3547935","url":null,"abstract":"This article is devoted to the mode-dependent <inline-formula><tex-math>$bm {mathcal {H}}_{infty }$</tex-math></inline-formula> filtering problem for a class of networked semi-Markov jump systems subject to multisensor transmission noises. Considering the constraints of limited bandwidth in practical engineering applications, a new data transmission mechanism of adaptive event triggered-based round-robin protocol is proposed, which can simultaneously save communication resources and reduce data conflicts between the sensor network and the remote filter. Meanwhile, to more accurately describe the complexity of the communication network environment, the data transmission mechanism includes transmission noises, mode information of the systems and semi-Markov switching parameters, which can enhance the flexibility of data transmission. Then, by utilizing the vector augmentation method, a novel mode-dependent <inline-formula><tex-math>$bm {mathcal {H}}_{infty }$</tex-math></inline-formula> filter structure integrating semi-Markov jump modes and sensor scheduling nodes is constructed, which can improve the estimation performance of the filter. Next, by considering the upper bound of sojourn time for all system modes, a non-monotonic Lyapunov function is constructed to get hold of the conservative results by relaxing the monotonic requirement of sojourn time. Based on the semi-definite programming technique and vector augmentation method, sufficient conditions are acquired that guarantee the <inline-formula><tex-math>$bm {sigma }$</tex-math></inline-formula>-error mean-square stability of filtering error dynamics with prescribed <inline-formula><tex-math>$bm {mathcal {H}}_{infty }$</tex-math></inline-formula> performance, and the desired filter parameters can be calculated by solving some recursive linear matrix inequalities. Ultimately, a numerical example and a practical example of F-404 aircraft engine system are carried out to validate the effectiveness and applicability of the proposed filter design strategy.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 3","pages":"2373-2387"},"PeriodicalIF":6.7,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143871065","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"ProxaDyn: A Proximity-Aware Dynamic Caching Approach for Named Data Networks","authors":"Matta Krishna Kumari;Nikhil Tripathi;Piyush Joshi","doi":"10.1109/TNSE.2025.3547424","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3547424","url":null,"abstract":"Named Data Network (NDN), a future Internet architecture is introduced to address the shortcomings of the current Internet architecture. NDN supports in-network caching to facilitate scalable content distribution and enhance overall network performance. However, the known NDN caching strategies suffer from a few common drawbacks, such as inefficient cache utilization, high content redundancy, and overhead due to lookup repetition. To address these issues, in this paper, we propose a novel caching strategy called ProxaDyn for efficient content lookup, placement, and replacement. During the content lookup phase, ProxaDyn interacts exclusively with the router responsible for caching a particular content. This eliminates interaction with other intermediate routers, thereby significantly reducing content access latency. For content placement, ProxaDyn strategically selects an on-path router based on content popularity. Popular content is placed in the cache of a router closer to the consumer, while less popular content is cached in a router away from the consumer. This approach significantly improves the cache hits and reduces the access latency. We test ProxaDyn over a diverse range of real-world network topologies. Using extensive experiments, we show that ProxaDyn could achieve significantly better results compared to the state-of-the-art NDN caching strategies.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 3","pages":"2360-2372"},"PeriodicalIF":6.7,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Blockchain Assisted Industrial Data Registration and Reconstruction Management Scheme","authors":"Zewei Liu;Chunqiang Hu;Ruifeng Zhao;Pengfei Hu;Arwa Alrawais;Tao Xiang","doi":"10.1109/TNSE.2025.3547409","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3547409","url":null,"abstract":"As a typical Industrial Internet of Things (IIOT) application, three-dimensional point cloud reconstruction brings us benefits and convenience. The reconstructed mathematical models can be employed to facilitate precise quality control, which is important for the usage of the reconstructed products. Conversely, traditional reconstruction methods are characterized by inefficiency, and the errors inherent in each phase of the reconstruction chain often remain opaque and vulnerable to tampering. Hence, we propose a blockchain assisted industrial data registration and reconstruction management scheme (BIRMS). First, the tamper-proof and distributed storage characteristics of blockchain are fully utilized to ensure the authenticity and transparency of output errors throughout the reconstruction process. It is worth noting that smart contracts are designed to facilitate the management and query of on-chain data. Then, a novel swarm intelligence algorithm called EGWODA is designed to handle the issue which is low efficiency in the registration step of reconstruction. Finally, simulation results indicate the feasibility and efficiency of the BIRMS.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 3","pages":"2345-2359"},"PeriodicalIF":6.7,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870841","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Hybrid EKF/WUFIR Filter for Indoor Localization Integrating INS and UWB Data","authors":"Long Cheng;Jiahe Song;Wenhao Zhao","doi":"10.1109/TNSE.2025.3546918","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3546918","url":null,"abstract":"Due to the complex and variable indoor environment, ultra-wideband (UWB) signal transmission is often obstructed by walls and obstacles, resulting in non-line-of-sight (NLOS), which reduces localization accuracy. Inertial navigation system (INS) is an autonomous navigation system that does not rely on external information and is not affected by NLOS. Therefore, a hybrid EKF/WUFIR filter indoor localization algorithm that integrates INS and UWB data is proposed. The proposed algorithm is composed of three parts: INS localization, UWB localization and data fusion. In the INS localization part, the motion model is used to determine the state of the target in real time using measurement data obtained from the inertial measurement unit (IMU). In the UWB localization part, a resettable residual weighted particle filter algorithm is proposed to mitigate the effect of NLOS on the localization results. In the data fusion part, a hybrid filtering algorithm combining extended Kalman filter (EKF) and weighted unbiased finite impulse response (WUFIR) filtering is proposed to fuse the INS and UWB localization data. Simulation and experimental results show that the proposed algorithm outperforms other comparative algorithms in terms of robustness and localization accuracy.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 3","pages":"2266-2276"},"PeriodicalIF":6.7,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143871070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Online Influence Maximization With Semi-Bandit Feedback Under Corruptions","authors":"Xiaotong Cheng;Behzad Nourani-Koliji;Setareh Maghsudi","doi":"10.1109/TNSE.2025.3547240","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3547240","url":null,"abstract":"In this article, we investigate the online influence maximization in social networks. Most prior research studies on online influence maximization assume that the nodes are fully cooperative and act according to their stochastically generated influence probabilities on others. In contrast, we study the online influence maximization problem in the presence of some corrupted nodes whose damaging effects diffuse throughout the network. We propose a novel bandit algorithm, CW-IMLinUCB, which robustly learns and finds the optimal seed set in the presence of corrupted users. Theoretical analyses establish that the regret performance of our proposed algorithm is better than the state-of-the-art online influence maximization algorithms. Extensive empirical evaluations on synthetic and real-world datasets also show the superior performance of our proposed algorithm.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 3","pages":"2308-2321"},"PeriodicalIF":6.7,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Achievable Rate Optimization of RIS-Assisted Multi-Antenna FD DF Relay Cooperation System With SWIPT Technology","authors":"Shunwai Zhang;Qingzhu Ma;Hao Cheng;Rongfang Song","doi":"10.1109/TNSE.2025.3546759","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3546759","url":null,"abstract":"To pursue higher achievable rate and wider coverage transmission in wireless communications, this paper proposes a novel reconfigurable intelligent surfaces (RIS)-assisted multi-antenna full-duplex (FD) decode-and-forward (DF) relay cooperation system with simultaneous wireless information and power transfer (SWIPT) technology, which can fully enjoy the advantages of both RIS and SWIPT-based FD DF relay with multiple antennas. In order to maximize the achievable rate of the proposed system, the phase shifts of RIS, the precoding vector and the power splitting factor are jointly optimized. At first, optimal phase shifts of RIS are achieved via aligning the phases of received signals at the destination. Subsequently, the alternating optimization (AO)-based algorithm is adopted to decompose the original optimization problem into two sub-problems, i.e., the precoding vector optimization and the power splitting factor optimization. The sub-problems are still complicated and nonconvex, and the successive convex approximation (SCA) method is applied to reformulate them into convex problems which can be further solved by iterative method. Simulation results illustrate the advantages of the proposed system and reveal the effects of various factors on its performance. Simulation results also demonstrate the superiorities of the joint optimization algorithm compared with its counterparts.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 3","pages":"2243-2253"},"PeriodicalIF":6.7,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143871036","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Enhancing Graph Structure Learning via Motif-Driven Hypergraph Construction","authors":"Jia-Le Zhao;Xian-Jie Zhang;Xiao Ding;Xingyi Zhang;Hai-Feng Zhang","doi":"10.1109/TNSE.2025.3547349","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3547349","url":null,"abstract":"Graph neural networks (GNNs), as a cutting-edge technology in deep learning, perform particularly well in various tasks that process graph structure data. However, their foundation on pairwise graphs often limits their capacity to capture latent higher-order topological semantic information. Thus, it is crucial to find a way to extract the latent higher-order information of graphs without missing the lower-order information of the original graph. To address this issue, we here develop a method to construct hypergraph based on motifs, and then a novel neural network framework, named MD-HGNN, is proposed for enhanced graph learning. Specifically, we first utilize motifs of the original graph to construct the hypergraph and eliminate nested structures within the hypergraph to prevent information redundancy. Subsequently, GNNs and hypergraph neural networks (HGNNs) are employed separately to extract the lower-order and higher-order topological semantic information of the graph. Finally, the lower-order and higher-order information are integrated to obtain an embedded representation of graph. Extensive experimental results demonstrate that MD-HGNN preserves the original lower-order graph structure information while effectively extracting higher-order features. Moreover, its performance and robustness are validated across different downstream tasks.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 3","pages":"2333-2344"},"PeriodicalIF":6.7,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"OLMS: A Flexible Online Learning Multi-Path Scheduling Framework","authors":"Kechao Cai;Zhuoyue Chen;Jinbei Zhang;John C. S. Lui","doi":"10.1109/TNSE.2025.3546957","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3546957","url":null,"abstract":"Over the past decade, there has been a tremendous surge in the inter-connectivity among hosts in networks. Many multi-path transport protocols, such as MPTCP, MPQUIC, and MPRDMA, have emerged to facilitate multi-path data transmissions between pairs of hosts. However, existing packet schedulers in these protocols are quite limited as they neglect the stochastic nature inherent in heterogeneous paths, such as, round-trip time and available bandwidth. Moreover, users have diverse requirements; for instance, some prioritize low latency, while others consistently seek to achieve high bandwidth. In this paper, we propose a flexible Online Learning Multi-path Scheduling (OLMS) framework to schedule packets to multiple paths and meet various user-defined requirements by learning the dynamic characteristics of paths in various applications. Specifically, we consider two types of applications, which are 1) <italic>maxRTT constrained</i> and 2) <italic>bandwidth constrained</i>, and use OLMS to schedule packets to satisfy the distinct user-defined requirements. Our theoretical analysis demonstrates that OLMS achieves guarantees with <italic>sublinear</i> regret and <italic>sublinear</i> violation. Furthermore, we implement a prototype of OLMS in MPQUIC and conduct experiments across different scenarios. Our experiments on Mininet show that OLMS enables an 8.42%–18.71% increase in bandwidth utilization in the maxRTT constrained application and negligible violations of user-defined requirements in both applications compared to other schedulers. Additionally, OLMS reduces flow completion times by 4.22%–10.26% compared to other schedulers, all without incurring large overhead.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 3","pages":"2277-2291"},"PeriodicalIF":6.7,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Rumor Suppression in a Three-Layer Network: A Reinforcement Learning Algorithm","authors":"Xiaojing Zhong;Jing Zhang;Aojing Wang;Guiyun Liu;Feiqi Deng;Jianhui Wang","doi":"10.1109/TNSE.2025.3546961","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3546961","url":null,"abstract":"Rumor propagation poses a significant threat to social stability and public order, and controlling its spread can effectively reduce unnecessary panic and misunderstanding. Rumor control is primarily achieved by simulating rumors spread on social networks and disseminating the truth or restricting propagation pathways. However, current studies usually only apply the optimal control theory, which leads to difficulties in coping with complex and stochastic network propagation environments. To address these issues, this paper constructs a three-layer network rumor control model (SICR-3M3W) that considers the dual refutation mechanism and formulates an optimal control problem for this model. Based on the reinforcement learning framework, we design a Proximal Policy Optimization (PPO) algorithm to solve this problem intelligently. Finally, experiments based on a real-world data case are conducted, and the results demonstrate that our three-layer model can effectively simulate the rumor propagation process. Moreover, the designed PPO controller can achieve optimal control outcomes.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 3","pages":"2292-2307"},"PeriodicalIF":6.7,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143870983","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}