IEEE Transactions on Network Science and Engineering最新文献_第4页

A Stackelberg Game Framework for Energy Internet System by Operator Approach 基于算子的能源互联网系统Stackelberg博弈框架

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2025-03-28 DOI: 10.1109/TNSE.2025.3555604

Yue Chen;Peng Yi;Jinlong Lei;Xiangjun Li

{"title":"A Stackelberg Game Framework for Energy Internet System by Operator Approach","authors":"Yue Chen;Peng Yi;Jinlong Lei;Xiangjun Li","doi":"10.1109/TNSE.2025.3555604","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3555604","url":null,"abstract":"This paper proposes a Stackelberg game framework for managing an Energy Internet System that integratesrenewable energy generation, energy conversion, and energy trading. The system comprises hubs controlled by competing energy companies, incorporating both external energy trading and peer-to-peer energy exchanges. It involves multiple stakeholders whose decisions are interdependent, creating challenges in decision-making. To tackle these challenges, we propose a networked Stackelberg game framework with two main objectives. First, from the energy companies' perspective, the companies make decisions by considering strategic interactions with other companies while accounting for the best responses of passive consumers within peer-to-peer constraints. Second, from the consumer side, consumers adjust their decisions based on their observations of the companies' strategies. The framework adopts a hierarchical decision-making structure in which energy companies act as leaders, formulating strategies that anticipate consumer demand responses, while competing within a Nash game. Meanwhile, consumer clusters, managed by demand management centers, modify their energy usage based on an incentive price mechanism. To search for the equilibrium, we develop an operator-theoretic approach that combines implicit gradient methods with proximal operator splitting techniques, and prove its convergence. Numerical studies and simulations on a combined IEEE 37-bus and gas source model with multiple energy hubs validate the model's effectiveness and the efficiency of the proposed algorithms. The results demonstrate the operational efficiency and strategic stability of the system, emphasizing the advantages of active market participation for both energy companies and consumers.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"2942-2956"},"PeriodicalIF":6.7,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492254","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}

引用次数: 0

EMT: Extended Merkle Tree Structure for Inserted Data Redaction in Permissioned Blockchain 扩展的Merkle树结构在允许的bb0中插入数据编校

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2025-03-28 DOI: 10.1109/TNSE.2025.3555979

Zihan Wu;Liangmin Wang;Xiaoyu Zhang;Xia Feng

{"title":"EMT: Extended Merkle Tree Structure for Inserted Data Redaction in Permissioned Blockchain","authors":"Zihan Wu;Liangmin Wang;Xiaoyu Zhang;Xia Feng","doi":"10.1109/TNSE.2025.3555979","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3555979","url":null,"abstract":"Inserted data redaction is an important and hot security topic for permissioned blockchain. However, existing redactable schemes have two problems: (i) <italic>Uncaptured Change: Transaction-level redaction schemes modify both user-inserted data and system-generated transaction data, making it difficult to capture the changes in system-generated transactions data; (ii) <italic>Unexpected Spread: When the redaction process deletes harmful data, the consensus process may take a long time, resulting in unexpected spread of harmful data. Instead of eliminating the influence of the harmful data, it promotes its spread. To tackle these problems, we propose an Extended Merkle Tree (EMT) structure for inserted data redaction in permissioned blockchain. EMT separates the system-generated transaction data from user-inserted data, ensuring that only the inserted data can be modified during redaction. Furthermore, we design an EMT-based blockchain ledger and develop a smart contract to implement the inserted data redaction. We prove that our redaction scheme preserves the core security features of blockchain and implements redaction operations in Hyperledger Fabric. The experimental results show that our EMT-based blockchain scheme is capable of redacting the harmful inserted data while incurring less than 5% overhead compared to current permissioned blockchains.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"3025-3038"},"PeriodicalIF":6.7,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492424","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}

引用次数: 0

Link-Centric Research on the Capability Resilience of Heterogeneous Information Combat Networks 以链路为中心的异构信息作战网络能力弹性研究

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2025-03-28 DOI: 10.1109/TNSE.2025.3555384

Renjie Xu;Jiahao Liu;Jichao Li;Kewei Yang

{"title":"Link-Centric Research on the Capability Resilience of Heterogeneous Information Combat Networks","authors":"Renjie Xu;Jiahao Liu;Jichao Li;Kewei Yang","doi":"10.1109/TNSE.2025.3555384","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3555384","url":null,"abstract":"The combat system-of-systems (CSoS) in high-tech information warfare consists of multiple interconnected combat entities, which can be abstracted as a complex heterogeneous information combat network (HICN). Research on the capability resilience of a HICN is highly valuable for optimizing network structure, enhancing network survivability, and improving network security. Accordingly, this paper presents an integrated framework called HICN capability resilience framework based on network percolation (HICNCR) for assessing the capability resilience of HICN. Specifically, first, we establish a HICN model of a CSoS, taking into account the heterogeneity of entities as well as the diversity and weight of information flow. Based on this, we present an index called operational capability resilience index (OCRI) to evaluate the capability resilience of HICN. This index directly identifies which CSoS is more resilient when facing identical operational tasks, while simultaneously considering both network structure and function. Finally, we conduct extensive experiments on a military case to demonstrate the effectiveness and superiority of the proposed HICNCR. Compared to natural connectivity and other resilience metrics, it provides more valuable insights to inform the operation and design of more resilient CSoS.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"2921-2931"},"PeriodicalIF":6.7,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492215","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}

引用次数: 0

Structurally Controllable and Observable Optimal Disjoint Decomposition of Complex Systems: An Optimization Framework 复杂系统结构可控和可观察的最优不相交分解：一个优化框架

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2025-03-28 DOI: 10.1109/TNSE.2025.3556365

Sahar Maleki;Mehdi Rahmani;Hassan Zarabadipour

{"title":"Structurally Controllable and Observable Optimal Disjoint Decomposition of Complex Systems: An Optimization Framework","authors":"Sahar Maleki;Mehdi Rahmani;Hassan Zarabadipour","doi":"10.1109/TNSE.2025.3556365","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3556365","url":null,"abstract":"Decomposition of a dynamic complex system into smaller subsystems can significantly reduce the complexity and simplify the analysis, particularly in networked control design. This paper proposes a structurally controllable and observable optimal disjoint <inline-formula><tex-math>$varepsilon$</tex-math></inline-formula>-decomposition for complex systems. The methodology for this decomposition is conducted through the perspective of graph theory in conjunction with an optimization framework. To achieve this kind of decomposition, an optimization problem is first presented for the disjoint <inline-formula><tex-math>$varepsilon$</tex-math></inline-formula>-decomposition. Then, the suggested optimization problem is extended to address optimal disjoint <inline-formula><tex-math>$varepsilon$</tex-math></inline-formula>-decomposition. Next, the resultant decomposition is developed to fulfill the structural controllability and observability of the subsystems. Afterward, the recommended optimization problem undergoes modifications to account for structural perturbations. Finally, the performance and effectiveness of the decomposition approach are evaluated. The simulation results demonstrate that it successfully decomposes a complex system under structural perturbation into controllable and observable weakly coupled subsystems. Additionally, this method outperforms existing methods in terms of both methodology and specifications.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"3051-3064"},"PeriodicalIF":6.7,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492429","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}

引用次数: 0

Heartbeat: Effective Access to Off-Path Cached Content in NDN 心跳：在NDN中有效访问非路径缓存内容

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2025-03-28 DOI: 10.1109/TNSE.2025.3555743

Junseok Lee;Dohyung Kim

{"title":"Heartbeat: Effective Access to Off-Path Cached Content in NDN","authors":"Junseok Lee;Dohyung Kim","doi":"10.1109/TNSE.2025.3555743","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3555743","url":null,"abstract":"In Information-centric networking(ICN), content is distributed across network caches and accessed using content names instead of location identifiers. This characteristic effectively reduces network costs and latency, but the benefits vary greatly depending on how effectively user requests reach the target content in the cache. Existing literature suggests two approaches for accessing cached content: utilizing replicated requests and exchanging cache catalogs periodically. However, replicated requests can result in redundant data transfer, leading to bandwidth waste. The volatile nature of cached content can render the exchanged cache catalogs outdated, leading to access failure. Moreover, the cache catalog itself can consume a significant amount of bandwidth. To address these issues and implement efficient content access in ICN, we design a novel scheme called <italic>Heartbeat. <italic>Heartbeat disseminates information solely about newly inserted or relocated content with the lifetime carefully calculated, which enables sufficient utilization of cached content while preventing access failures caused by outdated information. We further minimize the overhead of <italic>Heartbeat significantly using several enhancement strategies. Simulation studies conducted on ndnSIM demonstrate that employing <italic>Heartbeat enables 45% more requests to be serviced from network caches, while reducing service latency and bandwidth consumption by up to 11% and 47% respectively, compared to comparative schemes.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"2974-2988"},"PeriodicalIF":6.7,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492414","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}

引用次数: 0

Adaptive Distributed Impulsive Synchronization Control for Multi-Agent Systems Under Switching Deception Attacks on Dual Channels 双信道切换欺骗攻击下多智能体系统的自适应分布脉冲同步控制

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2025-03-27 DOI: 10.1109/TNSE.2025.3554169

Jiangyan He;Xing Guo;Zili Chen;Jianlong Ren

{"title":"Adaptive Distributed Impulsive Synchronization Control for Multi-Agent Systems Under Switching Deception Attacks on Dual Channels","authors":"Jiangyan He;Xing Guo;Zili Chen;Jianlong Ren","doi":"10.1109/TNSE.2025.3554169","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3554169","url":null,"abstract":"The paper explores the mean-square bounded synchronization problem of leader-following multi-agent systems (LF-MASs) with the directed network under dual-channel stochastic switching deception attacks. Compared with previous studies, a new dual-channel deception attack mode is considered. In this new attack mode: 1) the deception attacks suffered by the sensor-controller channel are edge-based. 2) the sensor-controller channel and the controller-actuator channel are subjected to stochastic switching deception attacks by different deception signals at different impulse moments, and the stochastic switching manner on each channel obeys the Bernoulli distribution. To tackle this challenging problem, a novel adaptive and switching secure impulsive synchronization control protocol is proposed. In this new protocol, the agents receive false signals from their neighbors due to edge-based deception attacks on the sensor-controller channel. Further, some criteria have been obtained under the designed novel control protocol by applying linear matrix inequality technique, matrix analytic theory and Lyapunov stability theory. Finally, two examples are given to verify the obtained results.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"2797-2809"},"PeriodicalIF":6.7,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492250","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}

引用次数: 0

Event-Triggered Time Synchronization With Varying Skews for Wireless Sensor Networks Based on Average Consensus 基于平均一致性的无线传感器网络变偏差事件触发时间同步

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2025-03-27 DOI: 10.1109/TNSE.2025.3555260

Heng Wang;Xiong Zhu;Xiaojiang Liu;Yan Zou;Ting Tan;Min Li

{"title":"Event-Triggered Time Synchronization With Varying Skews for Wireless Sensor Networks Based on Average Consensus","authors":"Heng Wang;Xiong Zhu;Xiaojiang Liu;Yan Zou;Ting Tan;Min Li","doi":"10.1109/TNSE.2025.3555260","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3555260","url":null,"abstract":"Existing event-triggered consensus-based time synchronization algorithms are proposed under the ideal wireless sensor networks without communication delays and varying skews of clocks. Nevertheless, delays and varying skews have a serious impact on the accuracy and reliability of time synchronization. Considering a more practical and challenging scenario with the above uncertainties, we investigate the average-consensus-based time synchronization algorithm. Specifically, a new triggering policy based on the event-triggered node interactions mechanism is presented, giving a threshold to constrain communication overhead. Furthermore, a memory-efficient relative skew estimator is utilized to counteract the influence of communication delays, which reduces storage requirements while achieving highly accurate estimation. To guarantee convergence under time-varying clock skews, a proportional-integral consensus skew estimator is considered to make compensation for skews. In addition, the convergence analysis of the proposed algorithm is proved theoretically. Simulation results demonstrate the effectiveness of the proposed algorithm, meanwhile, our proposed algorithm outperforms other existing algorithms in terms of energy consumption.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"2895-2906"},"PeriodicalIF":6.7,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492256","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}

引用次数: 0

Distributed Bayesian Estimation in Sensor Networks: Consensus on Marginal Densities 传感器网络中的分布式贝叶斯估计：关于边际密度的共识

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2025-03-27 DOI: 10.1109/TNSE.2025.3554729

Parth Paritosh;Nikolay Atanasov;Sonia Martínez

引用次数: 0

Vulnerability of Information Transport on Temporal Networks to Link Removal 时序网络信息传输对链路移除的脆弱性研究

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2025-03-27 DOI: 10.1109/TNSE.2025.3555409

Li Zou;Huijuan Wang

{"title":"Vulnerability of Information Transport on Temporal Networks to Link Removal","authors":"Li Zou;Huijuan Wang","doi":"10.1109/TNSE.2025.3555409","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3555409","url":null,"abstract":"Communications networks such as vehicle and social contact networks are temporal networks, where autos/individuals are connected only when they are close to each other. These networks facilitate the propagation of information. Traffic between any two nodes demanded at any time is routed along the fastest time-respecting path. In this work, we investigate the vulnerability of information transport on temporal networks to link removal. The objective is to understand the removal of which types of links deteriorate the efficiency/speed of information transport the most. Identifying such critical links will enable better intervention to facilitate/prohibit the spread of (mis)information. To identify critical links, we propose link-removal strategies based on transport efficiency between two end nodes of each link, properties of links in the aggregated network, and in routing paths respectively. Each strategy ranks links according to their corresponding properties and removes links with the highest measures. Strategies are evaluated via the relative change in transport efficiency after link removal in real-world networks. We find that the path-based strategy performs the best: links appear more often and occur early in the fastest time-respecting paths tend to be critical. Via comprehensive analysis, we explain this strategy's out-performance and its dependency on network properties.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"2932-2941"},"PeriodicalIF":6.7,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492248","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}

引用次数: 0

Adaptive Denoising for Network Traffic Measurement 网络流量测量的自适应去噪

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2025-03-27 DOI: 10.1109/TNSE.2025.3555288

He Huang;Chen Lou;Yu-E Sun;Yang Du;Shigang Chen;Guoju Gao;Hongli Xu

{"title":"Adaptive Denoising for Network Traffic Measurement","authors":"He Huang;Chen Lou;Yu-E Sun;Yang Du;Shigang Chen;Guoju Gao;Hongli Xu","doi":"10.1109/TNSE.2025.3555288","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3555288","url":null,"abstract":"Traffic measurement in high-speed networks is crucial for applications like traffic engineering, network management, and surveillance. Restricted by the limitations of on-chip memory resources and the speed of packet processing, most existing solutions use compact data structures, namely sketches, to facilitate line-speed measurement. Nevertheless, these sketches, due to their shared record units (bits/counters) among flows, inevitably introduce noise into the measurement result of each flow. While conventional average denoising strategies can mitigate noise from raw estimates, they fall short of providing sufficient accuracy for medium-sized flows, primarily due to the uneven distribution of noise. To complement prior work, we propose two algorithms, ADN and mADN, which can perform denoising by considering the sizes of shared flows. ADN employs an optimization algorithm to model interconnections among flows, thereby reconstructing noise propagation and accurately restoring their sizes. Meanwhile, mADN retains the benefits of ADN yet excels in being more memory-efficient and precise. We apply our estimators to five essential tasks: per-flow size estimation, heavy hitter detection, heavy change detection, distribution estimation, and entropy estimation. Experimental results based on real Internet traffic traces show that our measurement solutions surpass existing state-of-the-art approaches, reducing the mean absolute error by approximately an order of magnitude under the same on-chip memory constraints.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"2907-2920"},"PeriodicalIF":6.7,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492214","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}

引用次数: 0