cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
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)
Published by Universitas Ahmad Dahlan
ISSN : 16936930     EISSN : 23029293     DOI : 10.12928
Core Subject : Science,
Computer Science & IT
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)
Arjuna Subject : Ilmu Komputer (semua kategori) - Aplikasi Ilmu Komputer
Articles 3,452 Documents
 340   341   342   343   344 
Improving the detection of intrusion in vehicular ad-hoc networks with modified identity-based cryptosystem Zachaeus K. Adeyemo; Emmanuel B. Ajulo; Damilare O Akande; Hammed O. Lasisi; Samson I. Ojo
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 21, No 5: October 2023
Publisher : Universitas Ahmad Dahlan

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

Abstract

Vehicular ad-hoc networks (VANETs) are wireless-equipped vehicles that form networks along the road. The security of this network has been a major challenge. The identity-based cryptosystem (IBC) previously used to secure the networks suffers from membership authentication security features. This paper focuses on improving the detection of intruders in VANETs with a modified identity-based cryptosystem (MIBC). The MIBC is developed using a non-singular elliptic curve with Lagrange interpolation. The public key of vehicles and roadside units on the network are derived from number plates and location identification numbers, respectively. Pseudo-identities are used to mask the real identity of users to preserve their privacy. The membership authentication mechanism ensures that only valid and authenticated members of the network are allowed to join the network. The performance of the MIBC is evaluated using intrusion detection ratio (IDR) and computation time (CT) and then validated with the existing IBC. The result obtained shows that the MIBC recorded an IDR of 99.3% against 94.3% obtained for the existing identity-based cryptosystem (EIBC) for 140 unregistered vehicles attempting to intrude on the network. The MIBC shows lower CT values of 1.17 ms against 1.70 ms for EIBC. The MIBC can be used to improve the security of VANETs.
Machine learning-based approaches for tomato pest classification Gayatri Pattnaik; Kodimala Parvathy
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.19740

Abstract

Insect pests are posing a significant threat to agricultural production. They live in different places like fruits, vegetables, flowers, and grains. It impacts plant growth and causes damage to crop yields. We presented an automatic detection and classification of tomato pests using image processing with machine learning-based approaches. In our work, we considered texture features of pest images extracted by feature extraction algorithms like gray level co-occurrence matrix (GLCM), local binary pattern (LBP), histogram of oriented gradient (HOG), and speeded up robust features (SURF). The three standard classification methods, including support vector machine (SVM), k-nearest neighbour (k-NN), and decision tree (DT) are used for classification operation. The three classifiers have undergone a comprehensive analysis to present which classifier with which feature yields the best accuracy. The experiment results showed that the SVM classifier's precision using the feature extracted by local binary patterns (LBP) algorithm achieves the highest value of 81.02%. MATLAB software used for feature extraction and waikato environment for knowledge analysis (WEKA) graphical user interface for classification.
Advancements in physical layer key generation: a review on channel reciprocity and IoT security techniques Syed Shafaq Ali Shah; Ajab Noor; Ruiyue Liang; Rahmat Ullah Zadran
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.27340

Abstract

With the burgeoning internet of things (IoT), securing communication becomes paramount. Traditional cryptography does not meet computational needs and brute-force attacks. This review explores the state-of-the-art physical layer secret key generation (PLKG) that takes advantage of the inherent reciprocity and randomness of wireless channels. We investigate cutting-edge techniques such as feature extraction networks, domain adversarial training, and deep learning-based approaches, evaluating their effects on the security and efficiency of key generation. In addition to these methods, the review addresses real-world challenges such as multi-user scenarios, reconciliation overhead, and inconsistent channel measurement. We believe that improved key generation rates and security can be achieved through the use of millimeter wave technology and full-duplex communication. To strengthen the robustness of key generation, the paper concludes by suggesting future directions, such as incorporating more random sources, such as physiological signals and sensor data. This comprehensive overview offers deep insights into the state-of-the-art and paves the way for reliable communication in ever more complicated IoT settings.
Design monopole antenna of ultra-wideband high bandwidth and high efficiency for ground penetrating radar application Fatehi ALtalqi; Sara Fennane; Hamza Mabchour; Houda Kacimi; Adil Echchelh
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 22, No 4: August 2024
Publisher : Universitas Ahmad Dahlan

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

Abstract

Over the past years, remote sensing, radar, and imaging applications have all made use of ultra-wideband (UWB) technology. This study undertakes an extensive analysis of tree-shaped monopole antennas tailored for UWB systems. The intended antenna has an incomplete ground plane and a circular radiating patch. To increase bandwidth, two ears have been added to the circular structure. Possessing a dielectric constant of 4.3. The antenna substrate consists of FR-4 material with a dielectric constant of 4.3. To achieve optimal impedance matching for UWB systems, the antenna is fed via a coplanar waveguide (CPW). Design antenna is a simple structure, small size, easy design, and simple integration with the substrate with dimensions of 54 mm ×36 mm ×1.6 mm. All simulation results presented in this article were generated using computer simulation technology (CST) software. He monopole antenna exhibits an impressive impedance bandwidth of 9.6 GHz (146.68%), spanning from 1.99 GHz to 11.56 GHz. Furthermore, the simulated UWB circular monopole antenna exhibits omnidirectional radiation characteristics, boasting a peak gain of 8 dB, and a directivity of 8.2 dBi at the frequency of 5 GHz, and a remarkable radiation efficiency of 97%. With these attributes, the suggested monopole UWB antenna shows significant potential for ground penetrating radar (GPR) applications.
Energy-aware wireless mesh network deployment using optimization mechanism Aphirak Jansang; Chayathorn Simasathien; Anan Phonphoem
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 21, No 1: February 2023
Publisher : Universitas Ahmad Dahlan

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

Abstract

Wireless mesh networks are widely used to create network infrastructure in rural areas due to their flexible properties, such as self-healing mechanisms and associated redundant paths. For example, a wireless mesh network can suitably operate with limited battery power in wildlife monitoring applications. The locations of mobile routers to support mobile sensor nodes are essential for extending the system lifetime. This study proposes an energy-aware wireless mesh network deployment optimization mechanism. The goal is to determine a suitable location for the mesh routers with the aim of maximizing network lifetime. After the location solution is obtained from the proposed mechanism, it is then evaluated for system lifetime and network performance by the network simulator (ns-3). The proposed method outperforms the brute-force method in terms of computation time for all amounts of mesh clients. For example, for 30 mesh clients, the proposed method uses only a few minutes, while the brute-force mechanism requires more than 200 minutes to complete the process. Furthermore, compared to the brute-force method, it achieves nearly the same system lifetime and other performance parameters, such as throughput, packet delivery ratio, and packet inter-arrival time. In the real implementation, in which the sensor node placements can be changed during the installation period owing to the environmental status or the recommendation of the installers, the results can be recalculated in a short period.
Graphene-based THz antenna with a wide bandwidth for future 6G short-range communication Md. Kawsar Ahmed; Md. Sharif Ahammed; Md. Ashraful Haque; Narinderjit Singh Sawaran Singh; Jamal Hossain Nirob; Redwan A. Ananta; Kamal Hossain Nahin; Liton Chandra Paul
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 23, No 2: April 2025
Publisher : Universitas Ahmad Dahlan

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

Abstract

In this study, we present the design and investigation of a terahertz (THz) frequency antenna optimized for the 2-10 THz range, featuring both single-element and multiple-input multiple-output (MIMO) configurations, with a focus on industrial and innovative applications to enhance future 6G communication systems. The antenna, constructed on a polyimide substrate with dimensions of 90×30 µm, achieves a bandwidth from 4.0328 to 10 THz. The MIMO configuration, which includes two ports, demonstrates excellent isolation with a value of -27 dB. The proposed antenna system achieves a gain of 12.38 dB and an efficiency of 89%, making it highly appropriate for THz communication applications. Furthermore, the envelope correlation coefficient (ECC) of 0.002 and diversity gain (DG) of 9.99 affirm the antenna’s effectiveness in MIMO systems. A resistance inductance capacitance (RLC) circuit model was employed to accurately represent the S11 curve, ensuring precise characterization of the antenna’s performance. These results underscore the probability of the proposed antenna for high-speed, short-range communication systems.
H-infinity controller with graphical LMI region profile for liquid slosh suppression Mohd Zaidi Mohd Tumari; A. Shamsul Rahimi A. Subki; Mohd Shahrieel Mohd Aras; Mohammad 'Afif Kasno; Mohd Ashraf Ahmad; Mohd Helmi Suid
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 17, No 5: October 2019
Publisher : Universitas Ahmad Dahlan

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

Abstract

This paper presents a H-infinity synthesis with pole clustering based on LMI region schemes for liquid slosh control. Using LMI approach, the regional pole placement known as LMI region combined with design objective in H-infinity controller guarantee a fast input tracking capability and very minimal liquid slosh. A graphical profile of the transient response of liquid slosh suppression system with respect to pole placement is very useful in giving more flexibility to the researcher in choosing a specific LMI region. With the purpose to confirm the design of control scheme, a liquid slosh model is considered to represent the lateral slosh movement. Supremacy of the proposed approach is shown by comparing the results with hybrid model-free fuzzy-PID controller with derivative filter. The performance of the control schemes is examined in terms of time response specifications of lateral tank tracking capability and level of liquid slosh reduction.
Geographical and maximum distance on-demand routing algorithm G-MDORA Dania Mohammed; Muhamad Mansor; Goh Chin Hock
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 21, No 6: December 2023
Publisher : Universitas Ahmad Dahlan

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

Abstract

A vehicular ad hoc network (VANET) is an intelligent technology that allows efficient communication, secure data transmission, and traffic management. VANET allows vehicles in the network to communicate wirelessly with roadside units (RSUs) or between vehicles within a coverage area. The primary goal of adopting VANET is to reduce the frequency of accidents in specific urban regions drastically. It has a significant impact on passenger safety and the ability of drivers to drive safely in metropolitan areas. As the number of cars on the road grows, so does the number of accidents. As a result, a better traffic system is required to address this issue. VANET is a cutting-edge network that primarily delivers intelligent transportation system (ITS) services to end-users to facilitate data exchange and ensure safety. In this paper, we propose geographical and maximum distance on-demand routing algorithm (G-MDORA) that combines the advantages of geographic routing protocol (GRP) and MDORA protocol for Ad hoc routing between vehicle to vehicle (V2V). Our proposed model provides an idea that can be used to improve the performance of the GRP and MDORA protocol. Moreover, the performance of the G-MDORA, GRP, and MDORA protocol was compared in terms of end-to-end delay, communication overhead, throughput, and packet loss ratio.
Hiding health report in X-ray images to protect people privacy Enas Ali Jameel; Sameera Abbas Fadhel
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 20, No 3: June 2022
Publisher : Universitas Ahmad Dahlan

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

Abstract

X-rays images are a popular medical diagnoses method. These images are hard to read and to be understandable outside the medical community. However, the radiologist writes a report of the X-ray. This report can be understandable easily which, can impact the privacy of the patients’ medical records. To tackle this issue, in this work, X-ray image steganography algorithm based on Sudoku mathematical game is proposed. The method converts the image into triangular shaped blocks. Subsequently, the data is encoded and segmented two bits at the time to be embedded in the image. To evaluate the algorithm, eight different X-ray images from all X-ray types have been utilized for data hiding process. The algorithm has been compared to the lest significant bit (LSB) and the turtle shell algorithms using the mean square error (MSE) and peak signal to noise ratio (PSNR) performance metric. The proposed algorithm obtained higher bit per pixel embedding capacity with 2 bpp which is higher than LSB and turtle shell. Moreover, the algorithm has higher PSNR compared to turtle shell algorithm.
Application of the traveling salesman problem to optimize skeletonization and stroke reconstruction Alifah Alifah; Dian Andriana; Muhammad Zulhaj Aliansyah; Lukman Hakim; Kholid Murtadlo
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 24, No 2: April 2026
Publisher : Universitas Ahmad Dahlan

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

Abstract

The preservation of Turots Nusantara manuscripts written in Pegon script faces significant challenges due to physical deterioration and the complexity of handwritten styles. This study proposes a novel digitization approach based on image processing to extract and reconstruct handwriting strokes by combining skeletonization and the travelling salesman problem (TSP) algorithm. The novelty of this research lies in the application of a modified Greedy TSP algorithm capable of recognizing branching and cyclic structures typical of Arabic–Pegon characters, enabling accurate reconstruction of handwritten stroke sequences. The process involves preprocessing (grayscale, thresholding, and morphological operations), skeleton extraction using a thinning method, and weighted graph construction based on Euclidean distance between skeleton points. The proposed system achieved an average precision of 0.552, recall of 0.815, F1-score of 0.657, and accuracy of 0.82. These results demonstrate the method’s effectiveness in detecting and reconstructing character shapes from Pegon manuscripts. Practically, this approach offers potential applications in the automatic digitization, preservation, and analysis of Pegon script, contributing to the conservation of Indonesia’s Islamic intellectual and cultural heritage.

Page 342 of 346 | Total Record : 3452

 340   341   342   343   344 

Filter by Year

2004 2026


Reset
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