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

Short-Term Load Forecasting Based on Graph Convolution and Dendritic Deep Learning 基于图卷积和树突状深度学习的短期负荷预测

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2025-04-08 DOI: 10.1109/TNSE.2025.3558193

Chunyang Zhang;Yang Yu;Tengfei Zhang;Keyu Song;Yirui Wang;Shangce Gao

{"title":"Short-Term Load Forecasting Based on Graph Convolution and Dendritic Deep Learning","authors":"Chunyang Zhang;Yang Yu;Tengfei Zhang;Keyu Song;Yirui Wang;Shangce Gao","doi":"10.1109/TNSE.2025.3558193","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3558193","url":null,"abstract":"Short-term load forecasting (STLF) is a significant task to the planning, operation and control of future power systems. The increasing number of devices connected to the system has led to more complex characteristics and forms of load, which has brought considerable difficulties to the relevant methods in achieving higher load prediction accuracy and reliability. In this regard, this study proposes a deep learning model that combines graph convolutional network (GCN), gated recurrent unit (GRU), and dendritic neural model (DNM) to forecast electric load more accurately. Firstly, the sample load data is constructed into graph data with individual time steps as nodes. A GCN is used to extract the hidden features while allowing a full communication between the time steps feature data. A GRU is then used to capture the time-dependent relationship of the data. Finally, a dendritic layer instead of a fully connected layer is used as the output to integrate data features in depth. Experiments are conducted to verify the validity of the proposed model and compared it with several effective deep learning models, including CNN_LSTM, Transformer and Kolmogorov-Arnold Networks (KAN). The results show a significant improvement in prediction compared to the baseline models, with mean absolute percentage error(<inline-formula><tex-math>$MAPE$</tex-math></inline-formula>) of 1.62% and 3.98%, coefficient of determination(<inline-formula><tex-math>$R^{2}$</tex-math></inline-formula>) of 0.983 and 0.928 respectively on two load datasets at different levels of aggregation, nationally and regionally.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"3221-3233"},"PeriodicalIF":6.7,"publicationDate":"2025-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492427","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

Formation Control and Obstacle Avoidance Design for Networked USV Swarm With Exogenous Disturbance Under Intermittent Communication 间歇通信条件下外源干扰网络USV群的编队控制与避障设计

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2025-04-08 DOI: 10.1109/TNSE.2025.3558548

Zhenyu Chang;Guangdeng Zong;Wencheng Wang;Ming Yue;Xudong Zhao

{"title":"Formation Control and Obstacle Avoidance Design for Networked USV Swarm With Exogenous Disturbance Under Intermittent Communication","authors":"Zhenyu Chang;Guangdeng Zong;Wencheng Wang;Ming Yue;Xudong Zhao","doi":"10.1109/TNSE.2025.3558548","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3558548","url":null,"abstract":"This study addresses the formation control problem of under-actuated unmanned surface vehicle (USV) swarm systems and designs an obstacle avoidance strategy for navigating in obstacle environments. The intermittent communication scheme, consisting of the working period and the rest period, is introduced to reduce the communication burden and the consumption of control resources. A distributed formation control strategy is designed to guarantee the realization of the desired formation configuration. Considering the potential impact of obstacles in the operating environment, the artificial potential field repulsion obstacle avoidance method is embedded into the formation control strategy. To eliminate the impact of exogenous disturbances, a disturbance observer is established using the partially known disturbance information. Sufficient conditions are provided to ensure the uniformly ultimate boundedness of the formation error and disturbance observation error. In addition, an energy function related to the obstacle position information is designed to verify that the desired obstacle avoidance behavior can be achieved. The feasibility of theoretical analysis is validated by applying the developed control strategy to surface formation cruise missions.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"3234-3243"},"PeriodicalIF":6.7,"publicationDate":"2025-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492468","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

A Secure Transmission and Attack Detection Approach Based on Autoencoder 一种基于自编码器的安全传输与攻击检测方法

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2025-04-08 DOI: 10.1109/TNSE.2025.3558763

Zhen-Lei Ma;Xiao-Jian Li

{"title":"A Secure Transmission and Attack Detection Approach Based on Autoencoder","authors":"Zhen-Lei Ma;Xiao-Jian Li","doi":"10.1109/TNSE.2025.3558763","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3558763","url":null,"abstract":"This paper is concerned with the secure transmission and attack detection problem for cyber-physical systems with unknown dynamic matrices. The signals transmitted between physical and cyber layers can be eavesdropped and injected with the false data by adversary, which causes the information leakage and performance degradation. To tackle this problem, an integrated secure transmission and attack detection framework is proposed. The system information is first hidden as latent variables for secure transmission without information loss by using the designed stable image representation-aided autoencoder. Moreover, to further enhance the security of transmission, the chaotic oscillators are also embedded as a supplement. Then, an attack detector is designed based on the residual generated from the original data and the reconstructed data. Compared with the existing results, the proposed method shows better encoding ability and detection performance. Furthermore, the attack types are further analyzed and identified by using an explainable artificial intelligence technique. Finally, two examples are given to show the effectiveness of the proposed defense method.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"3259-3270"},"PeriodicalIF":6.7,"publicationDate":"2025-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492482","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

Age of Semantics in Cooperative Communications: To Expedite Simulation Towards Real via Offline Reinforcement Learning 协作通信中的语义时代：通过离线强化学习加速模拟走向现实

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2025-04-08 DOI: 10.1109/TNSE.2025.3558747

Xianfu Chen;Zhifeng Zhao;Shiwen Mao;Celimuge Wu;Honggang Zhang;Mehdi Bennis

{"title":"Age of Semantics in Cooperative Communications: To Expedite Simulation Towards Real via Offline Reinforcement Learning","authors":"Xianfu Chen;Zhifeng Zhao;Shiwen Mao;Celimuge Wu;Honggang Zhang;Mehdi Bennis","doi":"10.1109/TNSE.2025.3558747","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3558747","url":null,"abstract":"The age of information metric fails to correctly describe the intrinsic semantics of a status update. In an intelligent reflecting surface-aided cooperative relay communication system, we propose the age of semantics (AoS) for measuring the semantics freshness of status updates. Specifically, we focus on status updates from a source node (SN) to the destination, which is formulated as a Markov decision process. The objective of the SN is to maximize the expected satisfaction of AoS and energy consumption under the maximum transmit power constraint. To seek the optimal control policy, we first derive an online deep actor-critic (DAC) learning scheme under the on-policy temporal difference learning framework. However, implementing the online DAC in practice poses key challenge in infinitely repeated interactions between the SN and the system, which can be dangerous particularly during exploration. We then put forward a novel offline DAC scheme, which estimates the optimal control policy from a previously collected dataset without any further interactions with the system. Numerical experiments verify the theoretical results and show that our offline DAC scheme significantly outperforms the online DAC scheme and the most representative baselines in terms of mean utility, demonstrating strong robustness to dataset quality.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"3244-3258"},"PeriodicalIF":6.7,"publicationDate":"2025-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492252","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

Vulnerability and Resilience Assessments of Power Grid Based on Community Partition 基于社区划分的电网脆弱性与恢复力评估

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2025-04-04 DOI: 10.1109/TNSE.2025.3556836

Jianhua Zhang;Yixuan Zhang;Guifeng Wang;Fei Li;Jun Xie

{"title":"Vulnerability and Resilience Assessments of Power Grid Based on Community Partition","authors":"Jianhua Zhang;Yixuan Zhang;Guifeng Wang;Fei Li;Jun Xie","doi":"10.1109/TNSE.2025.3556836","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3556836","url":null,"abstract":"The power grid has become the most important infrastructure system and dominates the economic and social developments in modern society. However, the power network often suffers various failures which can cause huge damages to the power grid. Hence, this paper proposes a community detection method to explore the critical community and identify the critical node, so as to study the vulnerability and resilience of the power grid subjected to malicious attacks. Meanwhile, this paper presents a comprehensive model to quantify the resilience characteristics considering performance level and change speed, and the IEEE 118 network is adopted to verify the feasibility and effectiveness of the proposed schemes. The results show that the attack strategies considering the community structure can cause severe damages to the power grid compared with the traditional methods, and Community Gravity-based Recovery (CGBR) has the better recovery ability among the six recovery strategies. Moreover, the results also demonstrate that Community Priority and Gravity-based Recovery (CPGBR) and CGBR can generate the most complete communities, and they can cause the least resilience damages on the number of surviving nodes (<italic>SN) subjected to the attacks on nodes 49 and 69 respectively, and Gravity-based Recovery (GBR) can result in the least resilience damages on the power supplied (<italic>PS). Hence, we can discover that there is a tradeoff between decreasing resilience loss and increasing network performance by different choices of recovery strategies. Moreover, the results show that the proposed methods can precisely identify critical nodes and rapidly recover network characteristics, therefore this study has great significances for decreasing resilience loss of the power grid subjected to malicious attacks.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"3131-3144"},"PeriodicalIF":6.7,"publicationDate":"2025-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492472","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

Priority-Aware Task Scheduling in Computing Power Network-Enabled Edge Computing Systems 基于计算能力网络的边缘计算系统中的优先级感知任务调度

IF 6.7 2区计算机科学

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

Renchao Xie;Li Feng;Qinqin Tang;Han Zhu;Tao Huang;Ran Zhang;F. Richard Yu;Zehui Xiong

{"title":"Priority-Aware Task Scheduling in Computing Power Network-Enabled Edge Computing Systems","authors":"Renchao Xie;Li Feng;Qinqin Tang;Han Zhu;Tao Huang;Ran Zhang;F. Richard Yu;Zehui Xiong","doi":"10.1109/TNSE.2025.3557385","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3557385","url":null,"abstract":"The Internet of everything, a potential direction for the next-generation Internet, positions edge collaboration as a promising computing paradigm to address the workload dispersion and resource constraints inherent in traditional edge computing frameworks. However, the increasing complexity of cross-domain networks introduces challenges for efficient task execution and balanced resource utilization in edge collaboration, which remain insufficiently explored. To address these challenges, a next-generation network architecture, the compute power network (CPN), was recently proposed. The CPN leverages ubiquitous connections among heterogeneous resources to optimize task scheduling collaboratively. Building on this concept, we design an edge computing system that integrates CPN to enable dynamic and collaborative task scheduling. Inspired by the sliding window, we develop a dynamic scheduling scheme that prioritizes computing tasks and matches tasks to computing resources in real time. Additionally, we propose an improved deep reinforcement learning (DRL) algorithm to optimize scheduling policies, aiming to improve task success rates, minimize execution delays, and ensure balanced and efficient resource utilization. Lastly, simulation experiments validate the effectiveness of the proposed scheme and algorithm.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"3191-3205"},"PeriodicalIF":6.7,"publicationDate":"2025-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492421","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

An Analysis of Anonymous MQTT for Publish-Subscribe-Based IoT Networks 基于发布-订阅的物联网网络匿名MQTT分析

IF 6.7 2区计算机科学

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

Yudai Fukushima;Hotaru Tsunamoto;Kazuya Sakai;Min-Te Sun;Wei-Shinn Ku

{"title":"An Analysis of Anonymous MQTT for Publish-Subscribe-Based IoT Networks","authors":"Yudai Fukushima;Hotaru Tsunamoto;Kazuya Sakai;Min-Te Sun;Wei-Shinn Ku","doi":"10.1109/TNSE.2025.3557506","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3557506","url":null,"abstract":"Message queuing telemetry transport (MQTT) is widely used as a communication primitive in publish-subscribe-based IoT applications. However, the current MQTT standard does not support the privacy of IoT devices and users. Therefore, in this paper, we address the anonymous communications for MQTT-based IoT networks by tailored onion routing. To this end, we first introduce the concept of distributed IoT broker networks, in which a collection of IoT brokers are interconnected with each other. These brokers serve as onion routers. Then, we propose a generic anonymous messaging protocol (A-MQTT) for publish-subscribe-based IoT systems. Unlike typical anonymous communications, there are multiple destination IoT devices, called subscribers, in MQTT contexts. Hence, the privacy notions, such as traceable rate, device anonymity, and path anonymity, are redesigned. To illuminate the fundamental privacy issues, closed-form approximations for these privacy metrics are modeled. In addition, simulation results demonstrate that our A-MQTT significantly improves the security performance and that our proposed models closely approximate the various privacy performance. Furthermore, a proof-of-concept protocol is implemented on a Raspberry Pi 4 in order to show that the proposed A-MQTT can be deployed in an IoT environment.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"3206-3220"},"PeriodicalIF":6.7,"publicationDate":"2025-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492223","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

Intensity Based Event Detection in Sensor Based IoT 传感器物联网中基于强度的事件检测

IF 6.7 2区计算机科学

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

Anubhav Shivhare;Adarsh Prasad Behera;Manish Kumar

{"title":"Intensity Based Event Detection in Sensor Based IoT","authors":"Anubhav Shivhare;Adarsh Prasad Behera;Manish Kumar","doi":"10.1109/TNSE.2025.3556057","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3556057","url":null,"abstract":"Finding an optimum trade-off between event detection and network lifetime is a major problem in the sensor-based Internet of Things framework. Further, reliable, effective, and accurate event detection is a perennial research problem explored in the domain of Sensor Based Internet of Things (SBIoT). Major research problems focusing on event detection depend upon models like Boolean and probabilistic sensing models. However, event detection is practically dependent upon the intensity and persistence of the event. The traditional non-intensity-based event sensing models fix a predefined sensing radius. Any occurrence outside the sensing radius is not considered an event, independent of its severity. The present work argues that the intensity and persistence of the event are also relevant parameters for event detection. This paper proposes two novel event intensity and persistence-based models for detecting different types of events and improving upon the quality of detection. The proposed <italic>’Improved' model proves to be more efficient than the proposed <italic>’Conventional' model. Further, the simulation results indicate the proposed algorithm's efficiency and effectiveness, and compare it with <italic>Non-intensity based models. Additionally, the results are compared in terms of detection accuracy, node activation, and network lifetime to show the efficiency and trade-offs of the proposed scheme.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"3039-3050"},"PeriodicalIF":6.7,"publicationDate":"2025-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492474","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

An Adaptive AQM Based on the Consecutive Change Detection in the Programmable Queue 基于可编程队列连续变化检测的自适应AQM

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2025-04-02 DOI: 10.1109/TNSE.2025.3557164

Xinyue Jiang;Dezhang Kong;Xiang Chen;Shuangxi Chen;Haifeng Zhou;Chunming Wu;Xuan Liu;Wei Ruan

引用次数: 0

Mitigating Social Engineering Attacks Through Cost-Effective Security Awareness Training Policy 通过具有成本效益的安全意识培训策略减轻社会工程攻击

IF 6.7 2区计算机科学

IEEE Transactions on Network Science and Engineering Pub Date : 2025-04-02 DOI: 10.1109/TNSE.2025.3556927

Yang Qin;Xiaofan Yang;Lu-Xing Yang;Kaifan Huang

{"title":"Mitigating Social Engineering Attacks Through Cost-Effective Security Awareness Training Policy","authors":"Yang Qin;Xiaofan Yang;Lu-Xing Yang;Kaifan Huang","doi":"10.1109/TNSE.2025.3556927","DOIUrl":"https://doi.org/10.1109/TNSE.2025.3556927","url":null,"abstract":"Human beings are often considered the weakest link in cybersecurity. Social engineering attacks exploit this vulnerability, posing significant threats to the digital assets of organizations. A highly effective strategy to protect users from falling into traps set by attackers is to implement comprehensive security awareness training focused on social engineering. In this context, the organization needs to find a cost-effective policy of allocating the security awareness training cost. We refer to the problem of finding such a policy as the security awareness training (SAT) problem. This paper addresses the SAT problem. First, an opinion dynamics-based security awareness evolution model is introduced. On this basis, the SAT problem is reduced to an optimal control model (the SAT model). Second, by deriving the optimality system for the SAT problem, an algorithm of solving the SAT model is proposed. Next, the feasibility of the proposed algorithm is validated through numerical experiments. Additionally, further exploration of the SAT algorithm are conducted. Finally, for greater versatility, the problem is formulated as a discrete-time problem (the discrete SAT problem), and the discrete SAT algorithm is proposed to solve it. This work takes the first step toward the prevention of social engineering attack through optimal control approach.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"3145-3158"},"PeriodicalIF":6.7,"publicationDate":"2025-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144492338","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