IEEE Transactions on Sustainable Computing最新文献_第3页

CloudProphet: A Machine Learning-Based Performance Prediction for Public Clouds 云预言家（CloudProphet）：基于机器学习的公有云性能预测

IF 3 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2024-01-29 DOI: 10.1109/TSUSC.2024.3359325

Darong Huang;Luis Costero;Ali Pahlevan;Marina Zapater;David Atienza

{"title":"CloudProphet: A Machine Learning-Based Performance Prediction for Public Clouds","authors":"Darong Huang;Luis Costero;Ali Pahlevan;Marina Zapater;David Atienza","doi":"10.1109/TSUSC.2024.3359325","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3359325","url":null,"abstract":"Computing servers have played a key role in developing and processing emerging compute-intensive applications in recent years. Consolidating multiple virtual machines (VMs) inside one server to run various applications introduces severe competence for limited resources among VMs. Many techniques such as VM scheduling and resource provisioning are proposed to maximize the cost-efficiency of the computing servers while alleviating the performance inference between VMs. However, these management techniques require accurate performance prediction of the application running inside the VM, which is challenging to get in the public cloud due to the black-box nature of the VMs. From this perspective, this paper proposes a novel machine learning-based performance prediction approach for applications running in the cloud. To achieve high-accuracy predictions for black-box VMs, the proposed method first identifies the running application inside the virtual machine. It then selects highly correlated runtime metrics as the input of the machine learning approach to accurately predict the performance level of the cloud application. Experimental results with state-of-the-art cloud benchmarks demonstrate that our proposed method outperforms existing prediction methods by more than 2× in terms of the worst prediction error. In addition, we successfully tackle the challenge of performance prediction for applications with variable workloads by introducing the performance degradation index, which other comparison methods fail to consider. The workflow versatility of the proposed approach has been verified with different modern servers and VM configurations.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 4","pages":"661-676"},"PeriodicalIF":3.0,"publicationDate":"2024-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141965766","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

A Novel Resource Management Framework for Blockchain-Based Federated Learning in IoT Networks 物联网网络中基于区块链的联盟学习的新型资源管理框架

IF 3 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2024-01-26 DOI: 10.1109/TSUSC.2024.3358915

Aman Mishra;Yash Garg;Om Jee Pandey;Mahendra K. Shukla;Athanasios V. Vasilakos;Rajesh M. Hegde

{"title":"A Novel Resource Management Framework for Blockchain-Based Federated Learning in IoT Networks","authors":"Aman Mishra;Yash Garg;Om Jee Pandey;Mahendra K. Shukla;Athanasios V. Vasilakos;Rajesh M. Hegde","doi":"10.1109/TSUSC.2024.3358915","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3358915","url":null,"abstract":"At present, the centralized learning models, used for IoT applications generating large amount of data, face several challenges such as bandwidth scarcity, more energy consumption, increased uses of computing resources, poor connectivity, high computational complexity, reduced privacy, and large latency towards data transfer. In order to address the aforementioned challenges, Blockchain-Enabled Federated Learning Networks (BFLNs) emerged recently, which deal with trained model parameters only, rather than raw data. BFLNs provide enhanced security along with improved energy-efficiency and Quality-of-Service (QoS). However, BFLNs suffer with the challenges of exponential increased action space in deciding various parameter levels towards training and block generation. Motivated by aforementioned challenges of BFLNs, in this work, we are proposing an actor-critic Reinforcement Learning (RL) method to model the Machine Learning Model Owner (MLMO) in selecting the optimal set of parameter levels, addressing the challenges of exponential grow of action space in BFLNs. Further, due to the implicit entropy exploration, actor-critic RL method balances the exploration-exploitation trade-off and shows better performance than most off-policy methods, on large discrete action spaces. Therefore, in this work, considering the mobile scenario of the devices, MLMO decides the data and energy levels that the mobile devices use for the training and determine the block generation rate. This leads to minimized system latency and reduced overall cost, while achieving the target accuracy. Specifically, we have used Proximal Policy Optimization (PPO) as an on-policy actor-critic method with it's two variants, one based on Monte Carlo (MC) returns and another based on Generalized Advantage Estimate (GAE). We analyzed that PPO has better exploration and sample efficiency, lesser training time, and consistently higher cumulative rewards, when compared to off-policy Deep Q-Network (DQN).","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 4","pages":"648-660"},"PeriodicalIF":3.0,"publicationDate":"2024-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141965830","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

A Prototype-Empowered Kernel-Varying Convolutional Model for Imbalanced Sea State Estimation in IoT-Enabled Autonomous Ship

IF 3 3区计算机科学

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

Mengna Liu;Xu Cheng;Fan Shi;Xiufeng Liu;Hongning Dai;Shengyong Chen

{"title":"A Prototype-Empowered Kernel-Varying Convolutional Model for Imbalanced Sea State Estimation in IoT-Enabled Autonomous Ship","authors":"Mengna Liu;Xu Cheng;Fan Shi;Xiufeng Liu;Hongning Dai;Shengyong Chen","doi":"10.1109/TSUSC.2024.3353183","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3353183","url":null,"abstract":"Sea State Estimation (SSE) is essential for Internet of Things (IoT)-enabled autonomous ships, which rely on favorable sea conditions for safe and efficient navigation. Traditional methods, such as wave buoys and radars, are costly, less accurate, and lack real-time capability. Model-driven methods, based on physical models of ship dynamics, are impractical due to wave randomness. Data-driven methods are limited by the data imbalance problem, as some sea states are more frequent and observable than others. To overcome these challenges, we propose a novel data-driven approach for SSE based on ship motion data. Our approach consists of three main components: a data preprocessing module, a parallel convolution feature extractor, and a theoretical-ensured distance-based classifier. The data preprocessing module aims to enhance the data quality and reduce sensor noise. The parallel convolution feature extractor uses a kernel-varying convolutional structure to capture distinctive features. The distance-based classifier learns representative prototypes for each sea state and assigns a sample to the nearest prototype based on a distance metric. The efficiency of our model is validated through experiments on two SSE datasets and the UEA archive, encompassing thirty multivariate time series classification tasks. The results reveal the generalizability and robustness of our approach.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 6","pages":"862-873"},"PeriodicalIF":3.0,"publicationDate":"2024-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810501","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

Advancements in Accelerating Deep Neural Network Inference on AIoT Devices: A Survey

IF 3 3区计算机科学

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

Long Cheng;Yan Gu;Qingzhi Liu;Lei Yang;Cheng Liu;Ying Wang

{"title":"Advancements in Accelerating Deep Neural Network Inference on AIoT Devices: A Survey","authors":"Long Cheng;Yan Gu;Qingzhi Liu;Lei Yang;Cheng Liu;Ying Wang","doi":"10.1109/TSUSC.2024.3353176","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3353176","url":null,"abstract":"The amalgamation of artificial intelligence with Internet of Things (AIoT) devices have seen a rapid surge in growth, largely due to the effective implementation of deep neural network (DNN) models across various domains. However, the deployment of DNNs on such devices comes with its own set of challenges, primarily related to computational capacity, storage, and energy efficiency. This survey offers an exhaustive review of techniques designed to accelerate DNN inference on AIoT devices, addressing these challenges head-on. We delve into critical model compression techniques designed to adapt to the limitations of devices and hardware optimization strategies that aim to boost efficiency. Furthermore, we examine parallelization methods that leverage parallel computing for swift inference, as well as novel optimization strategies that fine-tune the execution process. This survey also casts a future-forward glance at emerging trends, including advancements in mobile hardware, the co-design of software and hardware, privacy and security considerations, and DNN inference on AIoT devices with constrained resources. All in all, this survey aspires to serve as a holistic guide to advancements in the acceleration of DNN inference on AIoT devices, aiming to provide sustainable computing for upcoming IoT applications driven by artificial intelligence.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 6","pages":"830-847"},"PeriodicalIF":3.0,"publicationDate":"2024-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142810543","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

Towards Energy-Efficient and Thermal-Aware Data Placement for Storage Clusters 为存储集群实现高能效和热感知数据布局

IF 3 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2024-01-09 DOI: 10.1109/TSUSC.2024.3351684

Jie Li;Yuhui Deng;Zhifeng Fan;Zijie Zhong;Geyong Min

{"title":"Towards Energy-Efficient and Thermal-Aware Data Placement for Storage Clusters","authors":"Jie Li;Yuhui Deng;Zhifeng Fan;Zijie Zhong;Geyong Min","doi":"10.1109/TSUSC.2024.3351684","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3351684","url":null,"abstract":"The explosion of large-scale data has increased the scale and capacity of storage clusters in data centers, leading to huge power consumption issues. Cloud providers can effectively promote the energy efficiency of data centers by employing energy-aware data placement techniques, which primarily encompass storage cluster's power and cooling power. Traditional data placement approaches do not diminish the overall power consumption of the data center due to the heat recirculation effect between storage nodes. To fill this gap, we build an elaborate thermal-aware data center model. Then we propose two energy-efficient thermal-aware data placement strategies, ETDP-I and ETDP-II, to reduce the overall power consumption of the data center. The principle of our proposed algorithm is to utilize a greedy algorithm to calculate the optimal disk sequence at the minimum total power of the data center and then place the data into the optimal disk sequence. We implement these two strategies in a cloud computing simulation platform based on CloudSim. Experimental results unveil that ETDA-I and ETDP-II outperform MinTin-G and MinTout-G in terms of the supplied temperature of CRAC, storage nodes power, cooling cost, and total power consumption of the data center. In particular, ETDP-I and ETDP-II algorithms can save about 9.46\u0000<inline-formula><tex-math>$%$</tex-math></inline-formula>\u0000-38.93\u0000<inline-formula><tex-math>$%$</tex-math></inline-formula>\u0000 of the overall power consumption compared to MinTout-G and MinTin-G algorithms.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 4","pages":"631-647"},"PeriodicalIF":3.0,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141965832","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

Efficient Inference of Graph Neural Networks Using Local Sensitive Hash 使用局部敏感哈希对图神经网络进行高效推理

IF 3.9 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2024-01-09 DOI: 10.1109/TSUSC.2024.3351282

Tao Liu;Peng Li;Zhou Su;Mianxiong Dong

{"title":"Efficient Inference of Graph Neural Networks Using Local Sensitive Hash","authors":"Tao Liu;Peng Li;Zhou Su;Mianxiong Dong","doi":"10.1109/TSUSC.2024.3351282","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3351282","url":null,"abstract":"Graph neural networks (GNNs) have attracted significant research attention because of their impressive capability in dealing with graph-structure data, such as energy networks, that are crucial for sustainable computing. We find that the communication of data loading from main memory to GPUs is the main bottleneck of GNN inference because of redundant data loading. In this paper, we propose RAIN, an efficient GNN inference system for graph learning. There are two key designs. First, we explore the opportunity of conducting similar inference batches sequentially and reusing repeated nodes among adjacent batches to reduce redundant data loading. This method requires reordering the batches based on their similarity. However, comparing the similarity across a large number of inference batches is a difficult task with a high computational cost. Thus, we propose a local sensitive hash (LSH)-based clustering scheme to group similar batches together quickly without pair-wise comparison. Second, RAIN contains an efficient adaptive sampling strategy, allowing users to sample target nodes’ neighbors according to their degree. The number of sampled neighbors is proportional to the size of the node's degree. We conduct extensive experiments with various baselines. RAIN can achieve up to 6.8X acceleration, and the accuracy decrease is smaller than 0.1%.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 3","pages":"548-558"},"PeriodicalIF":3.9,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141264414","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

Oracle Based Privacy-Preserving Cross-Domain Authentication Scheme 基于 Oracle 的隐私保护跨域身份验证方案

IF 3 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2024-01-05 DOI: 10.1109/TSUSC.2024.3350343

Yuan Su;Yuheng Wang;Jiliang Li;Zhou Su;Witold Pedrycz;Qinnan Hu

{"title":"Oracle Based Privacy-Preserving Cross-Domain Authentication Scheme","authors":"Yuan Su;Yuheng Wang;Jiliang Li;Zhou Su;Witold Pedrycz;Qinnan Hu","doi":"10.1109/TSUSC.2024.3350343","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3350343","url":null,"abstract":"The Public Key Infrastructure (PKI) system is the cornerstone of today’s security communications. All users in the service domain covered by the same PKI system are able to authenticate each other before exchanging messages. However, there is identity isolation in different domains, making the identity of users in different domains cannot be recognized by PKI systems in other domains. To achieve cross-domain authentication, the consortium blockchain system is leveraged in the existing schemes. Unfortunately, the consortium blockchain-based authentication schemes have the following challenges: high cost, privacy concerns, scalability and economic unsustainability. To solve these challenges, we propose a scalable and privacy-preserving cross-domain authentication scheme called Bifrost-Auth. Firstly, Bifrost-Auth is designed to use a decentralized oracle to directly interact with blockchains in different domains instead of maintaining a consortium blockchain and enables mutual authentication for users lying in different domains. Secondly, users can succinctly authenticate their membership of the domain by the accumulator technique, where the membership proof is turned into zero knowledge to protect users’ privacy. Finally, Bifrost-Auth is proven to be secure against various attacks, and thorough experiments are carried out and demonstrate the security and efficiency of Bifrost-Auth.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 4","pages":"602-614"},"PeriodicalIF":3.0,"publicationDate":"2024-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141965768","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

PTCC: A Privacy-Preserving and Trajectory Clustering-Based Approach for Cooperative Caching Optimization in Vehicular Networks PTCC：基于隐私保护和轨迹聚类的车载网络合作缓存优化方法

IF 3 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2024-01-05 DOI: 10.1109/TSUSC.2024.3350386

Tengfei Cao;Zizhen Zhang;Xiaoying Wang;Han Xiao;Changqiao Xu

{"title":"PTCC: A Privacy-Preserving and Trajectory Clustering-Based Approach for Cooperative Caching Optimization in Vehicular Networks","authors":"Tengfei Cao;Zizhen Zhang;Xiaoying Wang;Han Xiao;Changqiao Xu","doi":"10.1109/TSUSC.2024.3350386","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3350386","url":null,"abstract":"5G vehicular networks provide abundant multimedia services among mobile vehicles. However, due to the mobility of vehicles, large-scale mobile traffic poses a challenge to the core network load and transmission latency. It is difficult for existing solutions to guarantee the quality of service (QoS) of vehicular networks. Besides, the sensitivity of vehicle trajectories also brings privacy concerns in vehicular networks. To address these problems, we propose a privacy-preserving and trajectory clustering-based framework for cooperative caching optimization (PTCC) in vehicular networks, which includes two tasks. Specifically, in the first task, we first apply differential privacy technologies to add noise to vehicle trajectories. In addition, a data aggregation model is provided to make the trade-off between aggregation accuracy and privacy protection. In order to analyze similar behavioral vehicles, trajectory clustering is then achieved by utilizing machine learning algorithms. In the second task, we construct a cooperative caching objective function with the transmission latency. Afterwards, the multi-agent deep Q network (MADQN) is leveraged to obtain the goal of caching optimization, which can achieve low delay. Finally, extensive simulation results verify that our framework respectively improves the QoS up to 9.8% and 12.8% with different file numbers and caching capacities, compared with other state-of-the-art solutions.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 4","pages":"615-630"},"PeriodicalIF":3.0,"publicationDate":"2024-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141965831","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

Heterogeneous Ensemble Federated Learning With GAN-Based Privacy Preservation 基于 GAN 隐私保护的异构集合联盟学习

IF 3 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2024-01-05 DOI: 10.1109/TSUSC.2024.3350040

Meng Chen;Hengzhu Liu;Huanhuan Chi;Ping Xiong

{"title":"Heterogeneous Ensemble Federated Learning With GAN-Based Privacy Preservation","authors":"Meng Chen;Hengzhu Liu;Huanhuan Chi;Ping Xiong","doi":"10.1109/TSUSC.2024.3350040","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3350040","url":null,"abstract":"Multi-party collaborative learning has become a paradigm for large-scale knowledge discovery in the era of Big Data. As a typical form of collaborative learning, federated learning (FL) has received widespread research attention in recent years. In practice, however, FL faces a range of challenges such as objective inconsistency, communication and synchronization issues, due to the heterogeneity in the clients’ local datasets and devices. In this paper, we propose EnsembleFed, a novel ensemble framework for heterogeneous FL. The proposed framework first allows each client to train a local model with full autonomy and without having to consider the heterogeneity of local datasets. The confidence scores of training samples output by each local model are then perturbed to defend against membership inference attacks, after which they are submitted to the server for use in constructing the global model. We apply a GAN-based method to generate calibrated noise for confidence perturbation. Benefiting from the ensemble framework, EnsembleFed disengages from the restriction of real-time synchronization and achieves collaborative learning with lower communication costs than traditional FL. Experiments on real-world datasets demonstrate that the proposed EnsembleFed can significantly improve the performance of the global model while also effectively defending against membership inference attacks.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 4","pages":"591-601"},"PeriodicalIF":3.0,"publicationDate":"2024-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141965767","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

Apict:Air Pollution Epidemiology Using Green AQI Prediction During Winter Seasons in India Apict：利用绿色空气质量指数预测印度冬季空气污染流行病学

IF 3.9 3区计算机科学

IEEE Transactions on Sustainable Computing Pub Date : 2024-01-01 DOI: 10.1109/TSUSC.2023.3343922

Sweta Dey;Kalyan Chatterjee;Ramagiri Praveen Kumar;Anjan Bandyopadhyay;Sujata Swain;Neeraj Kumar

{"title":"Apict:Air Pollution Epidemiology Using Green AQI Prediction During Winter Seasons in India","authors":"Sweta Dey;Kalyan Chatterjee;Ramagiri Praveen Kumar;Anjan Bandyopadhyay;Sujata Swain;Neeraj Kumar","doi":"10.1109/TSUSC.2023.3343922","DOIUrl":"https://doi.org/10.1109/TSUSC.2023.3343922","url":null,"abstract":"During the winter season in India, the AQI experiences a decrease due to the limited dispersion of APs caused by MFs. Therefore, we developed a sophisticated green predictive model GAP, which utilizes our designed green technique and a customized big dataset. This dataset is derived from weather research and tailored to forecast future AQI levels in the Indian subcontinent during winter. This dataset has been meticulously curated by amalgamating samples of APs and MFs concentrations, further adjusted to reflect the yearly activity data across various Indian states. The dataset reveals an amplified national emissions rate for \u0000<inline-formula><tex-math>$boldsymbol {PM_{2.5}}$</tex-math></inline-formula>\u0000, \u0000<inline-formula><tex-math>$boldsymbol {NO_{2}}$</tex-math></inline-formula>\u0000, and \u0000<inline-formula><tex-math>$boldsymbol {CO}$</tex-math></inline-formula>\u0000 pollutants, exhibiting an increase of 3.6%, 1.3%, and 2.5% in gigagrams per day. ML/DL regressors are then applied to this dataset, with the most effective ML/DL regressors being selected based on their performance. Our paper encompasses an exhaustive examination of existing literature within the realm of air pollution epidemiology. The evaluation results demonstrate that the prediction accuracy of GAP when utilizing LSTM, CNN, MLP, and RNN achieve accuracies of 98.53%, 95.9222%, 96.1555%, and 97.344% in predicting the \u0000<inline-formula><tex-math>$boldsymbol {PM_{2.5}}$</tex-math></inline-formula>\u0000, \u0000<inline-formula><tex-math>$boldsymbol {NO_{2}}$</tex-math></inline-formula>\u0000, and \u0000<inline-formula><tex-math>$boldsymbol {CO}$</tex-math></inline-formula>\u0000 concentrations. In contrast, RF, KNN, and SVR yield lower accuracies of 92.511%, 90.333%, and 93.566% for the same AQIs.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"9 3","pages":"559-570"},"PeriodicalIF":3.9,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141264521","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