cover
Contact Name
Nizirwan Anwar
Contact Email
nizirwan.anwar@esaunggul.ac.id
Phone
-
Journal Mail Official
telkomnika@ee.uad.ac.id
Editorial Address
Ahmad Yani st. (Southern Ring Road), Tamanan, Banguntapan, Bantul, Yogyakarta 55191, Indonesia
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
TELKOMNIKA (Telecommunication Computing Electronics and Control)
ISSN : 16936930     EISSN : 23029293     DOI : 10.12928
Core Subject : Science,
Submitted papers are evaluated by anonymous referees by single blind peer review for contribution, originality, relevance, and presentation. The Editor shall inform you of the results of the review as soon as possible, hopefully in 10 weeks. Please notice that because of the great number of submissions that TELKOMNIKA has received during the last few months the duration of the review process can be up to 14 weeks. Communication Engineering, Computer Network and System Engineering, Computer Science and Information System, Machine Learning, AI and Soft Computing, Signal, Image and Video Processing, Electronics Engineering, Electrical Power Engineering, Power Electronics and Drives, Instrumentation and Control Engineering, Internet of Things (IoT)
Articles 3,452 Documents
Benchmarking level interactivity of Indonesia government university websites Nurdin Nurdin; Zana Chobita Aratusa
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 18, No 2: April 2020
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v18i2.14888

Abstract

Website interactivity is increasingly essential for higher education institutions in maintaining their relationship with stakeholders. However, limited is known what the level interactivity of a university website is without comparing with other similar educational institutions. Through the use of website content analysis and benchmarking strategy, we evaluate 41 government university website for benchmarking purposes. Base on thirteen interactive criteria, we successfully benchmarked the government university websites and built a-five levels of websites interactivity with different features. Our study highlights that higher level interactivity of website contains more feature that support a two-way communication between university and consumers, while lower level of websites interactivity merely have basic features for communication. The findings suggest the highest level of websites interactivity, the more features they should have. More importantly, the findings suggest web developer to design more interactive features in developing a higher level of website interactivity.
A combination of hill cipher and RC4 methods for text security Azanuddin Azanuddin; Rikie Kartadie; Fauzi Erwis; Ahmad Fitri Boy; Asyahri Hadi Nasyuha
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 22, No 2: April 2024
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v22i2.25628

Abstract

To hide confidential messages from people who are not responsible or who can access the messages, a way is needed to hide the messages. One way to hide messages in transmission is to change the data into something unintelligible by encoding and embedding it using cryptography and steganography techniques. This application was built using the hill cipher algorithm and the Rivest Cipher 4 (RC4) method. This algorithm is a symmetric key algorithm which has several advantages in data encryption. The hill chiper algorithm uses a mxm matrix as the encryption and decryption key. Meanwhile, the RC4 symmetric key is in the form of a stream cipher which can process input data as well as messages or information. Input data is generally in the form of bytes or even bits. The results of this research show that hill cipher and RC4 have their respective advantages and disadvantages. However, currently, RC4 is generally considered less safe for use in security-critical scenarios due to its vulnerability to attack. It is highly recommended to use an encryption algorithm such as advanced encryption standard (AES) which is modern and strong and has been tested and proven to be more resilient.
Analyzing temporal properties of speech trajectory using graph structures towards speech recognition Parabattina Bhagath; Malempati Shanmukha; Gnana Nagasri Puthi
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 23, No 6: December 2025
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v23i6.26893

Abstract

Speech signal analysis aims to identify patterns within data to develop effec tive recognition algorithms. This process primarily utilizes feature extraction techniques such as linear predictive coding (LPC), linear predictive cepstral co efficients (LPCCs), and Mel-frequency cepstral coefficients (MFCCs). These features are crucial for constructing recognition algorithms that leverage both statistical and deep learning methods. While deep learning models require ex tensive datasets, they often prove unsuitable for low-resource languages. The Hidden Markov model (HMM)is the most widely adopted statistical framework in speech processing. However, HMMs are characterized by state-dependent models, where each state interacts only with its neighboring states. This limita tion restricts HMMs from capturing long-term signal properties, highlighting the need for addressing these constraints at the feature extraction stage. Most feature extraction methods rely on short-term signal processing, which further limits the comprehension of speech utterances. To overcome these limitations, alter native methods are necessary to capture more comprehensive patterns. This pa per presents a graph-based approach for analyzing speech trajectories and their temporal properties, which are subsequently validated using HMMs in speech recognition tasks. Graph-based representations on a low-resource Telugu dataset improve recognition accuracy by 13% while reducing processing time compared to traditional LPC.
Multi-threaded approach in generating frequent itemset of Apriori algorithm based on trie data structure Ade Hodijah; Urip Teguh Setijohatmo; Ghifari Munawar; Gita Suciana Ramadhanty
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 20, No 5: October 2022
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v20i5.24088

Abstract

This research is about the application of multi-threaded and trie data structures to the support calculation problem in the Apriori algorithm. The support calculation results can search the association rule for market basket analysis problems. The support calculation process is a bottleneck process and can cause delays in the following process. This work observed five multi-threaded models based on Flynn’s taxonomy, which are single process, multiple data (SPMD), multiple process, single data (MPSD), multiple process, multiple data (MPMD), double SPMD first variant, and double SPMD second variant to shorten the processing time of the support calculation. In addition to the processing time, this works also consider the time difference between each multi-threaded model when the number of item variants increases. The time obtained from the experiment shows that the multi-threaded model that applies a double SPMD variant structure can perform almost three times faster than the multi-threaded model that applies the SPMD structure, MPMD structure, and combination of MPMD and SPMD based on the time difference of 5-itemsets and 10-itemsets experimental result.
Interpretable machine learning for digital soil pH mapping using an optimized AdaBoost algorithm Zakiyyan Zain Alkaf; A’isya Nur Aulia Yusuf; Elsa Sari Hayunah Nurdiniyah; Tri Wisudawati
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 24, No 4: August 2026
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v24i4.27724

Abstract

Soil pH is a fundamental parameter determining nutrient availability, microbial activity, and crop productivity. Unlike previous studies that often prioritize prediction accuracy over explainability, this study proposes an interpretable machine-learning framework integrating hyperparameter optimized adaptive boosting (AdaBoost) with Shapley Additive exPlanations (SHAP) to unravel the spatial drivers of soil pH. A systematic workflow was implemented to evaluate a diverse set of algorithms, followed by Bayesian optimization to fine-tune the best-performing models. The results demonstrated that the optimized AdaBoost model yielded the largest performance improvement (~7.5%), achieving excellent accuracy on independent test data with a coefficient of determination (R²) of 0.817 and a mean absolute error (MAE) of 0.293. Furthermore, SHAP analysis identified iron (Fe) and calcium carbonate (CaCO₃) as the most influential predictors, revealing that Fe exhibits a strong inverse relationship with pH, while CaCO₃ shows a positive association. This framework successfully balances high predictive accuracy with pedological interpretability, offering a robust tool for digital soil mapping and precision agriculture.
The bending effects on the performance of a flexible circular microstrip antenna on rubber-carbon substrates at 2.45 GHz Ahmad Alhadi Ruslan; Sarah Yasmin Mohamad; Norun Farihah Abdul Malek; Siti Hajar Yusoff; Siti Noorjannah Ibrahim
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 23, No 1: February 2025
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v23i1.26042

Abstract

In this paper, we studied the effects of bending on the performance of a flexible circular microstrip antenna on rubber-carbon substrates at the 2.45 GHz industrial, scientific, and medical (ISM) band. Several rubber compositions are analyzed which include natural rubber (no carbon filler), rubber with 20% carbon filler, rubber with 25% carbon filler, and rubber with 50% carbon filler. Four types of bending directions are applied in this work i.e., side-inward, side-outward, top-inward, and top-outward with bending radius ranging from 100-500 mm. It is observed that even though the resonant frequency of the antenna shifted a bit when bending is applied, the S11 at the intended frequency remains below -10 dB. The bandwidth and gain also maintain an acceptable performance despite all the directions and radius of the bending, due to the wide bandwidth characteristics of the antenna. With these results, the proposed antenna is shown to be usable for wearable applications at 2.45 GHz, in both flat and bent conditions. We also show that it is essential to design a flexible antenna with a wide bandwidth to guarantee that the antenna maintains optimal performance even under curved conditions.
Traffic flow measurement for smart traffic light system design Mohammed Al-Momin; Mohammed K. Alkhafaji; Mrtdaa M. H. Al-Musawi
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 21, No 4: August 2023
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v21i4.24706

Abstract

Determining congestions on intersection roads can significantly improve the performance of a traffic light system. One of the everyday problems on our roads nowadays is the unbalanced traffic on different roads. The blind view of roads and the dependency on the conventional timer-based traffic light systems can cause unnecessary delays on some arterial roads on expense of offering a needless extra pass time on some other secondary minor roads. In this paper, a foreground extraction model has been built in MATLAB platform to measure the congestions on the different roads constructing an intersection. Results show a satisfactory performance in terms of accuracy in counting cars and in consequence reducing the wait time on some major roads. System was tested under different weather and lighting conditions, and results were adequately promising.
Optimized load balance scheduling algorithm Rawaa Mohammed Abdul-Hussein; Ahmed Hashim Mohammed
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 20, No 1: February 2022
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v20i1.22464

Abstract

The cloud computing environment faces several challenges as a federation of clouds, controlling the traffic flow, scalability, and balancing the load on virtual machines that are considered the most crucial issue due to their impact on the execution time, resource utilization, and cost. This paper is interested in some of the existing algorithms that distribute the workload evenly. These algorithms aim to avoid the blind assignment that often results in some over-loaded servers while another node might be under-loaded. In this work a combination of two inspired metaheuristic algorithms BAT and cuckoo search was proposed; the first algorithm can utilize fast exploration using global search, the latter algorithm can avoid trapping into BAT local optimum problem using levy flight with a far random walk. Additonaly, the proposed algorithm could be used to mitigate distributed denial of service (DDoS) attack that aims to cause endless load on the servers and stop the service. Experimental results for five virtual machine (VM), ten VM, with the varying number of tasks showed that the proposed algorithm has better resource utilization and less makespan time in almost all the cases.
Performance evaluation of serverless cloud-native API deployment: a case study on a mobile health application Maulana Bintang Irfansyah; Bilal Waheed; Idris Winarno; Akhmad Alimudin
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 24, No 1: February 2026
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v24i1.27261

Abstract

As software applications become increasingly complex, there is a growing need for scalable, flexible, and high-performance backend solutions. Cloud computing-based application programming interfaces (APIs) address these demands by enabling developers to offload resource-intensive tasks to the cloud while eliminating the burden of infrastructure management. This study presents a case study using Obesifix, a mobile health application for real time dietary monitoring and personalized nutrition recommendations. Two deployment models were evaluated: a traditional server-based architecture using Google Compute Engine (GCE) and a serverless approach using Google Cloud Run (GCR). Performance testing was conducted with Apache JMeter under simulated loads of 60, 120, and 180 users across four critical API endpoints (register, login, recommendation, prediction). Results show that GCR consistently achieved 20–30% lower response times and 15–20% higher throughput compared to GCE, while maintaining 0% error rate, lower memory consumption, and more balanced virtual central processing unit (vCPU) utilization. Time to first byte (TTFB) remained below 800 ms across all scenarios, confirming good server responsiveness. These findings highlight the scalability and efficiency benefits of serverless architectures for mobile health applications. Future research should explore asynchronous programming paradigms, autoscaling thresholds, and cost-performance trade-offs, as well as multi-cloud deployments to enhance system resilience and generalizability.
Distributed secondary control for proportional power sharing and DC bus voltage restoration in standalone DC microgrid Phan-Thanh Nguyen; Duc Minh Pham
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 22, No 3: June 2024
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v22i3.25893

Abstract

This article proposes a distributed secondary control scheme based on the voltage-shifting method for standalone direct current (DC) microgrids to enforce proportional power-sharing under the imbalance of the feeder line impedances and compensate for the DC bus voltage error caused by the droop control. Secondary control will be implemented on local controllers to increase reliability. A low-bandwidth communication network will also be needed to exchange converters’ information. Using information from the communication network, the reference voltage for the primary control will be adjusted to compensate for the droop control and line impedance influences. The appropriate voltage shifting terms will be determined by the delta iteration method. The proposed control will be evaluated with simulations using PLECS software.

Filter by Year

2004 2026


Filter By Issues
All Issue Vol 24, No 4: August 2026 Vol 24, No 3: June 2026 Vol 24, No 2: April 2026 Vol 24, No 1: February 2026 Vol 23, No 6: December 2025 Vol 23, No 5: October 2025 Vol 23, No 4: August 2025 Vol 23, No 3: June 2025 Vol 23, No 2: April 2025 Vol 23, No 1: February 2025 Vol 22, No 6: December 2024 Vol 22, No 5: October 2024 Vol 22, No 4: August 2024 Vol 22, No 3: June 2024 Vol 22, No 2: April 2024 Vol 22, No 1: February 2024 Vol 21, No 6: December 2023 Vol 21, No 5: October 2023 Vol 21, No 4: August 2023 Vol 21, No 3: June 2023 Vol 21, No 2: April 2023 Vol 21, No 1: February 2023 Vol 20, No 6: December 2022 Vol 20, No 5: October 2022 Vol 20, No 4: August 2022 Vol 20, No 3: June 2022 Vol 20, No 2: April 2022 Vol 20, No 1: February 2022 Vol 19, No 6: December 2021 Vol 19, No 5: October 2021 Vol 19, No 4: August 2021 Vol 19, No 3: June 2021 Vol 19, No 2: April 2021 Vol 19, No 1: February 2021 Vol 18, No 6: December 2020 Vol 18, No 5: October 2020 Vol 18, No 4: August 2020 Vol 18, No 3: June 2020 Vol 18, No 2: April 2020 Vol 18, No 1: February 2020 Vol 17, No 6: December 2019 Vol 17, No 5: October 2019 Vol 17, No 4: August 2019 Vol 17, No 3: June 2019 Vol 17, No 2: April 2019 Vol 17, No 1: February 2019 Vol 16, No 6: December 2018 Vol 16, No 5: October 2018 Vol 16, No 4: August 2018 Vol 16, No 3: June 2018 Vol 16, No 2: April 2018 Vol 16, No 1: February 2018 Vol 15, No 4: December 2017 Vol 15, No 3: September 2017 Vol 15, No 2: June 2017 Vol 15, No 1: March 2017 Vol 14, No 4: December 2016 Vol 14, No 3: September 2016 Vol 14, No 2: June 2016 Vol 14, No 1: March 2016 Vol 13, No 4: December 2015 Vol 13, No 3: September 2015 Vol 13, No 2: June 2015 Vol 13, No 1: March 2015 Vol 12, No 4: December 2014 Vol 12, No 3: September 2014 Vol 12, No 2: June 2014 Vol 12, No 1: March 2014 Vol 11, No 4: December 2013 Vol 11, No 3: September 2013 Vol 11, No 2: June 2013 Vol 11, No 1: March 2013 Vol 10, No 4: December 2012 Vol 10, No 3: September 2012 Vol 10, No 2: June 2012 Vol 10, No 1: March 2012 Vol 9, No 3: December 2011 Vol 9, No 2: August 2011 Vol 9, No 1: April 2011 Vol 8, No 3: December 2010 Vol 8, No 2: August 2010 Vol 8, No 1: April 2010 Vol 7, No 3: December 2009 Vol 7, No 2: August 2009 Vol 7, No 1: April 2009 Vol 6, No 3: December 2008 Vol 6, No 2: August 2008 Vol 6, No 1: April 2008 Vol 5, No 3: December 2007 Vol 5, No 2: August 2007 Vol 5, No 1: April 2007 Vol 4, No 3: December 2006 Vol 4, No 2: August 2006 Vol 4, No 1: April 2006 Vol 3, No 3: December 2005 Vol 3, No 2: August 2005 Vol 3, No 1: April 2005 Vol 2, No 1: April 2004 More Issue