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
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
Indonesian Journal of Electrical Engineering and Computer Science
Published by Institute of Advanced Engineering and Science
ISSN : 25024752     EISSN : 25024760     DOI : -
Core Subject :
Arjuna Subject : -
Articles 9,174 Documents
 728   729   730   731   732 
Cost-effective anonymous data sharing with forward security using improved authentication Shubhangi Handore; Pallavi Kolapkar; Pratibha Chavan; Pramod Chavan
Indonesian Journal of Electrical Engineering and Computer Science Vol 30, No 1: April 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v30.i1.pp129-136

Abstract

Cloud computing gives customers instant access to a network of remote servers, networks, and data centres. Cloud computing makes data analysis helpful to society and individuals. Sharing data with many people causes efficiency, integrity, and privacy issues. Ring signatures may enable secure and anonymous data transfer. It anonymizes data verification for cloud-based analytics. Identity-based (ID) ring signatures are becoming popular alternatives to public key infrastructure (PKI)-based public-key encryption. PKI bottlenecks are certificate verification time and cost. ID-based ring signatures speed up certificate verification. We observed that encrypting ID-based ring signatures with a variation of SHA-384 and adding forward security considerably improves their security. Padding divides the input text into 512-byte blocks and adds the length as a 48-bit value to the hash in newer SHA versions. Signatures made before a user's secret key was compromised are legitimate. If a user's secret key is compromised, it's impossible to compel all data owners to re-verify their data, hence a large-scale data sharing system must contain this feature. We implement, secure, and prove our method's use. SHA-384 is safer for cloud-based anonymous data sharing.
Design of a RoF fronthaul link based on optical generation of mm-waves for 5G C-RANs Faris Keti; Salih M. Atroshey; Jalil A. Hamadamin
Indonesian Journal of Electrical Engineering and Computer Science Vol 30, No 1: April 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v30.i1.pp157-166

Abstract

In this paper, a cloud-radio access networks based (C-RANs) radio-over-fiber (RoF) system have been reported with the optical generation of 28 GHz and 57 GHz millimeter-wave using phase modulation and stimulated Brillouin scattering effect in optical fibers. As a result, a cost-effective system with improved performance is achieved by the proposed method. Based on the proposed scheme, a 28 GHz (licensed band) and 57 GHz (Un-licensed band) optical millimeter-waves are generated by simulation only using 14 GHz and 16 GHz radio frequency (RF) respectively. Because the performance of any optical transmission system is limited by the Q factor and the bit error rate (BER) and any input power of the laser into the fiber needs to be less than the Brillouin threshold in order to avoid the sharp degradation of the Q factor. Also, the Brillouin threshold for this study setup is determined which is around 6 dBm in the case of licensed band and 2 dBm in the case of unlicensed band. The simulation results show that the proposed scheme can provide 100 km single-mode fiber for 28 GHz and 25 km for 57 GHz with transmission rates of 10 Gbps for both of them. In addition, a stable millimeter-wave RoF link, high quality carriers, and a reduction in nonlinearity effects are achieved with the proposed scheme.
Survey on attribute and concept reduction methods in formal concept analysis Mohammed Alwersh; László Kovács
Indonesian Journal of Electrical Engineering and Computer Science Vol 30, No 1: April 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v30.i1.pp366-387

Abstract

Formal concept analysis (FCA) is now widely recognized as a useful approach for extracting, representing, and analyzing knowledge in various domains. The high computational cost of knowledge processing and the difficulty of visualizing the lattice are two key challenges in practical FCA implementations. Moreover, assessing the finalized built-up lattice may be problematic due to the enormous number of formal concepts and the complexity of their connections. The challenge of constructing concept lattices of adequate size and structure to convey high-importance context features remains a significant FCA aim. In the literature, various strategies for concept lattice reduction have been presented. In this work, we suggest a categorization of reduction methods for concept lattice based on three main categories: context pre-processing, non-essential distinctions elimination, and concept filtration, whereby using FCA-based analysis, the most important methods in the literature are analyzed and compared based on six pillars: the preliminary step of the reduction process, domain expert, changing the original data structure, final concept lattice, quality of reduction, and category of reduction method.
Consensus-based secure and efficient compressive sensing in a wireless network sensors environment Nandini S. Patil; Asma Parveen
Indonesian Journal of Electrical Engineering and Computer Science Vol 30, No 1: April 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v30.i1.pp200-207

Abstract

Compressive sensing provides the optimal paradigm for data aggregation approach in wireless sensor networks as it holds the characteristics of low traffic cost and avoids the large communication overhead through a traditional approach. However, security is still considered one of the important, in recent years consensus-based approach has been one of the security highlights in compressive sensing. Moreover, a consensus is developed only with the help of genuine nodes. In this research work, a novel integrated-consensus-based secure compressive sensing (CSCS) is proposed which aims to develop a secure consensus environment to secure the network. Integrated-CSCS comprises several modules; at first certain variables are assigned to each node participating in the network. Later an algorithm is developed where each node evaluates the assigned neighbor variable and updates its states. Moreover, this phenomenon leads to the identification of genuine and compromised nodes. The proposed model is evaluated by considering the efficiency and security parameters; efficiency evaluation is carried out through energy consumption, and several node failures where as security is evaluated by considering the ability to identify the genuine node and malicious or corrupt node.
A smart system combining real and predicted data to recommend an optimal electric vehicle charging station Ibrahim EL-Fedany; Driss Kiouach; Rachid Alaoui
Indonesian Journal of Electrical Engineering and Computer Science Vol 30, No 1: April 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v30.i1.pp394-405

Abstract

The electric vehicle (EV) is considered an attractive alternative to a conventional vehicle, due to its potential beneficiation in decreasing carbon emission. But the battery range anxiety is a key challenge to its wide adoption and also the EV drivers spend so much time in public charging stations (CS) to charge especially during peak times. In this paper, we propose a charging station selected system (C3S) to control and manage EVs charging plans. Moreover, the C3S system proposed consists of a set of algorithms that are proposed to recommend a suitable CS for EV charging requests. The CS selection is based on minimizing travel time and takes into account in real-time the queuing time at CS, EVs' charging reservations, and the predicted time of EVs' future charging requests. Besides, we proposed three different strategies for predicting the EVs incoming and controlling the uncertainty matter of the dynamic arrival of EV charging requests. As part of the Helsinki City scenario, the evaluation results demonstrate the performance, especially at peak times, of our proposed C3S with regard to the CS recommendation which has the minimum total trip duration.
An improved hybrid semi-stacked autoencoder for item-features of recommendation system (iHSARS) Ahed Mleih Al-Sbou; Noor Hafhizah Abd Rahim
Indonesian Journal of Electrical Engineering and Computer Science Vol 30, No 1: April 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v30.i1.pp481-490

Abstract

In recent years, information overload has become a phenomenon where it makes people difficult to filter relevant information. To address issues such as high-dimensional data, cold start, and data sparsity, semi-autoencoder is one of the unsupervised deep learning methods used in the recommendation systems. It is particularly useful for reducing data dimensions, capturing latent representations, and flexibly reconstructing various parts of input data. In this article, we propose an improved hybrid semi-stacked autoencoder for item-features of recommendation system (iHSARS) framework. This method aims to show better performance of the hybrid collaborative recommendation via semi-autoencoder (HRSA) technique. Two novel elements for iHSARS’s architecture have been introduced. The first element is an increase sources of side information of the input layer, while the second element is the number of hidden layers has been expanded. To verify the improvement of the model, MovieLens-100K and MovieLens-1M datasets have been applied to the model. The comparison between the proposed model and different state-of-the-art methods has been carried using mean absolute error (MAE) and root mean square error (RMSE) metrics. The experiments demonstrate that our framework improved the efficiency of the recommendation system better than others.
Enhancing the security of quality of service-oriented distributed routing protocol for hybrid wireless network Miaad Husam Mahdi; Ibrahim Adel Ibrahim
Indonesian Journal of Electrical Engineering and Computer Science Vol 30, No 1: April 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v30.i1.pp121-128

Abstract

Merging the wireless infrastructure network with the wireless mobile ad-hoc networks constitutes hybrid wireless networks (HWNs). Quality of service (QoS) demands are available with the help of HWNs. However, these networks are subjected to many types of attacks because of their open wireless medium. To enhance the security of HWNs, it is necessary to provide secure routing protocols. Several routing protocols have been proposed for HWNs, one of them is the quality of service-oriented distributed (QOD) routing protocol. In this paper, two security mechanisms have been proposed for the QOD protocol. The first mechanism is used to protect transmitted data in the network using asymmetric and symmetric cryptography. The second mechanism has been proposed to enhance the security of the QOD routing protocol using keyed hash message authentication code (HMAC). The second security mechanism assumed that there is a secret key shared between each pair of neighbor nodes. Also, asymmetric cryptography is used to exchange the secret key. The secret key is used to include the message authentication code (MAC) for each message exchanged between the neighbor nodes. A network simulator NS2 is used to simulate our proposed schemes.
Faster region-based convolutional neural network for plant-parasitic and non-parasitic nematode detection Natalia Angeline; Nabila Husna Shabrina; Siwi Indarti
Indonesian Journal of Electrical Engineering and Computer Science Vol 30, No 1: April 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v30.i1.pp316-324

Abstract

Nematodes represent very abundant and the largest species diversity in the world. Nematodes, which live in a soil environment, possess several functions in agricultural systems. There are two huge groups of soil nematodes, a non-parasitic nematode, which contributes positively to ecological processes, and a plant-parasitic nematode, which cause various disease and reduces yield losses in the agricultural system. Early detection and classification in the agricultural area infected with plant-parasitic nematode and interpreting the soil level condition in this area required a fast and reliable detection system. However, nematode identification is challenging and time-consuming due to their similar morphology. This study applied a pre-trained faster region-based convolutional neural network (RCNN) for plant-parasitic and non-parasitic nematodes detection. These deep learning-based object detection models gave satisfactory results as the accuracy reached 87.5%.
Sophisticated CPBIS methods applied for FBISODATA clustering algorithm using with real time image database Muniappan Ramaraj; Dhandapani Sabareeswaran; V. Vijayalaksmi; Chembath Jothish; N. Thangarasu; Govindaraj Manivasagam
Indonesian Journal of Electrical Engineering and Computer Science Vol 30, No 1: April 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v30.i1.pp614-624

Abstract

Data mining is a process of mining hidden information to the previously unknown data and theoretically useful unknown information from a large amount of genuine data to be stored in a database. Image mining is a part of data mining with used as a predictive measure to identify with the age of the tiger. This research work is mainly focused on, to identify with the age of the Tiger using data mining techniques. This research work incorporates with which those domains of image processing and data mining to predict the age of the tiger using different kinds of color images are used. The fuzzy iterative self-organizing data analysis (FISODATA) clustering method requires more predefined parameters tofind the maximum number of iterations, the minimum number of points in the cluster, and smallest amount of distance with the centers of the clusters. The key undertaking of the studies of diverse colors mechanism is to decide the age of the tiger; the usage of shade action pixel primarily based on image segmentation; the usage of facts that are used in the mining techniques. However, the more matrix components to be measuring the processing time, retrieval time, accuracy, and blunders fee with the aid of using producing better performance.
Performance analysis of coded MIMO OFDM with subcarrier power modulation Amneen Naji Fadhel; Yahya Jassim Harbi
Indonesian Journal of Electrical Engineering and Computer Science Vol 30, No 1: April 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v30.i1.pp167-173

Abstract

This study investigates a new technique known as "orthogonal frequency division multiplexing with subcarrier power modulation" (OFDM-SPM) when compounded with a "multiple-input multiple-output" (MIMO) system. This combination of the two wireless technologies offers additional benefits and characteristics, such as increased spectrum efficiency (SE), increased energy efficiency (EE), and decreased transmission latency, among others. However, as compared to a traditional MIMO-OFDM system, the system's bit error rate (BER) show degradation. In this paper, turbo code is proposed as a coding technique to enhance the system performance with three-power reallocation policies (PRPs). The simulation results show that the BER and throughput performance has gotten better, where the throughput is doubled and the BER achieves about 10 dB gain by utilizing the proposed methods and compare to the classical MIMO OFDM, which makes the system more suitable for use in future wireless systems.

Page 730 of 918 | Total Record : 9174

 728   729   730   731   732 

Filter by Year

2012 2026


Reset
Filter By Issues
All Issue Vol 41, No 2: February 2026 Vol 41, No 1: January 2026 Vol 40, No 3: December 2025 Vol 40, No 2: November 2025 Vol 40, No 1: October 2025 Vol 39, No 3: September 2025 Vol 39, No 2: August 2025 Vol 39, No 1: July 2025 Vol 38, No 3: June 2025 Vol 38, No 2: May 2025 Vol 38, No 1: April 2025 Vol 37, No 3: March 2025 Vol 37, No 2: February 2025 Vol 37, No 1: January 2025 Vol 36, No 3: December 2024 Vol 36, No 2: November 2024 Vol 36, No 1: October 2024 Vol 35, No 3: September 2024 Vol 35, No 2: August 2024 Vol 35, No 1: July 2024 Vol 34, No 3: June 2024 Vol 34, No 2: May 2024 Vol 34, No 1: April 2024 Vol 33, No 3: March 2024 Vol 33, No 2: February 2024 Vol 33, No 1: January 2024 Vol 32, No 3: December 2023 Vol 32, No 1: October 2023 Vol 31, No 3: September 2023 Vol 31, No 2: August 2023 Vol 31, No 1: July 2023 Vol 30, No 3: June 2023 Vol 30, No 2: May 2023 Vol 30, No 1: April 2023 Vol 29, No 3: March 2023 Vol 29, No 2: February 2023 Vol 29, No 1: January 2023 Vol 28, No 3: December 2022 Vol 28, No 2: November 2022 Vol 28, No 1: October 2022 Vol 27, No 3: September 2022 Vol 27, No 2: August 2022 Vol 27, No 1: July 2022 Vol 26, No 3: June 2022 Vol 26, No 2: May 2022 Vol 26, No 1: April 2022 Vol 25, No 3: March 2022 Vol 25, No 2: February 2022 Vol 25, No 1: January 2022 Vol 24, No 3: December 2021 Vol 24, No 2: November 2021 Vol 24, No 1: October 2021 Vol 23, No 3: September 2021 Vol 23, No 2: August 2021 Vol 23, No 1: July 2021 Vol 22, No 3: June 2021 Vol 22, No 2: May 2021 Vol 22, No 1: April 2021 Vol 21, No 3: March 2021 Vol 21, No 2: February 2021 Vol 21, No 1: January 2021 Vol 20, No 3: December 2020 Vol 20, No 2: November 2020 Vol 20, No 1: October 2020 Vol 19, No 3: September 2020 Vol 19, No 2: August 2020 Vol 19, No 1: July 2020 Vol 18, No 3: June 2020 Vol 18, No 2: May 2020 Vol 18, No 1: April 2020 Vol 17, No 3: March 2020 Vol 17, No 2: February 2020 Vol 17, No 1: January 2020 Vol 16, No 3: December 2019 Vol 16, No 2: November 2019 Vol 16, No 1: October 2019 Vol 15, No 3: September 2019 Vol 15, No 2: August 2019 Vol 15, No 1: July 2019 Vol 14, No 3: June 2019 Vol 14, No 2: May 2019 Vol 14, No 1: April 2019 Vol 13, No 3: March 2019 Vol 13, No 2: February 2019 Vol 13, No 1: January 2019 Vol 12, No 3: December 2018 Vol 12, No 2: November 2018 Vol 12, No 1: October 2018 Vol 11, No 3: September 2018 Vol 11, No 2: August 2018 Vol 11, No 1: July 2018 Vol 10, No 3: June 2018 Vol 10, No 2: May 2018 Vol 10, No 1: April 2018 Vol 9, No 3: March 2018 Vol 9, No 2: February 2018 Vol 9, No 1: January 2018 Vol 8, No 3: December 2017 Vol 8, No 2: November 2017 Vol 8, No 1: October 2017 Vol 7, No 3: September 2017 Vol 7, No 2: August 2017 Vol 7, No 1: July 2017 Vol 6, No 3: June 2017 Vol 6, No 2: May 2017 Vol 6, No 1: April 2017 Vol 5, No 3: March 2017 Vol 5, No 2: February 2017 Vol 5, No 1: January 2017 Vol 4, No 3: December 2016 Vol 4, No 2: November 2016 Vol 4, No 1: October 2016 Vol 3, No 3: September 2016 Vol 3, No 2: August 2016 Vol 3, No 1: July 2016 Vol 2, No 3: June 2016 Vol 2, No 2: May 2016 Vol 2, No 1: April 2016 Vol 1, No 3: March 2016 Vol 1, No 2: February 2016 Vol 1, No 1: January 2016 Vol 16, No 3: December 2015 Vol 16, No 2: November 2015 Vol 16, No 1: October 2015 Vol 15, No 3: September 2015 Vol 15, No 2: August 2015 Vol 15, No 1: July 2015 Vol 14, No 3: June 2015 Vol 14, No 2: May 2015 Vol 14, No 1: April 2015 Vol 13, No 3: March 2015 Vol 13, No 2: February 2015 Vol 13, No 1: January 2015 Vol 12, No 12: December 2014 Vol 12, No 11: November 2014 Vol 12, No 10: October 2014 Vol 12, No 9: September 2014 Vol 12, No 8: August 2014 Vol 12, No 7: July 2014 Vol 12, No 6: June 2014 Vol 12, No 5: May 2014 Vol 12, No 4: April 2014 Vol 12, No 3: March 2014 Vol 12, No 2: February 2014 Vol 12, No 1: January 2014 Vol 11, No 12: December 2013 Vol 11, No 11: November 2013 Vol 11, No 10: October 2013 Vol 11, No 9: September 2013 Vol 11, No 8: August 2013 Vol 11, No 7: July 2013 Vol 11, No 6: June 2013 Vol 11, No 5: May 2013 Vol 11, No 4: April 2013 Vol 11, No 3: March 2013 Vol 11, No 2: February 2013 Vol 11, No 1: January 2013 Vol 10, No 8: December 2012 Vol 10, No 7: November 2012 Vol 10, No 6: October 2012 Vol 10, No 5: September 2012 Vol 10, No 4: August 2012 Vol 10, No 3: July 2012 More Issue