Computers & Electrical Engineering最新文献_第3页

A reliability framework for NB-IoT devices: Addressing transient faults and silent data corruptions

IF 4 3区计算机科学

Computers & Electrical Engineering Pub Date : 2025-05-01 DOI: 10.1016/j.compeleceng.2025.110405

Fatemeh Khojasteh Dana, Seyedeh Fatemeh Anvari, Hamid R. Zarandi

{"title":"A reliability framework for NB-IoT devices: Addressing transient faults and silent data corruptions","authors":"Fatemeh Khojasteh Dana, Seyedeh Fatemeh Anvari, Hamid R. Zarandi","doi":"10.1016/j.compeleceng.2025.110405","DOIUrl":"10.1016/j.compeleceng.2025.110405","url":null,"abstract":"<div><div>This paper analyzes the effects of transient faults implemented by power supply disturbance (PSD) fault injection method on a narrowband internet of things (NB-IoT) technology. NB-IoT is a widely used technology for wide-area applications that is providing real-time information to system operators. However, either intentional or unintentional transient faults can potentially result in inappropriate control actions, jeopardizing the security, resilience, and reliability of NB-IoT network. PSD fault injection method drops power supply voltage of NB-IoT transmitter chip for different durations and voltage levels. To connect circuit of fault injection to NB-IoT network, a host computer is programmed as a fault injection manager. In this configuration, sending packets is done through one of NB-IoT chips, and receiving them is done on server side. The results of empirical fault injections showed that the fault tolerance of NB-IoT technology needs crucial improvement. To address this issue, an active retransmission technique (ART) method is proposed. ART involves leveraging time redundancy and retransmission of particular number of packets depending on the acceptable level of reliability and performance overhead. This approach has contributed to enhancing the resilience of NB-IoT.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"124 ","pages":"Article 110405"},"PeriodicalIF":4.0,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143943281","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

Distributed multiple unmanned surface vehicles path planning integrated control framework in complex scenarios 复杂场景下分布式多无人水面车辆路径规划集成控制框架

IF 4 3区计算机科学

Computers & Electrical Engineering Pub Date : 2025-05-01 DOI: 10.1016/j.compeleceng.2025.110430

Dong Xiao , Zhihang Song , Mingyuan Zhai , Nan Jiang

{"title":"Distributed multiple unmanned surface vehicles path planning integrated control framework in complex scenarios","authors":"Dong Xiao , Zhihang Song , Mingyuan Zhai , Nan Jiang","doi":"10.1016/j.compeleceng.2025.110430","DOIUrl":"10.1016/j.compeleceng.2025.110430","url":null,"abstract":"<div><div>In complex interactive environments, distributed multiple unmanned surface vehicles (multi-USV) systems need to make efficient and safe collision avoidance decisions based on limited sensor information, while complying with the International Regulations for Preventing Collisions at Sea (COLREGs), which is a challenging task. In this paper, based on the Optimal Reciprocal Collision Avoidance (ORCA) algorithm, we propose a new concept: the cost of escaping velocity obstacles (VO) and effectively integrate it into the Deep Reinforcement Learning (DRL) framework. In addition, this paper considers the problem of dynamic change in the number of USVs and credit assignment, and trains a distributed multi-USV path planning policy DRL-Evoc by combining the mechanisms of curriculum learning and frame-skipping decision. To address the partial observability limitations of the DRL framework, the traditional global path planning algorithm A* is further integrated with the DRL-Evoc policy to construct the integrated control framework (ICF) for multi-USV path planning. Performance testing and comparative analysis were conducted in the Unity3D environment, demonstrating that the ICF exhibits strong collision avoidance capabilities, generalization, and compliance with COLREGs. This study provides a new approach for multi-USV path planning.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"124 ","pages":"Article 110430"},"PeriodicalIF":4.0,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143935712","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

Jaya dung beetle optimization-based load balancing and VM Migration for cloud data security in DevOps 基于Jaya屎壳郎优化的负载均衡和虚拟机迁移在DevOps中的云数据安全

IF 4 3区计算机科学

Computers & Electrical Engineering Pub Date : 2025-05-01 DOI: 10.1016/j.compeleceng.2025.110400

Yanamala Harinatha Reddy , D B Jagannadha Rao , Vijayakumar Polepally

{"title":"Jaya dung beetle optimization-based load balancing and VM Migration for cloud data security in DevOps","authors":"Yanamala Harinatha Reddy , D B Jagannadha Rao , Vijayakumar Polepally","doi":"10.1016/j.compeleceng.2025.110400","DOIUrl":"10.1016/j.compeleceng.2025.110400","url":null,"abstract":"<div><div>In cloud computing applications different development strategies like (Development and Operational) DevOps are deployed due to their wide applications. At the same time, migration from the development framework to an organization framework is required for deploying various applications in the cloud to ensure scalability and optimal resource usage in DevOps. Various security vulnerabilities occur in the deployment environment during the migration process. The inherent complexity of DevOps along with the absence of proper encryption schemes make it vulnerable to attacks. To address this issue, the Jaya Dung Beetle Optimization (JDBO) approach is designed for balancing load and performing Virtual Machine (VM) migration. Here, the code is configured initially using the DevOps code repository, and the code processor is exploited for handling the version control. The source code changes are determined and data is encrypted. Later, VM is categorized as underloaded and overloaded by utilizing Deep Embedded Clustering (DEC) and the load is computed. VM migration and load balancing are effectuated using JDBO. Finally, the deployment of the VM is carried out again and the VM data is decrypted. Moreover, the JDBO observed resource utilization, load, mitigation costs, time complexity, and capacity of 0.934, 0.065, 8.5, 0.439 s, and 90.79 MB.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"124 ","pages":"Article 110400"},"PeriodicalIF":4.0,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143935710","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 chaotic-based image encryption scheme using multi-layer confusion and conditional diffusion 一种基于多层混沌和条件扩散的图像加密方案

IF 4 3区计算机科学

Computers & Electrical Engineering Pub Date : 2025-05-01 DOI: 10.1016/j.compeleceng.2025.110402

Wajid Ali , Zhang Zuping , Muhammad Hussain

{"title":"A novel chaotic-based image encryption scheme using multi-layer confusion and conditional diffusion","authors":"Wajid Ali , Zhang Zuping , Muhammad Hussain","doi":"10.1016/j.compeleceng.2025.110402","DOIUrl":"10.1016/j.compeleceng.2025.110402","url":null,"abstract":"<div><div>In the era of digital communication, ensuring the security and efficiency of digital images has become a critical concern. This article proposes a novel three-stage scheme for encrypting images to address high-complexity and low-efficiency issues. First, the Secure Hash Algorithm-256 (SHA-256) is used to initialize an Intertwining Logistic Map (ILM), ensuring plaintext sensitivity and resistance to known chosen-text attacks. In the next confusion phase, a concentric-layer pixel-shuffling pattern is introduced to enhance the randomness of the image data. This pattern divides image pixels into different circular layers, with the number of layers determined by half of the square image’s size. To achieve complete randomness, zigzag shuffling is then applied. Finally, a condition-based diffusion approach integrates chaotic sequences with the confused image. If the selected chaotic sequence value is odd, DNA-based diffusion is performed between the confused image and the DNA-encoded masked image generated by the chaotic sequence of ILM; otherwise, an exclusive OR (XOR) operation is applied between the confused image and a chaotic sequence of ILM. The results of the XOR and DNA operations are then combined to generate the cipher image. The average entropy is 7.9973, NPCR is 99.62%, UACI is 33.46%, and the correlation is close to 0. The key space exceeds <span><math><mrow><mn>1</mn><msup><mrow><mn>0</mn></mrow><mrow><mn>105</mn></mrow></msup></mrow></math></span>, suggesting strong security. The proposed scheme improves efficiency, strengthens encryption against cryptanalytic attacks, and improves the practical applicability of the proposed image cipher.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"124 ","pages":"Article 110402"},"PeriodicalIF":4.0,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143923207","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

High-capacity reversible data hiding in encrypted images using double-label calculation and adaptive positioning technique 利用双标签计算和自适应定位技术实现高容量可逆数据隐藏

IF 4 3区计算机科学

Computers & Electrical Engineering Pub Date : 2025-05-01 DOI: 10.1016/j.compeleceng.2025.110365

At Pham Van , Hoa Le Quang , Thai Pham Minh , Trung Mai Manh

{"title":"High-capacity reversible data hiding in encrypted images using double-label calculation and adaptive positioning technique","authors":"At Pham Van , Hoa Le Quang , Thai Pham Minh , Trung Mai Manh","doi":"10.1016/j.compeleceng.2025.110365","DOIUrl":"10.1016/j.compeleceng.2025.110365","url":null,"abstract":"<div><div>This paper proposes a novel reversible data hiding (<span><math><mrow><mi>R</mi><mi>D</mi><mi>H</mi></mrow></math></span>) method in encrypted images with high embedding capacity using double-label calculation and an adaptive positioning technique. The image owner encrypts the image by block permutation and stream cipher encryption. The data hider transforms each block into a binary matrix, enabling efficient data embedding while maintaining reversibility. The method introduces a double-label calculation technique for blocks with labels ranging from 0 to 3, significantly increasing embedding capacity. Additionally, the adaptive positioning technique enhances compression efficiency for sparse bit sequences. Experimental results demonstrate that the proposed method achieves superior embedding capacity compared to existing techniques while maintaining high security. The method ensures separate processes for data extraction and image recovery, making it suitable for applications requiring high data security and reversibility</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"124 ","pages":"Article 110365"},"PeriodicalIF":4.0,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143902451","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

An advanced approach for cloud enabled energy efficient ventilation control of multiple main fans in underground coal mines 煤矿井下多主风机云化节能通风控制的先进方法

IF 4 3区计算机科学

Computers & Electrical Engineering Pub Date : 2025-05-01 DOI: 10.1016/j.compeleceng.2025.110330

Prasad Bhukya, Krishna Naick Bhukya

引用次数: 0

Indexing history spatio-temporal samples with error-bounded regression Hilbert trees 用误差有界回归希尔伯特树索引历史时空样本

IF 4 3区计算机科学

Computers & Electrical Engineering Pub Date : 2025-05-01 DOI: 10.1016/j.compeleceng.2025.110394

Jingyu Han, Jin Chen, Fan Wu, Wenzhen Wang, Yi Mao, Yiting Zhang

{"title":"Indexing history spatio-temporal samples with error-bounded regression Hilbert trees","authors":"Jingyu Han, Jin Chen, Fan Wu, Wenzhen Wang, Yi Mao, Yiting Zhang","doi":"10.1016/j.compeleceng.2025.110394","DOIUrl":"10.1016/j.compeleceng.2025.110394","url":null,"abstract":"<div><div>To support the querying of history spatio-temporal data, existing learned multi-dimensional indexes usually suffer from either the redundant scanning or missing answers during query processing due to their approximate indexing. To answer window queries constrained by a road network, this paper proposes to learn an Error-bounded regression Hilbert Tree (EHT) to predict a sample’s storage position with a function of Hilbert curve. The learning consists of data ordering and model training. During the data ordering, every road network constrained sample is projected onto a position-time grid whose cells are traversed by a Hilbert curve. During the model training, history samples are divided into a series of equal-duration periods, and an EHT is constructed for every period to establish the mapping between every spatio-temporal sample and its storage position. The EHT safely covers every qualifying sample within the given error bound, thus achieving a full recall. Further, it models the distribution with as tight a strip as possible, thus reducing the disk scanning cost to the minimum during query processing. Extensive experiments on real and synthetic datasets demonstrate that the EHT reduces the index size by a factor between 1.46 and 43.4 while consuming much fewer disk IOs, or at most one or two more disk IOs, compared to the state-of-the-art learned indexes. In comparison with the delicate indexes, the EHT reduces the index size by a factor between 5.46 and 62.5 while consuming much fewer or roughly the same number of disk IOs.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"124 ","pages":"Article 110394"},"PeriodicalIF":4.0,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143894900","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

Quantum Analysis of Trivium 氚的量子分析

IF 4 3区计算机科学

Computers & Electrical Engineering Pub Date : 2025-05-01 DOI: 10.1016/j.compeleceng.2025.110370

Sumanta Chakraborty , SK Hafizul Islam , Anubhab Baksi

引用次数: 0

Dm 2: Decision-making market for DApps Dm 2: dapp的决策市场

IF 4 3区计算机科学

Computers & Electrical Engineering Pub Date : 2025-05-01 DOI: 10.1016/j.compeleceng.2025.110364

Jialiang Fan , Qianhong Wu , Qin Wang , Kun Wang , Xiaopeng Dai

{"title":"Dm 2: Decision-making market for DApps","authors":"Jialiang Fan , Qianhong Wu , Qin Wang , Kun Wang , Xiaopeng Dai","doi":"10.1016/j.compeleceng.2025.110364","DOIUrl":"10.1016/j.compeleceng.2025.110364","url":null,"abstract":"<div><div>Effective governance is vital for the proper operation and evolution of complex blockchain systems. Traditional blockchain governance mechanisms, primarily reliant on voting, face significant challenges including majority voting errors and incentive mismatch. To address these issues, we proposed <span>Dm</span> <span><math><msup><mrow></mrow><mrow><mn>2</mn></mrow></msup></math></span>, a decision market designed to incentivize decision-makers and enhance decision accuracy in blockchain governance.</div><div>In <span>Dm</span> <span><math><msup><mrow></mrow><mrow><mn>2</mn></mrow></msup></math></span> participants are encouraged to trade information, effectively resolving incentive shortcomings. Our marketplace can leverage collective intelligence to make decisions even when the majority opinion may be incorrect. We incorporate cryptographic techniques, including homomorphic time-lock puzzles and zero-knowledge proofs, to ensure fairness and security, preventing manipulation and ensuring proper participant rewards. Through a formal mechanism design model, we demonstrate that <span>Dm</span> <span><math><msup><mrow></mrow><mrow><mn>2</mn></mrow></msup></math></span> satisfies Bayesian incentive compatibility and budget balance, promoting truthful reporting and efficient market operation. Our implementation and evaluation of <span>Dm</span> <span><math><msup><mrow></mrow><mrow><mn>2</mn></mrow></msup></math></span> show its efficiency, scalability, and practicality in real-world settings.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"124 ","pages":"Article 110364"},"PeriodicalIF":4.0,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143918455","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

Optimized intelligent power quality control strategy for hybrid alternating current-direct current microgrid with electric vehicle charging 交直混合微电网电动汽车充电智能电能质量控制优化策略

IF 4 3区计算机科学

Computers & Electrical Engineering Pub Date : 2025-05-01 DOI: 10.1016/j.compeleceng.2025.110397

Putchakayala Yanna Reddy, Lalit Chandra Saikia

{"title":"Optimized intelligent power quality control strategy for hybrid alternating current-direct current microgrid with electric vehicle charging","authors":"Putchakayala Yanna Reddy, Lalit Chandra Saikia","doi":"10.1016/j.compeleceng.2025.110397","DOIUrl":"10.1016/j.compeleceng.2025.110397","url":null,"abstract":"<div><div>The hybrid alternating current and direct current microgrid systems, integrating a variety of energy sources and loads, including the Electric Vehicle Charging Station. The increasing number of charging station with imbalanced loads has caused power quality issues, particularly in Total Harmonic Distribution. Hence, to solve this, a unique Honey Badger Decision Gradient Boost (HBDGB) controller has been introduced to enhance the power quality in hybrid alternating current-direct current micro grids. The developed HBDGB controller enhances power quality by managing the parameters in the bidirectional alternating current-direct current converter. The decision gradient boosting function creates the duty cycle once the peak powers have been measured. The Honey Badger's fitness process also regulates the parameters and changes the duty cycle. It measures the system's performance regarding Mean Absolute Error, Root Mean Square Error, Total Harmonic Distribution, and switch loss. The suggested controller yielded a Total Harmonic Distribution rate of 0.602 %, a switching loss of 0.0600 watts, a Root Mean Square Error value of 0.07×10<sup>-1</sup>, and a Mean Absolute Error value of 0.009×10<sup>-1</sup> significantly lower than existing techniques, highlighting its superior efficiency in power quality improvement. Hence, the proposed model is more requirement system for the alternating current-direct current microgrid to improve power quality by regulating the Total Harmonic Distribution issues.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"124 ","pages":"Article 110397"},"PeriodicalIF":4.0,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143918457","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