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
Fuzzy transform for high-resolution satellite images compression Donna Monica; Ayom Widipaminto
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.14903

Abstract

Many compression methods have been developed until now, especially for very high-resolution satellites images, which, due to the massive information contained in them, need compression for a more efficient storage and transmission. This paper modifies Perfilieva's Fuzzy transform using pseudo-exponential function to compress very high-resolution satellite images. We found that very high-resolution satellite images can be compressed by F-transform with pseudo-exponential function as the membership function. The compressed images have good quality as shown by the PSNR values ranging around 59-66 dB. However, the process is quite time-consuming with average 187.1954 seconds needed to compress one image. These compressed images qualities are better than the standard compression methods such as CCSDS and Wavelet method, but still inferior regarding time consumption.
Authentication and key distribution protocol based on Diffie-Hellman algorithm and physically unclonable function Victor A. Yakovlev; Dina Zh. Satybaldina; Eldor Egamberdiyev; Yerzhan Seitkulov
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.25705

Abstract

Based on the modified Diffie-Hellman (DH) protocol, a key distribution scheme between two correspondents over open communication channels is considered. The correspondents communicate through a trusted entity. An attacker can control the communication channels between the correspondents and the channels between the correspondents and the trusted authority (TA) and perform active attacks there, including a man-in-the-middle attack. DH authentication protocol using physically unclonable functions (PUF) is proposed. A formalized PUF model based on the class of universal hash functions is presented. Namely, it is proposed to use the class of strictly universal hash functions developed by Wegman and Carter. A polynomial dependence of the possible number of PPUs on the number of answers has been proven. Requirements for PPUs suitable for authentication systems are formulated. The protocol has been analyzed, and its security has been proved
Escalating QoS by firefly optimization of CGSTEB routing protocol with subordinate energy alert gateways R. Madonna Arieth; Ramya Govindaraj; Subrata Chowdhury; Thu Thi Nguyen; Tran Duc-Tan
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.27007

Abstract

Wireless sensor networks (WSNs) comprise large numbers of sensor nodes that are highly constrained by limited battery power, making energy-efficient routing essential for sustaining network lifetime and service quality. Among existing solutions, the general self-organized tree-based energy balancing (GSTEB) pro tocol with clustering has been widely adopted for energy-aware communication. However, GSTEB and its clustered variant often suffer from energy imbalance, high packet loss, and reduced quality of service (QoS) due to excessive load on cluster heads (CHs). To address these challenges, this paper introduces an enhanced routing framework that integrates firefly optimization with clustered GSTEB(CGSTEB)andintroduces subordinate energy alert gateways (SEAGs). The firefly algorithm is applied to optimize CH selection through a fitness func tion that balances residual energy and node proximity, ensuring efficient cluster formation and adaptive load distribution. Meanwhile, SEAGs establish a two hop communication model between CHs and the base station (BS), reducing CH energy consumption and preventing premature node failures. Simulation exper iments conducted in NS2 demonstrate that the proposed firefly-CGSTEB with SEAG significantly improves QoS metrics, including network lifetime, energy utilization, throughput, and packet loss rate, compared with conventional CG STEB. These results confirm the effectiveness of combining metaheuristic opti mization with gateway-assisted routing for resilient and energy-efficient WSNs.
PRO-VAS: utilizing AR and VSLAM for mobile apps development in visualizing objects Sofianita Mutalib; Mohd Alif Izhar; Shuzlina Abdul-Rahman; Mohd Zaki Zakaria; Mastura Hanafiah
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.24097

Abstract

The development of mobile apps with augmented reality (AR) would enhance the capability in visualizing the scene or environment. Any apps supported by computer aided design versions with 3D models makes the design more realistic, such as in the form of websites or mobile apps. However, the current features for online platforms for shopping are quite limited and lack 3D visualization features. This paper presents the development of a mobile application, pro-visualizer app called PRO-VAS, that utilizes AR for scanning and visualizing the environment. PRO-VAS acts as a product visualizer that applies visual simultaneous localization and mapping (VSLAM) for localization of the product in AR based systems. The main components of PRO-VAS are ARCore from Google for interactive purposes, and the depth mapping from red green blue depth (RGB-D) phone camera with point plane generator and markerless tracking method. The last component of the app is the set of objects from the unity store, which can be chosen in PRO-VAS for the scanned scene area. The app was tested in various environments involving different objects and has shown competitive results. In the future, more features and products can be added to the apps.
Sentiment analysis in telecommunications: a systematic review of applications and challenges Achraf Bouhamidi; Naziha Laaz; Zineb Rachik
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.27762

Abstract

The increasing amount of digital content on online platforms creates both opportunities and challenges for telecommunications operators aiming to improve customer experience. Sentiment analysis (SA), a subfield of natural language processing (NLP), allows for the extraction of subjective information from data generated by users. This paper presents a systematic literature review (SLR), conducted in accordance with Kitchenham’s guidelines, examining the applications and challenges of SA within the telecommunications sector. A structured methodology was used to select and analyze over 100 studies published between 2017 and 2025. The review categorizes SA methods and evaluates their application in practical telecom contexts, including customer satisfaction assessment, churn prediction, service monitoring, and reputation management. Findings indicate that machine learning and deep learning models can achieve performance levels up to 97% in specific experimental contexts. However, such results may vary depending on the datasets, evaluation protocols, and application contexts. Key challenges identified include handling informal language, domain dependency, multilingualism, sarcasm detection. Finally, the review highlights future directions such as real-time sentiment tracking, multimodal analysis, and the integration of federated learning for privacy-preserving customer analytics. This review provides a foundational reference for researchers and practitioners aiming to deploy effective sentiment-driven systems in the telecom industry.
79 GHz three stacked cylindrical dielectric resonator antenna array for automotive radar systems Abderrahim Haddad; Azize Bhaij; Mousa Hussein; Mohssin Aoutoul; Mohammed El Jourmi; Elhadi Baghaz; Said Dlimi; Youssef Errami; Abdellatif Obbadi; Fadwa El Moukhtafi; Redouane Jouali
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.26259

Abstract

Very high gain and sharp radiation beam of an original antenna array design, made of 16 linear three stacked cylindrical dielectric resonator antennas (three ScCDRA), is proposed in this work for automotive short-range radar (SRR) applications operating at 79 GHz. Firstly, a single antenna which functions around 79 GHz and reaches a gain value up to 11.8 dB is designed with success by piling three cylindrical DRA having permittivity values, respectively, 17.9, 16.9, and 9. However, relatively near peak values, of the main and the side lobs, makes the preliminary design less efficient for vehicle radar applications. To get a radar design with enhance properties, such as lower return loss, higher gain and especially reduced radiation pattern side lobs, we proceeded with an array design of 16 linear antenna-elements (1×16). As results, the three ScCDRA array structure provides 21.3 dB as gain peak value, a very narrow angular half power beam width (HPBW) of radiation pattern of 0.7 degree at 79 GHz. Feeding network design and positions of the sixteen linear antenna-elements, within this array, have been extensively investigated to carry out an optimal design still resonating around 79 GHz with a lower S11 parameter value up to -40 dB and hilly directional characteristics of radiation diagram.
Dickson voltage multiplier with 1 to 6 stages for dual-band rectifiers (2.45/5.8 GHz) with low input power Sara El Mattar; Abdennaceur Baghdad; Sara Said; Elhadi Baghaz
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.24815

Abstract

This paper presents the design of highly efficient rectifiers that can operate at WiFi frequencies (2.45 GHz and 5.8 GHz) and match low input power. The designed dual-band rectifiers use multi-stage dickson voltage multipliers (DVM) (from 1 to 6 stages), and the main idea of this paper is to find the number of stages that offers the best performance and that can be used by applications that operate within the same constraints (operating frequencies, input power). The efficiency and the output voltage (Vout) are the parameters studied to analyze the designed rectifiers. The results showed that as the number of DVM stages increased, the efficiency curves for both frequencies shifted to the higher input power range, even when using the same diode (SMS7630) and the same load (5 KΩ). We concluded that the rectifier with 1-stage DVM is the most suitable to be used for low input power at the selected frequencies since it provides an efficiency of 57.734% at 0 dBm for 2.45 GHz and 36.225% at 1 dBm of input power for 5.8 GHz.
Path discovering in maze area using mobile robot Ibrahim Majid Mohammed; Mustafa Zuhaer Nayef Al-Dabagh; Salar Jamal Rashid; Nor Ashidi Mat Isa
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 20, No 2: April 2022
Publisher : Universitas Ahmad Dahlan

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

Abstract

Robotic maze pathfinding problems deal with detecting the correct route from the start point to the end-point in a virtual maze environment consisting of walls. Automated robot mobility is a significant feature, which enables a mobile robot to traverse a maze independently, from one position to another, without human intervention. There is a myriad of autonomous industrial mobile robot applications, including the transportation of goods and parts, domestic cleaning, indoor security surveillance, airport baggage couriering, and a plethora of other applications to traverse dangerous locations. This paper proposes a pathfinding mobile robot in a virtual maze based on a combination of a simplified left-hand algorithm and a line-following control algorithm. The mobile robot works in any maze to determine a route from the initial starting point to the end-point. The approach outlined in this paper uses a left-hand algorithm to solve the maze problem and a line-follower control algorithm to enable the robot to move in a straight line through the virtual maze. The algorithm used is less complicated and prevents the robot from falling into infinity loops compared to the traditional wall-follower algorithm.
Optimized edge-aware frequency-guided filtering for robust image denoising Iman Elawady; Ahmet Reşit Kavsaoğlu; İsmail Rakıp Karaş
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.27338

Abstract

The problem of denoising intrusion is still of great concern in computational imaging because of the trade-off between noise reduction and image structure and details recovery. This paper proposes an optimized edge-aware fast adaptive guided filter (E-FAGF) combining wavelet-domain decomposition, edge-awareness, and lightweight deep learning for efficient and effective denoising. The biorthogonal wavelet transform is employed to decompose noisy images into low- and high-frequency sub bands and an improved edge-attention map for selective high-frequency denoising. Regularization parameters are estimated pixel-wise by a compact convolutional neural network (CNN), allowing spatial-varying filtering to be done with multi-scale processing. The resultant E-FAGF consistently outperforms the state of the art on this dataset: on BSD500 for speckle and Gaussian noise (peak signal-to-noise ratio (PSNR) of 39.63 dB and 33.97 dB, respectively), and competitive performance for Poisson noise (30.84 dB) a large margin compared to the reference bilateral and non-local means. Our method maintains high structural similarity (up to 0.97 in structural similarity index measure (SSIM)), runs at 0.015 seconds per 512×512 image on graphics processing unit (GPU), and can be applied without dataset specific training. These results suggest the possibility of E-FAGF to achieve a balance between classical efficiency and learning-based adaptability, thereby forming a new scenario to combine fast and reliable image restoration for actual scenarios.
Adoption of tax digitalisation among Malaysian tax practitioners Maheran Zakaria; Wan Noraswaniaty Wan Ahmad; Nuraini Che Hussin; Rabaatul Azira Hassan; Marziana Madah Marzuki; Muhammad Syukur; Eka Nurmala Sari
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.25959

Abstract

The rapid advancement of digitalization has significantly impacted various aspects of accounting professions, particularly in taxation. Tax digitization offers numerous advantages, including streamlining tax processes, reducing administrative burdens, increasing efficiency, and enhancing data security. While tax practitioners in advanced economies have embraced digitalization, their Malaysian counterparts are still in the early stages of transitioning to a modern digital system. This situation has prompted researchers to predict factors that could accelerate the adoption of tax digitalization among Malaysian tax practitioners. Emulating the Unified theory of acceptance and use of technology (UTAUT), this study investigates the adoption of tax digitalization with performance expectancy, effort expectancy, social influence, and facilitating conditions. The researchers distributed 200 questionnaires to Malaysian tax practitioners. However, only 142 proceeded for further analysis. Results from multiple regression using partial least squares structural equation modelling (PLS-SEM) 3 indicate that all variables: effort and performance expectancy, social influence, and facilitating conditions exhibit a significant relationship with tax digitalization adoption. These findings provide valuable insights for policymakers, tax authorities, and professional bodies in developing strategies and initiatives to promote the adoption of tax digitalization among practitioners. Embracing digitalization is crucial for transforming the profession and fostering efficiency, sustainability, and resilience.

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