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
 19   20   21   22   23 
Performance Analysis of Uplink Scheduling Algorithms in LTE Networks Shafinaz Bt Ismail; Darmawaty Bt Mohd Ali; Norsuzila Ya’acob
Indonesian Journal of Electrical Engineering and Computer Science Vol 9, No 2: February 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v9.i2.pp373-379

Abstract

Scheduling is referring to the process of allocating resources to User Equipment based on scheduling algorithms that is located at the LTE base station. Various algorithms have been proposed as the execution of scheduling algorithm, which represents an open issue in Long Term Evolution (LTE) standard. This paper makes an attempt to study and compare the performance of three well-known uplink schedulers namely, Maximum Throughput (MT), First Maximum Expansion (FME), and Round Robin (RR). The evaluation is considered for a single cell with interference for three flows such as Best effort, Video and VoIP in a pedestrian environment using the LTE-SIM network simulator. The performance evaluation is conducted in terms of system throughput, fairness index, delay and packet loss ratio (PLR). The simulations results show that RR algorithm always reaches the lowest PLR, delivering highest throughput for video and VoIP flows among all those strategies. Thus, RR is the most suitable scheduling algorithm for VoIP and video flows while MT and FME is appropriate for BE flows in LTE networks.
Smart monitor of pacemaker patient by using IoT cloud in real time Jameel Kadhim Abed; Hassnaa Mustafa Abd-aljabar
Indonesian Journal of Electrical Engineering and Computer Science Vol 18, No 1: April 2020
Publisher : Institute of Advanced Engineering and Science

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

Abstract

People severing from heart diseases are increasing day after day, now it's more important to focus on this destructive problem and provide a good health care and remote patient monitoring .An effective monitoring system has been discovered to monitor patients who are implanting a pacemaker and need long-term follow-up. So extensive research has been done to monitor ECG and analyze it by using the free open source website and linking it with portable ECG system that are responsible for the presentation and storage of data to the doctor and patient. In this research we will develop a new method of ECG monitoring for patients who are implanting pacemakers and help them to transfer their ECG signal for long distances depending on the Internet things (IOT). Once the device is worn, it will start collecting ECG information and sent it directly via Wi-Fi to the IOT cloud. Reviewing ECG data through the web has led to the alleviation of the problem of the inability of the doctor to monitor the patient from the home as well as in the event that the doctor is being in another country ,the device also helps to discover the magnetic field that confuses the pacemaker by giving the patient a warning. The results of the test are able to detect that the system would be reliable for displaying real-time ECG data, which could help facilitate patient follow-up after implantation of the pacemaker at home with ease of use and cheaper price.
Harmonic Analysis and Compensation Strategy for Grid-connected Inverter with LCL Filter Xiaowei Dong; Yize Sun; Yujie Chen; Jie Yang
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 2: February 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

In this paper, the harmonic components of grid-connected current are systemically and quantitatively analyzed, including the high-frequency harmonics caused by the modulation, and the low-frequency harmonics injected by the inherent non-linear characteristics and dead-time effects of switching tubes along with the DC voltage secondary pulsation and the grid disturbance. Furthermore, a combined control scheme of repetitive control and state feedback is brought forward, in which the feedforward decoupling for DC voltage and the feedforward compensation for grid voltage are added. The proposed control strategy can eliminate resonance peak of LCL filter, suppress and compensate the low-frequency harmonics, so that quick response and tracking without static error of the system can be realized. Finally, the rationality of the presented harmonic analysis and the validity of the presented combined control scheme are verified on the 3kW inverter experiment system.DOI : http://dx.doi.org/10.11591/telkomnika.v12i2.3578
Step Responses of Tuned Conventional Controller for a Three Tank Liquid Filled System Kunal Chakraborty; Rahul Dev Basak; Dipak Kumar Dutta
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 12: December 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i12.pp8161-8165

Abstract

In this paper modeling of a temperature measuring tank system has been done and then a tuned PID Controller have been used for controlling the step responses of the system. The proposed system extends to a three tank system & each tank has same amount of liquid. The results of computer simulation for the system with Proportional, Integral and Derivative (PID) Controllers are shown here using MATLAB( R2007b) software.
Lightweight Communication Overhead Authentication Scheme Using Smart Card Ahmed Y. F. Al_Sahlani; Songfeng Lu
Indonesian Journal of Electrical Engineering and Computer Science Vol 1, No 3: March 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v1.i3.pp597-606

Abstract

Authentication takes its place to grant authorized user a remote access to certain online resources. As well, prevent unauthorized user from accessing that resources. Unforyunatly most of authentication schemes consider only security factors without taking in consideration the communication resources required. Recently, Li et. al. proposed an enhanced smart card based remote user password authentication scheme. We analyzed their scheme and we pointed out that, their scheme required high communication overhead. Furthermore, their scheme suffer from forgery, user impersonation and server impersonation attacks. Through this paper to address aforesaid weaknesses, we propose a Lightweight communication overhead authentication scheme using smart card. The security and performance analysis shows that, our proposed scheme is lightweight communication and computation cost as well secure and can withstand wide spectrum of malicious attacks, like forgery, insider, replay and stolen smart card attack. Besides, our scheme encompasses desired security attributes. Therefore, it is suitable for practical use compared to other related scheme. 
Artificial Emotion Engine Benchmark Problem Based on Psychological Test Paradigm Wang Yi; Wang Zhi-liang
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 8: August 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Most of testing and evaluations of emotion model in the field of affective computing are self-evaluation, which aims at the application-specific background, while the research on the problem of the Benchmark emotional model is scarce. This paper firstly proposed the feasibility of making psychological test paradigm a part of artificial Benchmark engine, and with taking versatility and effectiveness as the evolutional factor to judge the engine by testing psychological paradigms. In addition, an emotional hidden Markov model is built and tested based on the Benchmark theory. The detailed simulation process of the experiment is given.  The testing resultants are coincide with the real world’s situation. DOI: http://dx.doi.org/10.11591/telkomnika.v11i8.3067
Discrete Evolutionary Programming for Network Splitting Strategy: Different Mutation Technique N.Z. Saharuddin; Zainal Abidin; H. Mokhlis
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 1: October 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i1.pp261-268

Abstract

Network splitting is performed to prevent the power system network from blackout event during severe cascading failures. This action will split the power system network into few islands by disconnecting the proper transmission lines. It is very important to select the optimal splitting solution (transmission lines to be removed) to ensure that the implementation of network splitting does not cause the system to worsen. Therefore, this paper investigates two different mutation techniques; single-level and three-level mutation, utilized in Discrete Evolutionary Programming (DEP) optimization to find the optimal splitting solution following a critical line outage. Initial cutsets based heuristic technique is employed to help the convergence of the DEP optimization with minimal power flow disruptions as its fitness function. The techniques are validated using the IEEE 30 and IEEE 118-bus system. The results show that three-level mutation technique produces better optimal splitting solution as compared to single mutation technique.
Image Reconstruction Based on Combination of Inverse Scattering Technique and Total Variation Regularization Method Nor Haizan Jamali; Kismet Anak Hong Ping; Shafrida Sahrani; Dayang Azra Awang Mat; Mohamad Hamiruce Marhaban; Mohd Iqbal Saripan; Toshifumi Moriyama; Takashi Takenaka
Indonesian Journal of Electrical Engineering and Computer Science Vol 5, No 3: March 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v5.i3.pp569-576

Abstract

The Forward-Backward Time-Stepping (FBTS) had proven its potential to reconstruct images of buried objects in inhomogeneous medium with useful quantitative information about its size, shape, and locality. The Total Variation regularization method was incorporated with the FBTS algorithm to deal with the ill-posedness or ill-conditionedness of the inverse problem. The effectiveness of the proposed technique is confirmed by numerical simulations. The numerical method was carried out on a simple object detection through FBTS with and without TV regularization method. The detection and reconstruction of relative permittivity and conductivity of the simple object have shown an improvement as TV regularization method applied whereas it smoothed the vibrations of the images and gave a better estimation of the image’s boundaries.
A novel bio- inspired algorithm for hunting in multi robot scenario Poorva Agrawal; Himanshu Agrawal; Vidyasagar Potdar
Indonesian Journal of Electrical Engineering and Computer Science Vol 15, No 3: September 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v15.i3.pp1553-1563

Abstract

In a multi-robot scenario, cooperative hunting is a key issue when a group of robots are hunting for evader/evaders and when the location of the evader is continuously changing. Cooperative hunting is addressed in this paper by proposing a novel bio inspired Corner Dragging Algorithm (CDA). Corner Dragging Algorithm operates by making an alliance of robots that drag the evader towards any one of the four corners; whichever is closest to the evader. Different shapes of obstacles are avoided during this pursuit. While developing the Corner Dragging Algorithm, we analyze the shortcomings and advantages of some of the existing algorithms including dynamic alliance and formation construction algorithm and incorporate these changes in our design to achieve improved results. Performance of the algorithm is evaluated on the basis of simulation in MATLAB.
Non-Sinusoidal PWM Method for Cascaded Multilevel Inverter Shahrin Md Ayob; Zaenal Salam; Abdul Halim M. Yatim
Indonesian Journal of Electrical Engineering and Computer Science Vol 10, No 4: August 2012
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

This paper presents a new switching method for Cascaded Multilevel Inverter (CMI).  The new method uses multiple non-sinusoidal signals as the modulating signal.  The main advantage of using non-sinusoidal modulating signal is that it provides higher fundamental component but at the cost of having a numbers of low-order harmonics in its unfiltered output voltage; naturally contributed by the non-sinusoidal modulating signal. In this paper, the Trapezoidal waveform is employed as the non-sinusoidal modulating signal for the CMI.  Its harmonics profile of different slope angles is analysed.  From the analysis, it was found that the trapezoidal with the slope angle of 36o eliminates the third and fifth harmonics yet yields a high fundamental magnitude.  To verify, a single-phase CMI prototype is constructed and an ALTERA FPGA is deployed to implement the proposed method’s algorithm.  From the results, it was shown that analysis is validated DOI: http://dx.doi.org/10.11591/telkomnika.v10i4.855

Page 21 of 918 | Total Record : 9174

 19   20   21   22   23 

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