Preferred Language
Articles
/
bsj-9735
Optimizing Blockchain Consensus: Incorporating Trust Value in the Practical Byzantine Fault Tolerance Algorithm with Boneh-Lynn-Shacham Aggregate Signature
...Show More Authors

The consensus algorithm is the core mechanism of blockchain and is used to ensure data consistency among blockchain nodes. The PBFT consensus algorithm is widely used in alliance chains because it is resistant to Byzantine errors. However, the present PBFT (Practical Byzantine Fault Tolerance) still has issues with master node selection that is random and complicated communication. The IBFT consensus technique, which is enhanced, is proposed in this study and is based on node trust value and BLS (Boneh-Lynn-Shacham) aggregate signature. In IBFT, multi-level indicators are used to calculate the trust value of each node, and some nodes are selected to take part in network consensus as a result of this calculation. The master node is chosen from among them based on which node has the highest trust value, it transforms the BLS signature process into the information interaction process between nodes. Consequently, communication complexity is reduced, and node-to-node information exchange remains secure. The simulation experiment findings demonstrate that the IBFT consensus method enhances transaction throughput rate by 61% and reduces latency by 13% when compared to the PBFT algorithm.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Fri Oct 03 2025
Journal Name
Mesopotamian Journal Of Computer Science
Enhanced TEA Algorithm Performance using Affine Transformation and Chaotic Arnold Map
...Show More Authors

In digital images, protecting sensitive visual information against unauthorized access is considered a critical issue; robust encryption methods are the best solution to preserve such information. This paper introduces a model designed to enhance the performance of the Tiny Encryption Algorithm (TEA) in encrypting images. Two approaches have been suggested for the image cipher process as a preprocessing step before applying the Tiny Encryption Algorithm (TEA). The step mentioned earlier aims to de-correlate and weaken adjacent pixel values as a preparation process before the encryption process. The first approach suggests an Affine transformation for image encryption at two layers, utilizing two different key sets for each layer. Th

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Sat May 24 2025
Journal Name
Iraqi Journal For Computer Science And Mathematics
Intrusion Detection System for IoT Based on Modified Random Forest Algorithm
...Show More Authors

An intrusion detection system (IDS) is key to having a comprehensive cybersecurity solution against any attack, and artificial intelligence techniques have been combined with all the features of the IoT to improve security. In response to this, in this research, an IDS technique driven by a modified random forest algorithm has been formulated to improve the system for IoT. To this end, the target is made as one-hot encoding, bootstrapping with less redundancy, adding a hybrid features selection method into the random forest algorithm, and modifying the ranking stage in the random forest algorithm. Furthermore, three datasets have been used in this research, IoTID20, UNSW-NB15, and IoT-23. The results are compared with the three datasets men

... Show More
View Publication Preview PDF
Scopus (6)
Crossref (4)
Scopus Crossref
Publication Date
Tue Jan 01 2019
Journal Name
Ieee Access
Speech Enhancement Algorithm Based on Super-Gaussian Modeling and Orthogonal Polynomials
...Show More Authors

View Publication
Scopus (46)
Crossref (44)
Scopus Clarivate Crossref
Publication Date
Tue Oct 16 2018
Journal Name
Springer Science And Business Media Llc
MOGSABAT: a metaheuristic hybrid algorithm for solving multi-objective optimisation problems
...Show More Authors

Scopus (68)
Crossref (51)
Scopus Clarivate Crossref
Publication Date
Wed May 10 2023
Journal Name
Journal Of Engineering
A Proposal Algorithm to Solve Delay Constraint Least Cost Optimization Problem
...Show More Authors

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Thu Feb 15 2024
Journal Name
Evolving Systems
Boosted Aquila Arithmetic Optimization Algorithm for multi-level thresholding image segmentation
...Show More Authors

View Publication
Scopus (13)
Crossref (9)
Scopus Clarivate Crossref
Publication Date
Wed Oct 28 2015
Journal Name
Journal Of Mathematics And System Science
Simulating Particle Swarm Optimization Algorithm to Estimate Likelihood Function of ARMA(1, 1) Model
...Show More Authors

Crossref
Publication Date
Mon Jan 01 2007
Journal Name
Journal Of Educational And Psychological Researches
مقترح تصميم منهج جغرافي في ضوء التعليم عن بعد وتدريسه للمعلمين في الكلية التربوية المفتوحه في العراق لتجويد العملية التعليمية الجامعية مستقبلا
...Show More Authors

     لقد إزدادت التطورات العلمية والتكنولوجية ولاسيما المعلوماتية زيادة في العلوم والحقائق والنظريات والإكتشافات بصورة مذهلة، وكذلك زيادة فروع في العلم والمعرفة ففي كل يوم نشهد قيام فروع أو تخصص معرفي جديد، إضافة إلى تفجر المعرفة التي ساهمت في بناء قنوات الفروع والتخصصات العلمية القديمة والجديدة (عبد الغفور 2001 ص8).

     فالثورة في مجال العلم والمعرفة والمعلومات والإتصا

... Show More
View Publication Preview PDF
Publication Date
Fri Jan 01 2021
Journal Name
Journal Of Engineering
A Proposed Adaptive Bitrate Scheme Based on Bandwidth Prediction Algorithm for Smoothly Video Streaming
...Show More Authors

A robust video-bitrate adaptive scheme at client-aspect plays a significant role in keeping a good quality of video streaming technology experience. Video quality affects the amount of time the video has turned off playing due to the unfilled buffer state. Therefore to maintain a video streaming continuously with smooth bandwidth fluctuation, a video buffer structure based on adapting the video bitrate is considered in this work. Initially, the video buffer structure is formulated as an optimal control-theoretic problem that combines both video bitrate and video buffer feedback signals. While protecting the video buffer occupancy from exceeding the limited operating level can provide continuous video str

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Fri Oct 31 2025
Journal Name
Sustainability
Upgrading Sustainability in Clean Energy: Optimization for Proton Exchange Membrane Fuel Cells Using Heterogeneous Comprehensive Learning Bald Eagle Search Algorithm
...Show More Authors

Clean energy applications widely recognize Proton Exchange Membrane Fuel Cells (PEMFCs) for their high efficiency and environmental compatibility. Accurate parameter identification of PEMFC models is essential for enhancing system performance and reliability, particularly under dynamic operating conditions. This paper presents a novel optimization-based approach called Heterogeneous Comprehensive Learning-Bald Eagle Search (HCLBES) with enhanced exploration and exploitation capabilities for the effective modeling of PEMFC. The algorithm combines the exploration strength of the Bald Eagle Search with comprehensive learning and heterogeneity mechanisms to achieve a balanced global and local search space. In this algorithm, the number

... Show More
View Publication Preview PDF
Scopus (1)
Crossref (3)
Scopus Crossref