cover
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
ISSN : 25024752     EISSN : 25024760     DOI : -
Core Subject :
Arjuna Subject : -
Articles 9,226 Documents
Performance evaluation of arithmetic coding data compression for internet of things applications Nor Asilah Khairi; Asral Bahari Jambek; Rizalafande Che Ismail
Indonesian Journal of Electrical Engineering and Computer Science Vol 13, No 2: February 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v13.i2.pp591-597

Abstract

Wireless Sensor Network (WSN) is known for its autonomous sensors, where it has been found to be useful during the development of Internet of Things (IoT) devices. However, WSN is also known for its limited energy supply and memory space, as it carries small-sized batteries and memory space. Hence, a data compression approach has been introduced in this paper with the purpose of solving this particular issue. This paper focused on the performance of the Arithmetic Coding algorithm. Temperature (Temp), Sea-Level Pressure (Pressure), stride interval (Stride), and heart rate (BPM) were chosen as the dataset in this project. Based on the results, the compression ratio of Temp, Pressure, Stride, and BPM were 0.428, 0.255, 0.217, and 0.159 respectively. From this analysis, BPM produced the best compression ratio. Undeniably, the Arithmetic Coding algorithm is one of the best methods to compress real-world datasets. Hence, by using this approach, it can reduce the usage of energy and memory space.Wireless Sensor Network (WSN) is known for its autonomous sensors, where it has been found to be useful during the development of Internet of Things (IoT) devices. However, WSN is also known for its limited energy supply and memory space, as it carries small-sized batteries and memory space. Hence, a data compression approach has been introduced in this paper with the purpose of solving this particular issue. This paper focused on the performance of the Arithmetic Coding algorithm. Temperature (Temp), Sea-Level Pressure (Pressure), stride interval (Stride), and heart rate (BPM) were chosen as the dataset in this project. Based on the results, the compression ratio of Temp, Pressure, Stride, and BPM were 0.428, 0.255, 0.217, and 0.159 respectively. From this analysis, BPM produced the best compression ratio. Undeniably, the Arithmetic Coding algorithm is one of the best methods to compress real-world datasets. Hence, by using this approach, it can reduce the usage of energy and memory space.
Online Monitoring of Grid Connected Residential Photovoltaic System using Zigbee and Web Server Syafii Ghazali; Roni Putra; Hasdi Putra
Indonesian Journal of Electrical Engineering and Computer Science Vol 7, No 3: September 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v7.i3.pp668-675

Abstract

The paper presents grid-tied PV monitoring system using wireless sensor networks.  The temperature and humidity parameters were measured using DHT22. While ACS 712 5A current sensor and Arduino voltage sensor modules were used to measure photovoltaic output current and voltage respectively. Web application has been developed in the base station using PHP programming web server to access the sensor nodes through Zigbee wireless data communication. The user can access the HTML web interface of Photovoltaic monitoring system through local Ethernet or Wi-Fi connection. The residential 1.25 kWp grid connected photovoltaic system used to test the developed monitoring system. The data received exactly same as data sensed from remote area with average delay time 3 to 4 seconds. The result shows the photovoltaic power generation caracteristics under clear sky, cloud cover, and rainy weather conditions. The power 608.12 Wp has been generated by the solar panel from 7.00 am to 6.00 pm or 6.7 kWh per day during clear sky. During intermittent cloud covered the photovoltaic power graph have shown fluctuation power profile and energy conversion were decreased as well as in raining weather condition. The electrical power has been generated by photovoltaic for almost 12 hours per day in tropics area, but energy conversion is highly influenced by weather conditions, especially cloud cover, overcast and rainy.
Implementation flow control to improve quality of service on computer networks Ahmad Khafidin; Tatyantoro Andrasto; Suryono Suryono
Indonesian Journal of Electrical Engineering and Computer Science Vol 16, No 3: December 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v16.i3.pp1474-1481

Abstract

Quality of Service (QoS) is the collective effect of service performances, which determine the degree of satisfaction of a user of the service. In addition, QoS defined as the ability of a network to provide good service. QoS aims to provide different quality of services for various needs in the IP network. QoS parameters that can be used to analyze the data communication services are jitter, packet loss, throughput, and delay. The quality of QoS parameters in the network is affected by congestion. Congestion occurs because there is an excessive queue in the network. Congestion can be prevented by implementing flow control on network. Flow control is a method to control the data packet flow in a network. By controlling of the data packet flow, it can improve of QoS. This study intends to find out value of QoS on the internet network at Faculty Engineering, State University of Semarang by measuring network performance using QoS parameters. Then, in this research will be implemented the token bucket method as a flow control mechanism at the network to improve the QoS. After research and data analysis, internet network at Faculty Engineering State University of Semarang has QoS value was 3,5 with 87,5 % of percentage and classified in satisfying of category. When measuring the network performance, there are decreases of performance at access point that having data rates 150 Mbps with many users connected. It has 9,0 ms of delay value, 0.046 ms of jitter, 16,6% of packet loss and, 1293407 bps of throughput. After token bucket was applied as flow control mechanism that be simulated on Graphical Network Simulator 3, the internet network has QoS values 3,75 with 93,75 % of percentage and classified as “satisfying” category. Furthermore, the percentage of the throughput value obtained on network by implementing flow control is 62%, while on the existing network is 41%.
Implementation of Input-Process-Output Model for Measuring Information System Project Success A'ang Subiyakto; Abd. Rahman Ahlan
Indonesian Journal of Electrical Engineering and Computer Science Vol 12, No 7: July 2014
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v12.i7.pp5603-5612

Abstract

Measurement of the information system (IS) project success has become the interesting topic for researchers and practitioners since the Standish Group published their findings in 1994.  Project success theory is the main concept in this topic, but this theory is still an ambiguous concept and lack in agreement among researchers and practitioners. They are also still tend to focus on single or partial dimension. Therefore, they did not get a clear picture of the system measurements. This study developed an alternative model of the project success measurement based on input-process-output (IPO) model. The development was conducted using comparison, adoption, adaptation, and combination the previous theories and models: Davis's IPO model, the project success theories, Delone and McLean' model, and the project classificatory framework. As indicated in most studies that most of models are developed using the previous theories and models rather than on empirical proofs. The result is a IS project success model consisting of 9 variables and 36 relationships among the variables. Although, the model is only a conceptual model, but it was developed completely and coherently considering three main aspects of project success measurement, namely: processional and causal models, project success theories, and the influence concept of project environment.
Research of the Nonlinear System Identification Based on the Volterra RLS Adaptive Filter Algorithm Wen Xinling; Chen Yu
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 5: May 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

This paper mainly research a kind of nonlinear system modeling method based on the  Volterra series RLS adaptive filter algorithm. Through the modeling second order Volterra nonlinear system, and adapting Volterra RLS algorithm to apply in the first order and second order item, under the gaussian noise condition, iterations times is not more than fifty times, the algorithm can realize convergence, which prove the algorithm accuracy. Volterra RLS adaptive filter algorithm can be effectively applied into the mechanical vibration damping and de-noising in active control, which has a broad application prospect. DOI: http://dx.doi.org/10.11591/telkomnika.v11i5.2261
Maximally Spatial-Disjoint Lightpaths in Optical Networks M. Waqar Ashraf; Sevia M. Idrus; Farabi Iqbal
Indonesian Journal of Electrical Engineering and Computer Science Vol 10, No 2: May 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v10.i2.pp733-740

Abstract

Lightpaths enable end-to-end all-optical transmission between network nodes. For survivable routing, traffic is often carried on a primary lightpath, and rerouted to another disjointed backup lightpath in case of the failure of the primary lightpath. Though both lightpaths can be physically disjointed, they can still fail simultaneously if a disaster affects them simultaneously on the physical plane. Hence, we propose a routing algorithm for provisioning a pair of link-disjoint lightpaths between two network nodes such that the minimum spatial distance between them (while disregarding safe regions) is maximized. Through means of simulation, we show that our algorithm can provide higher survivability against spatial-based simultaneous link failures (due to the maximized spatial distance).
Car Service Spare Parts Procurement Process Improvements Based on SOA Yue You; Yingcheng Xu; Li Wang
Indonesian Journal of Electrical Engineering and Computer Science Vol 3, No 3: September 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v3.i3.pp554-563

Abstract

There are many kinds of automobile after-sale service spare parts, which are with a complex relationship in replacement and a large time span in models. The management of automobile after-sale service spare parts is a challenge, not only for automobile manufacturer but also for distributor. Therefore, it becomes an important and difficult task for automobile enterprises to do well in the supply of after-sale service spare parts, but also a target for automobile enterprises to explore and pursue continuously. Taking FAW-Volkswagen Automobile Co. Ltd. as the background, we conducted analysis on its procurement management process of spare parts; we also made some improvements on its process and pushed forward the corresponding products and solutions based on SOA (Service-oriented architecture) framework, so as to improve the procurement efficiency of automobile spare parts, and save cost.
Implementation of Object Recognition Based on Type of Vehicle Entering Main Gate Hairol Nizam Mohd Shah; Mohd Zamzuri Ab Rashid; Zalina Kamis; Muhammad Nizam Kamarudin; Mohd Fairus Abdollah; Alias Khamis
Indonesian Journal of Electrical Engineering and Computer Science Vol 3, No 2: August 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v3.i2.pp458-467

Abstract

This project related to develop and implementation of object recognition based on type of vehicle entering the main gate to facilitate the employment data of vehicles entering according to the types of vehicles. Data for the number of vehicles in accordance with the types recorded. In completing this project, there are two algorithms used, the detection algorithm and classification algorithm. Vehicles will be classified by comparison in terms of it front light area and will be stored in three types of vehicles; sedan, multipurpose van or van, and four wheel drive. Wireless camera is mounted with 1.6 meters high on the pipe rod at the guard house as input for the processing algorithm. Vehicle image will be captured by a wireless camera and then processed to identify its type. Data for the type of vehicle and number of vehicles by type is shown through the Graphical User Interface (GUI). Inflow and outflow of vehicles can be monitored via the control unit (GUI) without human monitoring at the entrance.
A Framework For Concept Drifting P2P Traffic Identification Guanghui Yan; Minghao Ai
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

Identification of network traffic using port-based or payload-based analysis is becoming increasing difficult with many Peer-to-Peer (P2P) application using dynamic ports, masquerading techniques, and encryption to avoid detection. To overcome this problem, several machine learning technique were proposed to classify P2P traffics. But in the real P2P network environment, new communities of peers often attend and old communities of peers often leave. It requires the identification methods to be capable of coping with concept drift, and updating the model incrementally. In this paper, we present a concept-adapting algorithm CluMC which is based on streaming data mining techniques to identify P2P applications in Internet traffic. The CluMC use micro-cluster structures which contain potential micro-cluster structures and outlier micro-cluster structures to classify the P2P traffic and discover the concept drift with limited memory. Our performance study over a number of real data sets that we captured at a main gateway router demonstrates the effectiveness and efficiency of our method. DOI: http://dx.doi.org/10.11591/telkomnika.v11i8.3030
Low-Frequency Pulse Width Modulation Control Methods of Ultrasonic Motor Shi Jingzhuo; Zhang Caixia
Indonesian Journal of Electrical Engineering and Computer Science Vol 11, No 9: September 2013
Publisher : Institute of Advanced Engineering and Science

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

Abstract

Because of the serious non-linearity and coupling among state variables caused by the complex energy conversion process in ultrasonic motor, the motion control strategy of ultrasonic motor still need to be studied in detail to obtain better performance. As a kind of special control method, the low-frequency PWM control strategy can make the on-line optimum control easier, and may be an effective means to realize high performance motion control using ultrasonic motor. But this kind of strategy has not been studied in detail until now. This paper analyzes the difference among three low-frequency PWM control methods in details, works out the principle of selection among these methods. DOI: http://dx.doi.org/10.11591/telkomnika.v11i9.3262

Filter by Year

2012 2026


Filter By Issues
All Issue Vol 42, No 1: April 2026 Vol 41, No 3: March 2026 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