cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
,
INDONESIA
Indonesian Journal of Electrical Engineering and Informatics (IJEEI)
Published by IAES Indonesia Section and Partners
ISSN : 20893272     EISSN : -     DOI : -
Core Subject : Science, Engineering,
Computer Science & IT Electrical & Electronics Engineering
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) is a peer reviewed International Journal in English published four issues per year (March, June, September and December). The aim of Indonesian Journal of Electrical Engineering and Informatics (IJEEI) is to publish high-quality articles dedicated to all aspects of the latest outstanding developments in the field of electrical engineering. Its scope encompasses the engineering of Telecommunication and Information Technology, Applied Computing & Computer, Instrumentation & Control, Electrical (Power), Electronics, and Informatics.
Arjuna Subject : -
Articles 783 Documents
 65   66   67   68   69 
Enhanced Field-Oriented Control for Synchronous Reluctance Motor Using Fuzzy Logic Madbouly, Sayed O.
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol 13, No 1: March 2025
Publisher : IAES Indonesian Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52549/ijeei.v13i1.6070

Abstract

This paper presents a fuzzy logic-based Field Oriented Control (FOC) strategy for synchronous reluctance motors (SynRMs). The proposed algorithm addresses the inherent nonlinearities and parameter sensitivities of SynRMs by integrating fuzzy logic control (FLC) into the FOC framework, enhancing system robustness and adaptability. The SynRM model is derived in the rotor reference frame, with two control loops implemented: one for speed control and the other for flux control. Two FLCs are utilized in the speed control loop, while one FLC is adopted in the flux control loop. Fuzzy sets, membership functions, and rule bases enable dynamic parameter tuning. The entire system is simulated in MATLAB/Simulink. The system's dynamic performance is rigorously evaluated in two scenarios: with decoupling control components between the speed and flux control loops, and without these components under various loading conditions. Comprehensive simulations demonstrate that the proposed control algorithm, without decoupling control components, exhibits superior dynamic performance in terms of rise time, overshoot, and settling time. Furthermore, eliminating the decoupling components reduces the system's dependency on machine parameters while having a minor effect on undershoot.
Developing a Prototype for Enhancing Data Security in LoRaBased Theft Detection Systems Using ASCON-128 Encryption Amelia, Fetty; Wulandari Hartejo, Bella
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol 13, No 1: March 2025
Publisher : IAES Indonesian Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52549/ijeei.v13i1.6021

Abstract

Asset protection is crucial for organizations to prevent theft. This study presents a LoRa-based theft detection prototype enhanced with ASCON-128 encryption for secure data transmission. The system consists of a transmitter attached to assets and a receiver in a monitoring room, featuring a web-based digital map for real-time tracking. ASCON-128, a NIST-standard lightweight encryption algorithm, ensures data confidentiality and integrity against ManIn-The-Middle (MITM) attacks. The system was evaluated based on transmission speed, power consumption, and security performance. Results indicate that ASCON-128 integration reduces data transmission speed by 42.7% in Line-of-Sight (LOS) and 45.35% in Non-Line-of-Sight (NLOS) conditions. Power consumption increased by 2.7% in standby mode and 12.85% under simulated attack scenarios. Despite these trade-offs, encryption provides significant security benefits with acceptable resource overhead, making it a viable solution for LoRa-based asset tracking and theft detection.
Enhancing LEACH Protocol with Multi-Criteria Decision Making for Prolonged Network Lifetime in WSNs Altaha, Mohammed A.; Al Ali, Ghazwan Abdulnabi
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol 13, No 1: March 2025
Publisher : IAES Indonesian Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52549/ijeei.v13i1.6054

Abstract

Wireless Sensor Networks (WSNs) have become a crucial solution for monitoring across diverse environments and consist of tiny sensor nodes that autonomously gather data on the environment. Energy depletion is a looming challenge, as sensor nodes rely heavily on their batteries, and once exhausted, the entire network can collapse prematurely. The Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol is a cornerstone in energy-efficient routing protocols for WSNs. However, the Cluster Head (CH) selection process in the traditional LEACH protocol relies on a probabilistic model for CH selection, where each sensor has an equal chance of becoming a CH based on a fixed threshold. To address these issues, this paper proposes an enhanced version of the LEACH protocol by employing a Multi-Criteria Decision-Making (LEACHMCDM) process for CH selection. Instead of relying on random probabilities, the proposed protocol incorporates three key factors: Residual Energy (RE), Distance to the Base Station (DBS), and Node Degree (ND). Nodes with higher RE, shorter DBS, and an optimal ND are more likely to be selected as CHs. Compared to the traditional LEACH, the proposed method significantly improves the network’s lifetime by evenly distributing energy consumption and reducing the risk of premature node failure. Simulation results demonstrate the enhanced protocol’s ability to sustain more operational rounds and achieve higher energy efficiency.
Optimizing Data Survivability in Unattended Wireless Sensor Networks: A Machine Learning Approach to Cluster Head Selection and Hybrid Homomorphic Encryption Sivaraman, Haritha K; L, Rangaiah
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol 13, No 1: March 2025
Publisher : IAES Indonesian Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52549/.v13i1.5998

Abstract

The research relies on machine learning-based Cluster Head (CH) selection and optimised Attribute-Based Encryption (ABE) with Homomorphic Encryption to improve data survivability in Unattended Wireless Sensor Networks (UWSNs). Integrating blockchain technology would enable tamper-proof data storage and provenance. The suggested method uses machine learning techniques like Deep Q-Networks (DQNs) or other models for intelligent and adaptive CH selection in UWSNs. Dynamically selecting CHs takes into account energy efficiency, network coverage, communication dependability, and node characteristics. The second part protects data using optimised Attribute-Based Encryption (ABE) and Homomorphic Encryption. ABE offers fine-grained attribute-based access control to restrict data access to authorised entities. Secure processing of encrypted data using homomorphic encryption protects privacy and integrity. These encryption algorithms are optimised to balance security and computational performance for efficient data processing and transmission while guaranteeing data privacy and integrity. Blockchain technology is suggested for tamper-proof data storage and provenance. To optimise the suggested solution's performance, the study uses the Seagull Optimisation Algorithm (SOA) and the Whale Optimisation Algorithm (WOA). These algorithms fine-tune system parameters, optimise CH selection, and boost UWSN performance. This holistic strategy uses machine learning-based CH selection, optimised ABE with Homomorphic Encryption, and blockchain technology for tamperproof data storage and provenance to improve UWSN data survival. Optimisation algorithms boost the solution's efficacy and efficiency, protecting UWSN data, latency, and energy usage.
Leveraging Gradient based Optimization based Unequal Clustering Algorithm for Hotspot Problem in Wireless Sensor Networks Arockiam, Jenita Mary; Panhalkar, Archana R.; Bhosale, Rajkumar Shankarrao; Kavitha, S.; Reddy, Desidi Narsimha; Kodali, Swetha
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol 13, No 1: March 2025
Publisher : IAES Indonesian Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52549/ijeei.v13i1.5851

Abstract

Wireless sensor networks (WSNs) serve as the basic unit of the Internet of Things (IoT). Because of their low prices and potential use, in recent years, wireless sensor networks (WSNs) have garnered attention for various uses. Then sensor nodes (SN) can prepared with limited battery is critical energy utilization be monitored closely. Hence, reducing the node energy utilization is obviously vital to extending the network lifespan. Clustering is an effectual manner for diminishing energy utilization in WSNs. In a multi-hop clustered network condition, every SN transfers data to its individual cluster head (CH), and the CH gathers the information from its member nodes and relays it to base station (BS) using other CHs. Conversely, the “hotspot” issue is inclined to take place in clustered WSNs while CHs near the BS are heavier intercluster forwarding tasks. In this article, we leverage Gradient based Optimization based Unequal Clustering Algorithm for Hotspot Problem (GBOUCA-HP) technique in the WSN. The GBOUCA-HP technique is applied to get rid of the unequal clustering process in the WSN using metaheuristic algorithms. The GBOUCA-HP technique focuses on the optimization of energy usage, resolving hot spots, and extending the network lifespan. In the GBOUCA-HP technique, the GBO algorithm is based on two concepts such as diversification and intensification search and the gradient‐based Newton’s phenomena. Moreover, the GBOUCA-HP technique adaptive selects the CHs with varying cluster sizes for diverse energy levels and computation abilities of the nodes. The widespread set of simulations and evaluations shows the effective performance of the GBOUCA-HP technique. The GBOUCA-HP technique is found to be a significant approach to tackling the hotspot issue in the WSN with the intention of decreasing energy consumption optimization and enhancing network efficiency.
Methodological Approach to Automated Recognition of Atrial Fibrillation and Subsequent Classification Lampezhev, Abas; Ivanov, Naur; Aslanov, Tagirbek; Nogmov, Muhamed; Lysenko, Viktor
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol 13, No 1: March 2025
Publisher : IAES Indonesian Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52549/ijeei.v13i1.6170

Abstract

This study considers topical issues aimed at improving the methodology of early recognition of atrial fibrillation and monitoring its treatment against the background of other heart rhythm disorders. The task set in this study is an essential component of the search for solutions, whose purpose is to increase the efficiency of information systems for cardiac diagnostics and monitoring within the framework of complex research to improve the means of heart rhythm analysis and arrhythmia recognition. In the context of this study, a linear discriminant analysis approach based on the concept of K-entropy was proposed as a means of automating the procedure for the recognition of AF against the background of other rhythm disorders using a limited data sample. With regard to the classification of atrial fibrillation samples, the use of decisive rules and arrhythmia types, based on the analysis of scatterograms, is put forth as a solution. The results of the proposed methods for recognizing the presence of atrial fibrillation and its classification demonstrated superior performance when compared to existing methods. The proposed method exhibited a specificity of 98.5% and a sensitivity of 98%. The proposed method for determining the presence of atrial fibrillation demonstrates suboptimal accuracy when applied to a limited sample size. Further development of the method should be concentrated in this area.
A Novel Methodology for Container Scheduling and Load Balancing in Distributed Environments M.S, Saravanan; Gogineni, Neelima
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol 13, No 1: March 2025
Publisher : IAES Indonesian Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52549/ijeei.v13i1.5938

Abstract

Deployment of applications in distributed environments via containers has gained huge popularity lately, specifically with cloud-based ecosystems. Inspired by the quick growth of container usage and deployment in distributed environments, efficient scheduling techniques are of prior significance embedded with load balancing in it for cloud computing tasks. Most of the scheduling strategies adopt conventional methods and fail to execute efficiently in the dynamic cloud or distributed environments where applications around the world depend on them for scalability, efficiency, and availability. Existing applications focus more on performance metrics instead of scheduling efficiency, so often they offer performance that can come at the expense of scheduling. This paper proposes a new algorithm that includes consideration of contention over the network, along with efficient canister planning and load distribution. The algorithm we have designed to achieve the proposed scheduling and load balancing is Contention-aware Greedy Heuristic Scheduling and Load Balancing for Containers (CGHSLBC), which has been extensively evaluated under continuous workload and has outperformed current state-of-the-art algorithms by 20% in load balancing efficiency and 25% in network contention reduction, demonstrating its promise for container scheduling in dynamic distributed environments.
A Survey on Blockchain-Based Routing in Communication Networks Wijesekara, Patikiri Arachchige D.S.N.
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol 13, No 1: March 2025
Publisher : IAES Indonesian Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52549/ijeei.v13i1.5441

Abstract

Routing in communication networks involves the transmission of packets among network nodes by making routing decisions constructed upon diverse protocols that can depend on various metrics. Blockchain systems made up of concatenated blocks inherently preserve the faithfulness, assure the non-deniability, and assure the obscured individuality of their transactions/blocks through the incorporation of distributed unanimity mechanisms and cryptographic techniques. In the present literature, it clearly lacks a review manuscript on the broad scope of blockchain-based routing; thus, we fill that gap by studying Blockchain-based Routing (BBR) under numerous routing techniques, identifying the concept under 5 divisions, and then in-depth scrutinizing the reviewed work based on blockchain-correlated, routing-correlated, and network-correlated characteristics. We collected a premature sample of 83 articles by cherry-picking articles for qualification requirements explored in scientific databases, employing an in-depth and extended quality assessment approach. As per the appraisal, BBR improves the overall routing performance and security through the storage of routing decisions and updates securely, automatic routing with the aid of smart contracts, providing authentication for secure routing, providing reputation-based routing, and blockchain-based onion routing. In-depth scrutinization reveals that 45.5% of BBR frameworks utilize blockchain for storing routing decisions and updates; 93.2% employ linear blockchain architecture; 20.5% employ proof-of-work consensus; 100% dynamic routing; 72.8% decentralized routing; 93.2% single path routing; 86.4% table-based; and 20.5% are designed for IoT networks. Finally, we disclose the possibilities and impediments of the idea of BBR, identify review gaps, and then render proposals to conquer them.
Clustering the Addiction Levels of Drug Users Using Fuzzy C-Mean Okfalisa, Okfalisa; Suliandri, Pramulia; Alwesabi, Ola A.; Tassuov, Bolat; Saule, Raimbayeva; Vitaliy, Kurdyukov; Zulkifli, Zahidah; Handayani, Lestari
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol 13, No 1: March 2025
Publisher : IAES Indonesian Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52549/ijeei.v13i1.6008

Abstract

Recently, the number of drugs abused, such as Narcotics, Psychotropics, and Addictive Substances have been linear increased with the drug users. The increasing number of these cases triggers the difficulties for rehabilitation associations in diagnosticating the abuse level for medical and health prevention. Herein, data mining with a Fuzzy C-Mean clustering approach is employed to delve 506 drug users’ addiction into three clusters by considering several indicators including age, urine test, duration of use, physical effects, and psychological effects. As a result, 215 data are recorded in clusters 1 as high optimum addiction, 105, and 186 data in clusters 2, and 3 as medium and regular addiction levels, respectively. The Silhouette Coefficient, Calinski-Harabasz Index, and Davies-Bouldin Index algorithms reveal high potential values to indicate the proper achievement of this clustering structural test. A clustering software has been successfully developed and tested to aid the calculation and analysis. Hence, the rehabilitation associations in Riau province as end-user of this case are aided in identifying the addiction level of drug users in order to ensure the proper therapeutic prevention and curative action.
A Novel Compact CPW-fed Octagonal-Shaped Slotted Antenna for UWB Applications Franklin Alex Joseph, A.; Jothi, B.; Shantha Sheela, R.; Anitha, N.; Priya, S.B.; Mohan, C.
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol 13, No 1: March 2025
Publisher : IAES Indonesian Section

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52549/ijeei.v13i1.6062

Abstract

A size-reduced CPW-fed Ultra-Wideband (UWB) octagonal-shaped patch antenna with a combination of multiple slots designed for UWB applications is proposed here. The proposed low-profile antenna includes three equalsized slots in an octagonal radiating patch. Moreover, better matching is provided by the feedline's U-shaped slots. A new combination of CPW configuration with a slotted octagonal patch increases bandwidth and reduces antenna size. The fabricated prototype of this octagonal-shaped antenna is situated on a basic FR4 substrate with a relative permittivity of εr = 4.3. The suggested antenna's substrate size measures 15 x 21 x 1.6 mm3 and has an 8.8 GHz overall bandwidth, which includes the frequency range of 3 GHz to 11.8 GHz. Variations in gain range from 1.3 to 3.2 dB, with an average overall efficiency above 81 %. This antenna has been fabricated and successfully validated with simulated results. Other features include its compactness, directivity, realized gain, and stable radiation properties across the entire operating band, proving its effectiveness.

Page 67 of 79 | Total Record : 783

 65   66   67   68   69 

Filter by Year

2013 2025


Reset
Filter By Issues
All Issue Vol 13, No 4: December 2025 Vol 13, No 3: September 2025 Vol 13, No 2: June 2025 Vol 13, No 1: March 2025 Vol 12, No 4: December 2024 Vol 12, No 3: September 2024 Vol 12, No 2: June 2024 Vol 12, No 1: March 2024 Vol 11, No 4: December 2023 Vol 11, No 3: September 2023 Vol 11, No 2: June 2023 Vol 11, No 1: March 2023 Vol 10, No 4: December 2022 Vol 10, No 3: September 2022 Vol 10, No 2: June 2022 Vol 10, No 1: March 2022 Vol 9, No 4: December 2021 Vol 9, No 3: September 2021 Vol 9, No 2: June 2021 Vol 9, No 1: March 2021 Vol 8, No 4: December 2020 Vol 8, No 3: September 2020 Vol 8, No 2: June 2020 Vol 8, No 1: March 2020 Vol 7, No 4: December 2019 Vol 7, No 3: September 2019 Vol 7, No 2: June 2019 Vol 7, No 1: March 2019 Vol 6, No 4: December 2018 Vol 6, No 3: September 2018 Vol 6, No 3: September 2018 Vol 6, No 2: June 2018 Vol 6, No 1: March 2018 Vol 5, No 4: December 2017 Vol 5, No 3: September 2017 Vol 5, No 2: June 2017 Vol 5, No 1: March 2017 Vol 4, No 4: December 2016 Vol 4, No 3: September 2016 Vol 4, No 2: June 2016 Vol 4, No 1: March 2016 Vol 3, No 4: December 2015 Vol 3, No 3: September 2015 Vol 3, No 2: June 2015 Vol 3, No 1: March 2015 Vol 2, No 4: December 2014 Vol 2, No 3: September 2014 Vol 2, No 3: September 2014 Vol 2, No 2: June 2014 Vol 2, No 1: March 2014 Vol 1, No 4: December 2013 Vol 1, No 3: September 2013 Vol 1, No 2: June 2013 Vol 1, No 1: March 2013 More Issue