IEEE Transactions on Sustainable Computing最新文献

2024 Reviewers List* 2024审稿人名单*

IF 3 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2025-02-05 DOI: 10.1109/TSUSC.2025.3526402

引用次数: 0

Guest Editorial of the Special Section on AI Powered Edge Computing for IoT 人工智能驱动的物联网边缘计算专题特约编辑

IF 3 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2024-12-11 DOI: 10.1109/TSUSC.2024.3415951

Zhongwen Guo;Hui Xia;Yu Wang;Radhouane Chouchane

引用次数: 0

Energy-Efficient Shop Scheduling Using Space-Cooperation Multi-Objective Optimization 基于空间协同多目标优化的节能车间调度

IF 3 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2024-12-11 DOI: 10.1109/TSUSC.2024.3506822

Jiepin Ding;Jun Xia;Yaning Yang;Junlong Zhou;Mingsong Chen;Keqin Li

{"title":"Energy-Efficient Shop Scheduling Using Space-Cooperation Multi-Objective Optimization","authors":"Jiepin Ding;Jun Xia;Yaning Yang;Junlong Zhou;Mingsong Chen;Keqin Li","doi":"10.1109/TSUSC.2024.3506822","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3506822","url":null,"abstract":"Since Industry 5.0 emphasizes that manufacturing enterprises should raise awareness of social contribution to achieve sustainable development, more and more meta-heuristic algorithms are investigated to save energy in manufacturing systems. Although non-dominated sorting-based meta-heuristics have been recognized as promising multi-objective optimization methods for solving the energy-efficient flexible job shop scheduling problem (EFJSP), it is hard to guarantee the quality of the Pareto front (e.g., total energy consumption, makespan) due to the lack of population diversity. This is mainly because an improper individual comparison inevitably reduces population diversity, thus limiting exploration and exploitation abilities during population updates. To achieve efficient population evolution, this paper introduces a novel space-cooperation multi-objective optimization (SCMO) method that can effectively solve EFJSP to obtain scheduling schemes with better trade-offs. By cooperatively evaluating the similarity among individuals in both the decision space and objective space, we propose a space-cooperation population update method based on a three-vector representation that can accurately eliminate repetitive individuals to derive higher-quality Pareto solutions. To further improve search efficiency, we propose a difference-driven local search, which selectively changes the positions of operations with higher differences to search for neighbors effectively. Based on the Taguchi method, we conduct experiments to obtain a suitable parameter combination of SCMO. Comprehensive experimental results show that, compared to state-of-the-art methods, our SCMO method achieves the highest HV and NR and the lowest IGD, with an average of 0.990, 0.952, and 0.001, respectively. Meanwhile, compared to traditional local search approaches, our difference-driven local search obtains twice the HV on instance Mk12 and reduces the solving time from 1521 s to 475 s.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"10 3","pages":"601-615"},"PeriodicalIF":3.0,"publicationDate":"2024-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144219630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Tensor and Minimum Connected Dominating Set Based Confident Information Coverage Reliability Evaluation for IoT 基于张量和最小连通支配集的物联网可信信息覆盖可靠性评估

IF 3 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2024-11-25 DOI: 10.1109/TSUSC.2024.3503712

Ziheng Xiao;Chenlu Zhu;Wei Feng;Shenghao Liu;Xianjun Deng;Hongwei Lu;Laurence T. Yang;Jong Hyuk Park

{"title":"Tensor and Minimum Connected Dominating Set Based Confident Information Coverage Reliability Evaluation for IoT","authors":"Ziheng Xiao;Chenlu Zhu;Wei Feng;Shenghao Liu;Xianjun Deng;Hongwei Lu;Laurence T. Yang;Jong Hyuk Park","doi":"10.1109/TSUSC.2024.3503712","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3503712","url":null,"abstract":"Internet of Things (IoT) reliability evaluation contributes to the sustainable computing and enhanced stability of the network. Previous algorithms usually evaluate the reliability of IoT by enumenating the states of nodes and networks, which are difficult to handle IoT with hundreds of nodes because the computational cost. In this paper, a novel algorithm, TMCRA, is proposed to evaluate the reliability of IoT in complex network environment, which consider both coverage and connectivity. For coverage, TMCRA employs the Confident Information Coverage (CIC) model to divide the target area into independent grids and calculates the coverage rate. In terms of connectivity, TMCRA forming the Virtual Backbone Network (VBN) based on two proposed methods: TMA and MGIN, and evaluate connectivity by analyzing the VBN rather than the whole network. The TMA and MGIN are two algorithms for constructing Minimum Connected Dominant Sets (MCDS), which are suitable for different scale networks. Finally, based on the data of coverage and connectivity, TMCRA utilizes tensors for the unified modeling and representation of network structure, and calculates IoT reliability based on the tensors. Simulations are carried out for various sizes of IoT to show the advantages and effectiveness of the proposed approach in reliability evaluation.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"10 3","pages":"547-561"},"PeriodicalIF":3.0,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144219804","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Understanding Container-Based Services Under Software Aging: Dependability and Performance Views 在软件老化下理解基于容器的服务：可靠性和性能视图

IF 3 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2024-11-25 DOI: 10.1109/TSUSC.2024.3506213

Jing Bai;Xiaolin Chang;Fumio Machida;Kishor S. Trivedi

引用次数: 0

Novel Approach of Vehicular Cooperative Communication Based on Strategy of Interval Type-2 Fuzzy Logic and Cooperative Game 基于区间2型模糊逻辑和合作博弈策略的车辆协同通信新方法

IF 3 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2024-11-21 DOI: 10.1109/TSUSC.2024.3503580

Jie Zhang;Zhihao Zhang;Degan Zhang;Chenhao Ni;Ting Zhang;Xingru Jiang

{"title":"Novel Approach of Vehicular Cooperative Communication Based on Strategy of Interval Type-2 Fuzzy Logic and Cooperative Game","authors":"Jie Zhang;Zhihao Zhang;Degan Zhang;Chenhao Ni;Ting Zhang;Xingru Jiang","doi":"10.1109/TSUSC.2024.3503580","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3503580","url":null,"abstract":"As an important branch of the Internet of Things (IoT), vehicular networks play a crucial role in the construction of intelligent transportation systems. However, due to the rapid movement of vehicles and signal obstruction, achieving high- quality and low-latency communication in vehicular networks remains a significant challenge. To address this issue, this paper proposes a novel data communication method based on interval type-2 fuzzy logic and cooperative game theory. Firstly, interval type-2 fuzzy logic is utilized to infer vehicle stability, thereby selecting high-quality backbone nodes. Concurrently, the memory and forgetfulness functions of the Gated Recurrent Unit are employed to retain critical data packets. Subsequently, a greedy algorithm and cooperative game theory model are used to describe the behavior of vehicles in Roadside-to-Vehicle (R2V) communication and Vehicle-to- Vehicle (V2V) communication, respectively. This approach encourages backbone nodes to cooperate and serve other vehicles based on a benefit function. Experimental results demonstrate that the proposed method excels in terms of transmission delay, coverage range, and data packet delivery success rate.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"10 3","pages":"588-600"},"PeriodicalIF":3.0,"publicationDate":"2024-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144219581","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Federated Learning in Mobile Networks: A Comprehensive Case Study on Traffic Forecasting 移动网络中的联邦学习：流量预测的综合案例研究

IF 3 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2024-11-21 DOI: 10.1109/TSUSC.2024.3504242

Nikolaos Pavlidis;Vasileios Perifanis;Selim F. Yilmaz;Francesc Wilhelmi;Marco Miozzo;Pavlos S. Efraimidis;Remous-Aris Koutsiamanis;Pavol Mulinka;Paolo Dini

{"title":"Federated Learning in Mobile Networks: A Comprehensive Case Study on Traffic Forecasting","authors":"Nikolaos Pavlidis;Vasileios Perifanis;Selim F. Yilmaz;Francesc Wilhelmi;Marco Miozzo;Pavlos S. Efraimidis;Remous-Aris Koutsiamanis;Pavol Mulinka;Paolo Dini","doi":"10.1109/TSUSC.2024.3504242","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3504242","url":null,"abstract":"The increasing demand for efficient resource allocation in mobile networks has catalyzed the exploration of innovative solutions that could enhance the task of real-time cellular traffic prediction. Under these circumstances, federated learning (FL) stands out as a distributed and privacy-preserving solution to foster collaboration among different sites, thus enabling responsive near-the-edge solutions. In this paper, we comprehensively study the potential benefits of FL in telecommunications through a case study on federated traffic forecasting using real-world data from base stations (BSs) in Barcelona (Spain). Our study encompasses relevant aspects within the federated experience, including model aggregation techniques, outlier management, the impact of individual clients, personalized learning, and the integration of exogenous sources of data. The performed evaluation is based on both prediction accuracy and sustainability, thus showcasing the environmental impact of employed FL algorithms in various settings. The findings from our study highlight FL as a promising and robust solution for mobile traffic prediction, emphasizing its twin merits as a privacy-conscious and environmentally sustainable approach, while also demonstrating its capability to overcome data heterogeneity and ensure high-quality predictions, marking a significant stride towards its integration in mobile traffic management systems.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"10 3","pages":"576-587"},"PeriodicalIF":3.0,"publicationDate":"2024-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144219807","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

ChestBox: Enabling Fast State Sharing for Stateful Serverless Computing With State Functions ChestBox：使用状态函数为有状态无服务器计算启用快速状态共享

IF 3 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2024-11-13 DOI: 10.1109/TSUSC.2024.3497326

Xinmin Zhang;Song Wu;Lin Gu;Qiang He;Hai Jin

{"title":"ChestBox: Enabling Fast State Sharing for Stateful Serverless Computing With State Functions","authors":"Xinmin Zhang;Song Wu;Lin Gu;Qiang He;Hai Jin","doi":"10.1109/TSUSC.2024.3497326","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3497326","url":null,"abstract":"This paper presents ChestBox, a novel approach that utilizes <italic>state functions</i> to facilitate low-latency state sharing for stateful serverless computing. When an <italic>application function</i> needs to share a state, the state function creates a memory space with Linux's shared memory object to store the state. Other application functions can then read the state directly from the shared memory. ChestBox enables fast state sharing that avoids excessive memory overhead without compromising on-demand resource allocation compared to existing solutions. This effectively reduces the energy consumption of serverless computing and promotes sustainable computing. The implementation of ChestBox on Apache OpenWhisk unearths two major implementation challenges, which we address with respective optimization techniques, i.e., state function channel and state swapping. The evaluation of ChestBox with four real-world applications shows that compared with the state-of-the-art approach, it can reduce state-sharing latency by up to 99.71%, while reducing execution costs by 24.59% and storage costs by 99.76%.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"10 3","pages":"491-502"},"PeriodicalIF":3.0,"publicationDate":"2024-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10752406","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144219803","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

EVADE: Targeted Adversarial False Data Injection Attacks for State Estimation in Smart Grid 面向智能电网状态估计的针对性对抗性假数据注入攻击

IF 3 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2024-11-06 DOI: 10.1109/TSUSC.2024.3492290

Jiwei Tian;Chao Shen;Buhong Wang;Chao Ren;Xiaofang Xia;Runze Dong;Tianhao Cheng

{"title":"EVADE: Targeted Adversarial False Data Injection Attacks for State Estimation in Smart Grid","authors":"Jiwei Tian;Chao Shen;Buhong Wang;Chao Ren;Xiaofang Xia;Runze Dong;Tianhao Cheng","doi":"10.1109/TSUSC.2024.3492290","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3492290","url":null,"abstract":"Although conventional false data injection attacks can circumvent the detection of bad data detection (BDD) in sustainable power grid cyber physical systems, they are easily detected by well-trained deep learning-based detectors. Still, state estimation models with deep leaning-based detectors are not secure due to the vulnerabilities and fragility of deep learning models. Using the related laws of conventional false data injection attacks and adversarial sample attacks, this paper proposes the targEted adVersarial fAlse Data injEction (EVADE) strategy to explore targeted adversarial false data injection attacks for state estimation in Smart Grid. The proposed EVADE attack strategy selects key state variables based on adversarial saliency maps to improve the attack efficiency and perturbs as few state variables as possible to reduce the attack cost. In this way, the EVADE attack strategy can bypass the detection of BDD and neural attack detection (NAD) methods (that is, maintaining deep stealthy) with a high success rate and achieve the attack target simultaneously. Experimental results demonstrate the effectiveness of the proposed strategy, posing serious and pressing concerns for sustainable cyber physical power system security.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"10 3","pages":"534-546"},"PeriodicalIF":3.0,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144219582","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

IoT Authentication Protocols: Classification, Trend and Opportunities 物联网认证协议：分类、趋势和机遇

IF 3 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2024-11-06 DOI: 10.1109/TSUSC.2024.3492152

Amar N. Alsheavi;Ammar Hawbani;Xingfu Wang;Wajdy Othman;Liang Zhao;Zhi Liu;Saeed Hamood Alsamhi;Mohammed A. A. Al-Qaness

引用次数: 0