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 25 Documents
 1   2   3 
Search results for , issue "vol 21, no 5: october 2023" : 25 Documents clear
Reagentless iron detection in water based on unclad fiber optical sensor Nurul Atika Nabila Jaharudin; Noran Azizan Cholan; Nurfatihah Che Abd Rashid; Nazrah Ilyana Sulaiman; Kim Gaik Tay; Nor Hafizah Ngajikin
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.24775

Abstract

A simple and low-cost fiber based optical sensor for iron detection is demonstrated in this paper. The sensor head consist of an unclad optical fiber with the unclad length of 1 cm and it has a straight structure. Results obtained shows a linear relationship between the output light intensity and iron concentration, illustrating the functionality of this iron optical sensor. Based on the experimental results, the sensitivity and linearity are achieved at 0.0328/ppm and 0.9824 respectively at the wavelength of 690 nm. With the same wavelength, other performance parameters are also studied. Resolution and limit of detection (LOD) are found to be 0.3049 ppm and 0.0755 ppm correspondingly. This iron sensor is advantageous in that it does not require any reagent for detection, enabling it to be simpler and cost-effective in the implementation of the iron sensing.
Implementation of FinFET technology based low power 4×4 Wallace tree multiplier using hybrid full adder Shikha Singh; Yagnesh B. Shukla
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.24304

Abstract

Many systems, including digital signal processors, finite impulse response (FIR) filters, application-specific integrated circuits, and microprocessors, use multipliers. The demand for low power multipliers is gradually rising day by day in the current technological trend. In this study, we describe a 4×4 Wallace multiplier based on a carry select adder (CSA) that uses less power and has a better power delay product than existing multipliers. HSPICE tool at 16 nm technology is used to simulate the results. In comparison to the traditional CSA-based multiplier, which has a power consumption of 1.7 µW and power delay product (PDP) of 57.3 fJ, the results demonstrate that the Wallace multiplier design employing CSA with first zero finding logic (FZF) logic has the lowest power consumption of 1.4 µW and PDP of 27.5 fJ.
Design and simulation an optimal enhanced PI controller for congestion avoidance in TCP/AQM system Yousra Abd Mohammed; Layla H. Abood; Nahida Naji Kadhim
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.24872

Abstract

In this paper, snake optimization algorithm (SOA) is used to find the optimal gains of an enhanced controller for controlling congestion problem in computer networks. M-file and Simulink platform is adopted to evaluate the response of the active queue management (AQM) system, a comparison with two classical controllers is done, all tuned gains of controllers are obtained using SOA method and the fitness function chose to monitor the system performance is the integral time absolute error (ITAE). Transient analysis and robust analysis is used to show the proposed controller performance, two robustness tests are applied to the AQM system, one is done by varying the size of queue value in different period and the other test is done by changing the number of transmission control protocol (TCP) sessions with a value of ± 20% from its original value. The simulation results reflect a stable and robust behavior and best performance is appeared clearly to achieve the desired queue size without any noise or any transmission problems.
Wavelet-based sensing technique in cognitive radio network Mas Haslinda Mohamad; Nurusolihah Zamri; Nor Khairiah Ibrahim
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.24678

Abstract

Cognitive radio is a smart radio that can change its transmitter parameter based on interaction with the environment in which it operates. The demand for frequency spectrum is growing due to a big data issue as many Internet of Things (IoT) devices are in the network. Based on previous research, most frequency spectrum was used, but some spectrums were not used, called spectrum hole. Energy detection is one of the spectrum sensing methods that has been frequently used since it is easy to use and does not require license users to have any prior signal understanding. But this technique is incapable of detecting at low signal-to-noise ratio (SNR) levels. Therefore, the wavelet-based sensing is proposed to overcome this issue and detect spectrum holes. The main objective of this work is to evaluate the performance of wavelet-based sensing and compare it with the energy detection technique. The findings show that the percentage of detection in wavelet-based sensing is 83% higher than energy detection performance. This result indicates that the wavelet-based sensing has higher precision in detection and the interference towards primary user can be decreased.
Adaptive segmentation algorithm based on level set model in medical imaging Boualem Mansouri; Abdelkader Khobzaoui; Mehdi Damou; Mohammed Chetioui; Abdelhakim Boudkhil
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.22365

Abstract

For image segmentation, level set models are frequently employed. It offer best solution to overcome the main limitations of deformable parametric models. However, the challenge when applying those models in medical images stills deal with removing blurs in image edges which directly affects the edge indicator function, leads to not adaptively segmenting images and causes a wrong analysis of pathologies wich prevents to conclude a correct diagnosis. To overcome such issues, an effective process is suggested by simultaneously modelling and solving systems’ two-dimensional partial differential equations (PDE). The first PDE equation allows restoration using Euler’s equation similar to an anisotropic smoothing based on a regularized Perona and Malik filter that eliminates noise while preserving edge information in accordance with detected contours in the second equation that segments the image based on the first equation solutions. This approach allows developing a new algorithm which overcome the studied model drawbacks. Results of the proposed method give clear segments that can be applied to any application. Experiments on many medical images in particular blurry images with high information losses, demonstrate that the developed approach produces superior segmentation results in terms of quantity and quality compared to other models already presented in previeous works.
Fault-tolerant backup storage system for confidential data in distributed servers Olzhas Tasmagambetov; Yerzhan Seitkulov; Ruslan Ospanov; Banu Yergaliyeva
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.25305

Abstract

This article addresses the critical issue of securing backup storage for confidential data, a key concern in safeguarding the operations of critical information systems dealing with extensive amounts of sensitive information. The study proposes a novel cryptographic fault-tolerant backup storage system for confidential data, leveraging cryptographic algorithms and protocols. These protocols enable message encryption, ensuring decryption is only possible after a specified time period. The proposed system combines various distributed key generation protocols, proactive secret sharing protocols, asymmetric encryption algorithms, and digital signature algorithms. By employing such cryptographic protocols, it becomes feasible to develop and implement a robust, fault-tolerant service for backing up confidential data.
Design, simulation, and analysis of microstrip patch antenna for wireless applications operating at 3.6 GHz Md. Sohel Rana; Tahasin Ahmed Fahim; Shuvashis Biswas Rana; Russel Mahbub; Md. Mostafizur Rahman
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.24813

Abstract

In this study, a microstrip patch antenna that works at 3.6 GHz was built and tested to see how well it works. In this work, Rogers RT/Duroid 5880 has been used as the substrate material, with a dielectric permittivity of 2.2 and a thickness of 0.3451 mm; it serves as the base for the examined antenna. The computer simulation technology (CST) studio suite is utilized to show the recommended antenna design. The goal of this study was to get a more extensive transmission capacity, a lower voltage standing wave ratio (VSWR), and a lower return loss, but the main goal was to get a higher gain, directivity, and efficiency. After simulation, the return loss, gain, directivity, bandwidth, and efficiency of the supplied antenna are found to be -17.626 dB, 9.671 dBi, 9.924 dBi, 0.2 GHz, and 97.45%, respectively. Besides, the recreation uncovered that the transfer speed side-lobe level at phi was much better than those of the earlier works, at -28.8 dB, respectively. Thus, it makes a solid contender for remote innovation and more robust communication.
Efficient combined fuzzy logic and LMS algorithm for smart antenna Mohammed Hussein Miry; Ali Hussien Mary
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.24370

Abstract

The smart antennas are broadly used in wireless communication. The least mean square (LMS) algorithm is a procedure that is concerned in controlling the smart antenna pattern to accommodate specified requirements such as steering the beam toward the desired signal, in addition to placing the deep nulls in the direction of unwanted signals. The conventional LMS (C-LMS) has some drawbacks like slow convergence speed besides high steady state fluctuation error. To overcome these shortcomings, the present paper adopts an adaptive fuzzy control step size least mean square (FC-LMS) algorithm to adjust its step size. Computer simulation outcomes illustrate that the given model has fast convergence rate as well as low mean square error steady state.
Big data cloud-based recommendation system using NLP techniques with machine and deep learning Hoger K. Omar; Mondher Frikha; Alaa Khalil Jumaa
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.24889

Abstract

Recommendation systems (RS) are crucial for social networking sites. Without it, finding precise products is harder. However, existing systems lack adequate efficiency, especially with big data. This paper presents a prototype cloud-based recommendation system for processing big data. The proposed work is implemented by utilizing the matrix factorization method with three approaches. In the first approach, singular value decomposition (SVD) is used, which is an old and traditional recommendation technique. The second recommendation approach is fine-tuned using the alternating least squares (ALS) algorithm with Apache Spark. Finally, the deep neural network (DNN) algorithm is utilized with TensorFlow. This study solves the challenge of handling large-scale datasets in the collaborative filtering (CF) technique after tuning the algorithms by adjusting the parameters in the second approach, which uses machine learning, as well as in the third approach, which uses deep learning. Furthermore, the results of these two approaches outperformed conventional techniques and achieved an acceptable computational time. The dataset size is about 1.5 GB and it is collected from the Goodreads website API. Moreover, the Hadoop distributed file system (HDFS) is used as cloud storage instead of the computer’s local disk for handling larger dataset sizes in the future.
Blockchain-IoT supply chain: systematic literature review Umi Nabilah Badrol Said; Mohd Rizuan Baharon; Mohd Zaki Mas’ud; Ariff Idris; Noor Azurati Ahmad Salleh
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.24699

Abstract

Since 2016, the implementation of blockchain in the supply chain has attracted wide interest among researchers. The creation and study of blockchain technology have grown at an exponential rate in the last decade. The supply chain would be a massive technological leap with the combination of blockchain technology that brings major changes to different facets of the industry, such as record immutability, improved traceability, quality assurance, improved knowledge flows, decentralized power structure, and decreased chances of fraud. With the growth in blockchain Internet-of-Thing (IoT) supply chain technologies, the security risk of implementing such technologies and methods to counter it has been largely discussed among researchers. This study analyses peer-reviewed literature attempting to use authentication in the blockchain-IoT supply chain to counter security risks in the technologies and provides a comprehensive analysis of the important feature when creating an authentication technique for the blockchain-IoT supply chain. Finally, the study discusses some of the problems and research objectives in the realm of authentication in the blockchain-IoT supply chain.

Page 1 of 3 | Total Record : 25

 1   2   3 

Filter by Year

2023 2023


Reset
Filter By Issues
All Issue Vol 24, No 5: October 2026 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