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 20, No 1: February 2022" : 25 Documents clear
Radial radio number of chess board graph and king’s graph Kulandaivel Maruthamuthu Paramasivam; Kins Yenoke; Baby Smitha Kanaka Muralidharan
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.19493

Abstract

A radial radio labeling ℸ of a connected graph G = (V, E) with radius rad(G) is a mapping from V (G) to N ∪ {0} satisfying |ℸ(u) − ℸ(w)|+ d(u, w) ≥ 1 + rad(G), ∀ u, v ∈ V (G). The span of a radial radio labeling ℸ, denoted by rr(ℸ) is the greatest number in the range of ℸ. The minimum span taken over all radial radio labelings ℸ of G is called the radial radio nmber of G and it is denoted by rr(G). In this article, we have investigated the upper bounds for rr(G) of chess board graphs and king’s graph.
Characteristic's analysis of associative switching system Svetlana A Sadchikova; Mubarak Abdujapparova
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.17640

Abstract

This paper introduced new method and model of telecommunication switching system design which can be applied to wavelength-division multiplexing (WDM) optical networks, circuit-switching networks or virtual channel/path connections in an asynchronous transfer mode (ATM) networks. Modern data switching systems such as electronic private branch exchange (PBX), routers and switches include switching matrix which are constructed in the form of bipartite graphs. In such systems, the issues of requests’ processing are considered from the queuing theory point of view. Associative switching systems are fundamentally new structures, therefore it is necessary to develop adequate methods for their throughput determination. Article covered matters of throughput determination basics of an associative switching system and the obtained formulas used for state probability calculation of switching modules and system throughput.
Investigation of temperature gradient between ambient air and soil to power up wireless sensor network device using a thermoelectric generator Khalil Azha Mohd Annuar; Ramizi Mohamed; Yushaizad Yusof
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.22463

Abstract

This paper proposes a study of an energy harvesting system for powering wireless sensor network (WSN) devices. The thermal energy harvesting system used is based on the thermal energy source between ambient air at the soil surface with five depth levels. Measurement was taken for 46 days in a garden area located in Melaka, Malaysia. A feasibility study of soil temperature measurement to obtain a temperature gradient can be used for harvesting by using thermoelectric generators (TEG) modules. Then, the efficiency of TEG with several different configurations based on temperature gradient data has been tested in the laboratory. The results revealed that the depth of soil 6 cm between sensors 1 and 3 will gave the best representation of level average temperature different around 1 ℃. Based on the temperature gradient data, the combination of three TEG SP1848 in a series connection with DC-DC step-up circuit DC1664 will produce an optimum voltage output of about 3 V. This output voltage is enough to operate low power IoT device derived from thermal energy.
Performance evaluation of ad-hoc on-demand distance vector protocol in highway environment in VANET with MATLAB Osama A. Qasim; Mohammed Sami Noori; Mohand Lokman Ahmad Al Dabag
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.20876

Abstract

Vehicular ad-hoc network (VANET), the development of this network in recent years has become one of the most important areas of research. The primary goal of using the VANET network is to reduce the number of deaths and enhance road safety. VANET network faces some problems when routing packets between vehicles, due to the high-speed movement of vehicles. Therefore, researchers have begun to develop routing protocols in the VANET network to overcome these problems when routing packets between vehicles. In this study, the effect of changing the number of vehicles on the performance of ad-hoc on-demand distance vector (AODV) protocol will be studied in the highway environment and in the case of vehicle movement at variable speeds between (40-120 km/h) and the simulation time is 200 sec. The ad-hoc ondemand distance vector protocol performance was evaluated by three performance measures (end-to-end delay, dropped packets, overhead and packet delivery ratio).
Comparative analysis of various machine learning algorithms for ransomware detection Ban Mohammed Khammas
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.18812

Abstract

Recently, the ransomware attack posed a serious threat that targets a wide range of organizations and individuals for financial gain. So, there is a real need to initiate more innovative methods that are capable of proactively detect and prevent this type of attack. Multiple approaches were innovated to detect attacks using different techniques. One of these techniques is machine learning techniques which provide reasonable results, in most attack detection systems. In the current article, different machine learning techniques are tested to analyze its ability in a detection ransomware attack. The top 1000 features extracted from raw byte with the use of gain ratio as a feature selection method. Three different classifiers (decision tree (J48), random forest, radial basis function (RBF) network) available in Waikato Environment for Knowledge Analysis (WEKA) based machine learning tool are evaluated to achieve significant detection accuracy of ransomware. The result shows that random forest gave the best detection accuracy almost around 98%.
Modeling and characterization of optimal nano-scale channel dimensions for fin field effect transistor based on constituent semiconductor materials Waheb A. Jabbara; Ahmed Mahmood; Jamil Sultan
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.21671

Abstract

This study aims to design an optimal nano-dimensional channel of fin field effect transistor (FinFET) on the basis of electrical characteristics and constituent semiconductor materials (Si, GaAs, Ge, and InAs) to overcome issues regarding the shrinking of dimensions and ensure the best performance of FinFETs. This objective has been achieved by proposing a new scaling factor, K, to simultaneously shrink the physical scaling limits of channel dimensions for various FinFETs without degrading their performance. A simulation-based comprehensive comparative study depending on four variable parameters (length, width, oxide thickness of the channel, and scaling factor) was carried out. The influence of changing channel dimensions on the performance of each type of FinFET was evaluated according to four electrical characteristics: i) ON-state/OFF-state current (ION/IOFF) ratio, ii) subthreshold swing (SS), iii) threshold voltage, and iv) drain-induced barrier lowering. The well-known multi-gate field-effect transistor (MuGFET) simulation tool for nanoscale MuGFET structure was utilized to conduct experimental simulations under the considered conditions. The obtained simulation results showed that the optimal channel dimensions for the best performance of all considered FinFET types were achieved at a minimal scaling factor K=0.125 with 5 nm length, 2.5 nm width, and 0.625 nm oxide thickness of the channel.
Review of microgrid protection strategies: current status and future prospects Zaid Alhadrawi; Mohd Noor Abdullah; Hazlie Mokhlis
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.19652

Abstract

A microgrid is a developed form of a distribution system, which is integrated with a set of different types of distributed generation (DG) to supply local demand. In spite of that microgrids have many advantages as they increase reliability, raise efficiency, decrease feeder losses and voltage sag correction. However, there are many technical challenges faced, one of them is the protection of microgrid. Conventional protections have been made for radial distribution systems configuration. Where supplying source has one direction and the power flow is defined. The DG penetration converts the distribution network to a multi sources system causes a bidirectional power flow. Also, the most of DG uses a DC to AC converter which limit the fault current level. Therefore, a suitable protection scheme for microgrid ought to be designed to protect a microgrid from any disturbances may occur for both modes of operation grid-connected and islanded. The purpose of this paper is to summarize the challenges and problems facing microgrid protection. As well as the most strategies to date are presented with a discussion of their basic principles of operation to solve these problems. Finally, some conclusions and suggestions for microgrid protection in the future are presented.
Enhancement detection distributed denial of service attacks using hybrid n-gram techniques Andi Maslan; Kamaruddin Malik Mohamad; Cik Feresa Mohd Foozy
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.18103

Abstract

Distributed denial of service (DDoS) attacks have always been a concern of cyber experts. To detect DDoS attacks, several methods can be used. One of the methods used in this research is the n-gram technique. The n-gram approach analyzes the payload of data packets that enter the network to obtain attack patterns. Data is captured and analyzed, after which it is compared with clean data packets. The chi-square distance value close to 1 indicates that the two packages are very similar so that the data packet is not an attack. A deal less than one means the data packet is categorized as an attack. In this research, the threshold for determining the attack level can be lowered to obtain a very high detection accuracy. As a result, the 2-gram technique has a detection accuracy rate with the lowest false positive value of around 13%, with the highest actual positive ratio reaching 99.98%.
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.
Extending lifetime of heterogeneous wireless sensor networks using spider monkey optimization routing protocol Imad S. Alshawi; Zainab Ali Abbood; Asaad A. Alhijaj
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.20984

Abstract

The nodes of wireless sensor networks (WSN) are severely restricted in terms of computing capabilities, limited communications, and limited power supplies, as it is difficult or impossible to replace or recharge the sensor battery. Consequently, the energy of nodes is one of the most important resources to consider when designing of WSNs. So, most of the routing protocols in WSNs are to assure the saving of energy as a significant aim for improvement. Nevertheless, just providing power is not sufficient to extend the lifetime of WSN. Where unbalance energy depletion in WSNs is a challenging issue often leading to splits the network and reduces its lifetime, also retrogression of its performance. This paper, therefore, uses a powerful routing protocol named spider monkey optimization routing protocol (SMORP) to generate an optimal data routing of the pathway for heterogeneous WSNs (HWSNs). SMORP, here, can compute the best way from a sensor to the sink through the cluster head, inside the intra-cluster, and the inter-cluster respectively. For this purpose and the organization of heterogeneous nodes, this paper uses the clustering partition. The simulation results revealed that SMORP significantly improves in terms of data latency reduction, stabilizing depletion of energy, and maximizing the network lifetime for HWSNs.

Page 2 of 3 | Total Record : 25

 1   2   3 

Filter by Year

2022 2022


Reset
Filter By Issues
All Issue 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