{"title":"Distributed Energy Bank Optimization Towards Outage Aware Sustainable Cellular Networks","authors":"Ashutosh Balakrishnan;Swades De;Li-Chun Wang","doi":"10.1109/TSUSC.2024.3486976","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3486976","url":null,"abstract":"Grid connected and solar powered base stations (BSs) acting as distributed energy sources are increasingly becoming a popular solution to mobile operators. These networks experience double stochasticity due to the space-time variations in energy harvest and BS traffic. Hence, accurate and efficient green energy outage estimation in such networks is a challenging task. In this work, we propose a complutationally efficient cooperative energy transfer based distributed energy bank strategy to alleviate green energy outage and design energy sustainable networks. We first develop low-complexity Markovian frameworks to estimate green energy outage in a standalone BS without energy cooperation (WEC) and a multi-BS energy-cooperative (EC) setting, respectively. For the WEC system, we present a computationally efficient three-state discrete time Markovian statistical model, while the multi-BS EC framework is characterized by a two-state Markov model. The energy outage is studied as a function of capital expenditure (CAPEX), manifesting engineering insights from a service provider's perspective. Subsequently for the EC framework, we formulate a CAPEX optimization problem by jointly optimizing the BS cluster size and solar provisioning on individual BSs. Our results demonstrate that the proposed EC framework alleviates the green energy outage significantly, providing computational efficiency gains and CAPEX savings over the state-of-art approaches.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"10 3","pages":"503-514"},"PeriodicalIF":3.0,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144219757","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}
{"title":"Analysis of Transceiver RF Impairments on Artificial Noise Suppression in Frequency-Hopping Systems","authors":"Changqing Song;Hongzhi Zhao;Yong Yu;Zhuo Li;Shihai Shao","doi":"10.1109/TSUSC.2024.3475576","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3475576","url":null,"abstract":"The artificial noise shielded frequency-hopping (AN-FH) architecture can secure wireless communications against interference and eavesdropping. However, the AN suppression performance is highly sensitive to the radio frequency (RF) impairments, and the transceiver in-phase and quadrature (IQ) imbalances and phase noise in FH systems are more severe for the wide FH bandwidth. In this study, the AN-FH transceivers under RF impairments are mathematically modeled. Subsequently, distortions for transceiver phase noise are represented by the common phase error, distortions for transceiver IQ imbalances are represented by the mirror image component, and closed-form expressions for their respective power are derived and compared with the thermal noise power. Finally, the AN suppression capability is evaluated via the AN suppression ratio (ANSR), defined as the ratio of the AN-plus-noise power before and after suppression. It is found that when only phase noise exists, shortening the channel compensation cycle can enhance ANSR and reduce ANSR degradation; when the distortions’ power is smaller than the thermal noise power, it is also recommended to enhance the transmitting power and the power ratio of AN to information signals. When only IQ imbalances exist, increasing the power ratio of AN to information signals is suggested; when the distortions’ power is smaller than the thermal noise power, enhancing the transmitting power is also suggested.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"10 3","pages":"475-490"},"PeriodicalIF":3.0,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144219808","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}
{"title":"Tensor Factorization for Accurate Anomaly Detection in Dynamic Networks","authors":"Xiaocan Li;Jigang Wen;Kun Xie;Gaogang Xie;Wei Liang","doi":"10.1109/TSUSC.2024.3462814","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3462814","url":null,"abstract":"Accurately detecting traffic anomalies becomes increasingly crucial in network management. Algorithms that model the traffic data as a matrix suffers from low detection accuracy, while the work using the tensor model often assumes the tensor is regular without considering that network nodes may dynamically join in or leave, which will fail in a practical network with the change of node set as a result of mobility and churn behaviors. We propose a novel Tensor Recovery scheme in a Dynamic Network (TRDN) with traffic data modeled as a practical irregular tensor for accurate anomaly detection. To take advantage of correlations among small tensors, each formed with a short time duration to capture more hidden information in the data for higher detection accuracy, we propose several novel techniques: 1) a new joint tensor factorization model to capture the characteristic shared by the common nodes of small tensors, 2) a tensor partition algorithm to identify the data that can be applied to train the shared parameters efficiently, and 3) a bar-based algorithm that partitions nodes into the minimum number of no-overlapping subsets to form the shared tensor model. Extensive experiments on two Internet traffic data sets, Abilene and GÈANT, demonstrate the effectiveness of the proposed TRDN.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"10 3","pages":"439-450"},"PeriodicalIF":3.0,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144219780","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}
{"title":"Let Robots Watch Grass Grow: Optimal Task Assignment for Automatic Plant Factory","authors":"Zhengzhe Xiang;Xizi Xue;Yuanyi Chen;Schahram Dustdar;Minyi Guo","doi":"10.1109/TSUSC.2024.3462447","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3462447","url":null,"abstract":"Modularized plant factories, characterized by machines executing intelligent control requests to automatically take care of crops, have emerged as a sustainable agricultural paradigm, garnering the attention of Internet-of-Things and agricultural researchers for their production stability and energy efficiency. However, the diversity and pluralism of the plant factory components make it difficult to cooperate and produce crops with better qualities. Therefore, appropriate resource allocation and task scheduling strategies become the key points to optimize the quality of production in the factories by immediately telling which component is more suitable to do what in taking care of the crops. To address this challenge, this paper investigates how the machines of the factory can use their unique services and resource to help improve the crops’ quality and model the machine cooperation as an online decision-making problem. An <inline-formula><tex-math>$alpha$</tex-math></inline-formula>-competitive approach called <inline-formula><tex-math>$textsc {OnATS}$</tex-math></inline-formula> is designed based on the transformation of the original problem, and the experiments show that the proposed algorithm is superior to the baselines. Additionally, this paper explores the impact of different system configurations on the proposed method and shows that the proposed approach has broad applicability.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"10 3","pages":"464-474"},"PeriodicalIF":3.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144219809","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}
{"title":"A Deep Policy Dynamic Programming Based Intelligent Data Routing Scheme for IoT-Enabled Wireless Sensor Networks","authors":"Archana Ojha;Sahil Manikchand Chaudhari;Prasenjit Chanak","doi":"10.1109/TSUSC.2024.3462512","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3462512","url":null,"abstract":"Nowadays, the Internet of Things (IoT) plays a significant role in the development of various real-life applications such as smart cities, healthcare, precision agriculture, and industrial automation. Wireless Sensor Networks (WSNs) are a major ingredient of these IoT-based applications. In WSNs, sensor nodes that are close to the Base Station (BS) relay more data packets compared to other nodes, which creates high energy consumption at nodes close to the BS. As a result, an energy imbalance is created among the sensor nodes. Therefore, sensor nodes close to BS die early as compared to the faraway sensor nodes. These early dead nodes drastically increase data collection delay within the network. Furthermore, the early death of the sensor nodes partitions the network into different isolated sub-networks/segments. The formation of isolated segments causes premature death of the network. This paper proposes a Deep Policy Dynamic Programming (DPDP) based intelligent data routing scheme for IoT-enabled WSNs. The proposed scheme identifies an optimal number of Cluster Heads (CHs) and forms clusters to reduce the energy consumption of the deployed sensor nodes and prevent the early death of sensor nodes. Furthermore, the proposed scheme identifies an optimal number of Rendezvous Points (RPs) and designs an optimal path for Mobile Sink (MS) based data collection. Optimal RP selection and path design algorithms prevent the premature death of the network and significantly improve the overall performance of the network. Extensive simulations and test-bed experiments are conducted to test the performance of the proposed scheme. The simulation and test-bed results show that the proposed scheme outperforms as compared to the existing state-of-the-art approaches in terms of network lifetime, network stability, data loss due to buffer overflow, residual energy, and delay.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"10 3","pages":"451-463"},"PeriodicalIF":3.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144219805","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}
{"title":"Workload Pattern Learning-Based Cloud Resource Management Models: Concepts and Meta-Analysis","authors":"Deepika Saxena;Ashutosh Kumar Singh","doi":"10.1109/TSUSC.2024.3456429","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3456429","url":null,"abstract":"Workload pattern learning-based resource management is crucial for cloud computing environments for achieving higher performance, sustainability, fault-tolerance, and quality of service. The existing literature lacks a comprehensive discussion and meta-analysis of workload pattern learning centered cloud resource management. In this context, this paper presents a first comprehensive study about five pattern learning and analysis-driven techniques applied for achieving higher efficiency and performance during multi-constrained cloud resource management. The paper manifests utility and significance of workload pattern learning-based resource management as compared with traditional resource management. The five principle techniques are thoroughly discussed with coherent depiction of intended concept alongwith numerical illustration. The most prominent state-of-the-art models belonging to each technique are further distinguished based on distinct objectives conferring an extensive survey and comparison. Besides, conceptual and theoretical analysis, the leading models underlying the major resource management techniques are implemented on a common platform and thoroughly examined using real-world Google Cluster workload traces. Based on the all-inclusive study and performance evaluation, trade-off discussion among these techniques are capsuled to put forward imperative concluding remarks with concrete open issues and insightful future research directions.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"10 3","pages":"418-438"},"PeriodicalIF":3.0,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144219810","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}
{"title":"Conditional Data-Sharing Privacy-Preserving Scheme in Blockchain-Based Social Internet of Vehicles","authors":"Zhuoqun Xia;Jiahuan Man;Ke Gu;Xiong Li;Longfei Huang","doi":"10.1109/TSUSC.2024.3452228","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3452228","url":null,"abstract":"Social Internet of Vehicles (SIoVs) is an important information exchange platform to provide comprehensive traffic services by sharing vehicle-aware data. However, traditional data sharing methods can not provide the security of decentralized data sharing, making it possible for some malicious third parties to initiate dishonest behaviors. Additionally, the lack of access control for data sharing in SIoVs easily leads to unauthorized data sharing, thus user privacy is threatened and the source of false data is difficult to be traced. In this paper, we propose a conditional data-sharing privacy-preserving scheme for blockchain-based social internet of vehicles. In our scheme, a lightweight ledger-based blockchain system is designed, which combines with the ciphertext-policy attribute-based encryption method to realize anonymous one-to-many sharing of data with fine-grained access management. Also, a collaborative identity tracing method is constructed to trace malicious users who provide false data. Our scheme can effectively prevent second-hand data sharing and safeguard user privacy. Moreover, related experimental results validate the efficiency of our scheme.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"10 2","pages":"378-395"},"PeriodicalIF":3.0,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143769400","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}
Pietro Rando Mazzarino;Martina Capone;Elisa Guelpa;Lorenzo Bottaccioli;Vittorio Verda;Edoardo Patti
{"title":"A Modular Co-Simulation Platform for Comparing Flexibility Solutions in District Heating Under Variable Operating Conditions","authors":"Pietro Rando Mazzarino;Martina Capone;Elisa Guelpa;Lorenzo Bottaccioli;Vittorio Verda;Edoardo Patti","doi":"10.1109/TSUSC.2024.3449977","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3449977","url":null,"abstract":"Integrated modeling and simulation are crucial for optimizing cities’ energy planning. Existing sector-specific analyses have implementation limitations in representing interactions across infrastructures, limiting optimization potentials. An integrated framework simulating multiple interacting components from a systemic perspective could reveal efficiency gains, flexibility, and synergies across urban energy networks to guide sustainable energy transitions. Co-simulation approaches are gaining attention for analyzing complex interconnected systems like District Heating (DH). Traditional single-discipline models present limitations in fully representing the interconnectivity between district heating networks and related subsystems, such as those in buildings and energy generation. Therefore, we propose a co-simulation based framework to simulate DH system behavior while easily integrating models of other subsystems and Functional Mock-up Unit (FMU) simulators. We tested this Plug&Play modular framework for Demand Side Management (DSM) and Storage-based strategies, evaluating their effectiveness in peak reduction while lowering the temperatures of the network.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"10 2","pages":"408-417"},"PeriodicalIF":3.0,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10648783","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143769401","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}
{"title":"Dynamic State Estimation for Multi-Machine Power Grids Under Randomly Occurring Cyber-Attacks: A Decentralized Framework","authors":"Bogang Qu;Zidong Wang;Bo Shen;Daogang Peng;Dong Yue","doi":"10.1109/TSUSC.2024.3448225","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3448225","url":null,"abstract":"Dynamic state estimation (DSE) plays a vitally important role in modern power systems, and the reliance on the communication network often render the systems to cyber-threats. This paper investigates the secure DSE problem for the multi-generator power grids in the presence of randomly occurring cyber-attacks. To facilitate the decentralized DSE, the synchronous generator is decoupled form the large-scale interconnected power grid with the aid of model decoupling method. A hybrid cyber-attack model, which includes three typical and representative attacks (i.e., denial-of-service attacks, bias injection attacks and replay attacks), is designed and launched in a random way. Attention is devoted to the secure algorithm design problem to light the negative impacts on the DSE performance from the nonlinearity/non-Gaussianity and the random occurrences of the cyber-attacks. Specifically, i) a likelihood function modification method is established where the knowledge of the hybrid-attack model is fully considered; and ii) the associated weights of the particles are updated according to the proposed likelihood function to resist the impacts caused by the randomly occurring cyber-attacks. Finally, simulation experiments with four scenarios are implemented on the IEEE 39-bus system and the corresponding analyses show the validity of the decentralized secure DSE scheme.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"10 2","pages":"396-407"},"PeriodicalIF":3.0,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143769495","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}
{"title":"Improved AFSA-Based Energy-Aware Content Caching Strategy for UAV-Assisted VEC","authors":"Kejun Long;Chunlin Li;Kun Jiang;Shaohua Wan","doi":"10.1109/TSUSC.2024.3444949","DOIUrl":"https://doi.org/10.1109/TSUSC.2024.3444949","url":null,"abstract":"UAV-assisted VEC can provide content caching services for vehicles by flying close to the vehicles for vehicle's QoS. However, in real-world scenarios with traffic congestion, due to the battery capacity and cache space limitations of UAVs, low content response speed and high response latency may occur. Based on this, we proposed a dynamic energy consumption-based content caching strategy in UAV-assisted VEC. We use the PSO algorithm to solve the problem and obtain the optimal UAV deployment location. For content caching, we construct a content caching model by considering UAV deployment, vehicle user preference, UAV cache capacity, and UAV energy consumption with the goal of minimizing content request latency. In addition, we propose an IAFSA-based content caching strategy. We reduce the solution space of the fish swarm algorithm, decrease the number of caching decisions, and improve the convergence performance of AFSA by employing dynamic horizons and step sizes. Experimental results show that the proposed IAFSA effectively reduces the average content request latency of the vehicle, improves the cache hit rate, and reduces the number of content return trips. Particularly, the proposed strategy reduces the average content request latency by more than 9.84% compared to the baseline algorithm.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"10 2","pages":"366-377"},"PeriodicalIF":3.0,"publicationDate":"2024-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143769497","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}