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 45 Documents
 1   2   3   4   5 
Search results for , issue "Vol 13, No 4: December 2015" : 45 Documents clear
Routing Algorithm Based on Area Division Management of Node in Wireless Sensor Networks Gao Wei; Song Yan; Shuping Fan
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 4: December 2015
Publisher : Universitas Ahmad Dahlan

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

Abstract

In order to reduce the communication overhead among sensor nodes, a routing algorithm is proposed based on zoning management nodes. The algorithm defines the calculation method of the network partition radius after nodes deployment, and divides monitored area according to the radius meanwhile layouts one management node in each partition. Then nodes’ communication cost is calculated based on the distance among nodes as well as nodes’ energy, and finishes the selection of routing nodes based on the cost. Finally, using the Matlab simulation environment, the parameters impacting the optimal partition radius are discussed, and the proposed routing algorithm is compared with existing algorithms. Theoretical analysis and experimental results show that the proposed algorithm is more balanced on nodes energy consumption. The algorithm reduces network traffic overhead while extends the lifetime of the network.
Fundamental Review to Ozone Gas Sensing Using Optical Fibre Sensors Michael David; Mohd Haniff Ibrahim; Sevia Mahdaliza Idrus; Tay Ching En Marcus
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 4: December 2015
Publisher : Universitas Ahmad Dahlan

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

Abstract

The manuscript is a review of basic essentials to ozone gas sensing with optical methods. Optical methods are employed to monitor optical absorption, emission, reflectance and scattering of gas samples at specific wavelengths of light spectrum. In the light of their importance in numerous disciplines in analytical sciences, necessary integral information that serves both as a basis and reference material for intending researchers and others in the field is inevitable. This review provides insight into necessary essentials to gas sensing with optical fibre sensors. Ozone gas is chosen as a reference gas. Simulation results for ozone gas absorption cross section in the ultraviolet (UV) region of the spectrum using spectralcalc.com simulation have also been included.
Image Encryption using Simple Algorithm on FPGA Barlian Henryranu Prasetio; Eko Setiawan; Adharul Muttaqin
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 4: December 2015
Publisher : Universitas Ahmad Dahlan

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

Abstract

Data security becomes one of the things that need to be considered. The Sum of Product (SOP) Encryption is one of simple algorithm. The SOP encryption is not a public-key system to encrypt data. it is almost unbreakable through brute force method and vulnerable to attack because the encryption models have a fixed pattern. However, this drawback can be avoided through the compression process to remove the pattern file. SOP encryption algorithm can use a Boolean algebra combination functions such as AND gate and OR gate. Simple algorithm in hardware language VHSIC Hardware Description Language (VHDL) is on data bits level. The purpose of this research is implementation of image encryption algorithm to produce a quick image encryption system. From result test, the image processing time without encryption average 4.999ns/px and 13.51ns/px with encryption.
Modelling on Tracking Test Condition of Polymer Nanocomposite using Finite Element Simulation Fatin Liyana Muhamedin; M. A. M. Piah; Nordiana Azlin Othman
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 4: December 2015
Publisher : Universitas Ahmad Dahlan

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

Abstract

Electrical tracking is a formation process of a permanent conducting path across the insulating material due to surface erosion under high voltage stress. The existing of leakage current (LC) on the wet contaminated material surface causes the generation of surface discharges that resulted in the material degradation. The effects of electric field distribution and current density on LLDPE-Natural Rubber blends material were investigated using finite element method (FEM) analysis. In this paper, a variety of physical parameters particularly contaminant flow rate, various applied voltages, material properties of permittivity and conductivity were studied when nanofiller is added to LLDPE-Natural rubber blend. The simulation works using FEM software of Quickfield was applied to the tracking test condition of IEC 60587 standard.  The results show that the electric field distributions are critical on the edges of contaminant solution path at higher voltage level. The current density and electric field distribution is increase with higher applied voltage. The polymer nanocomposite with 1-5 % of nanofiller exhibits a good resistance to tracking and erosion test.
Image Restoration Based on Hybrid Ant Colony Algorithm Yan Feng; Hua Lu; Xiliang Zeng
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 4: December 2015
Publisher : Universitas Ahmad Dahlan

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

Abstract

Image restoration is the process to eliminate or reduce the image quality degradation in the digital image formation, transmission and recording and its purpose is to process the observed degraded image to make the restored result approximate the un-degraded original image. This paper, based on the basic ant colony algorithm and integrating with the genetic algorithm, proposes an image restoration processing method based on hybrid ant colony algorithm. This method transforms the optimal population information of genetic algorithm into the original pheromone concentration matrix of ant colony algorithm and uses it to compute the parameters of degradation function so as to get a precise estimate of the original image. By analyzing and comparing the restoration results, the method of this paper can not only overcome the influence of noises, but it can also make the image smoother with no fringe effects in the edges and excellent visual effects, verifying its practicability.
Transmission of Real-time Video Signal with Interference Density and Human Traffic Rizal Broer Bahaweres; Oki Teguh Karya; Mudrik Alaydrus
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 4: December 2015
Publisher : Universitas Ahmad Dahlan

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

Abstract

The use of mobile phone as a communication tool so rapidly increase, as well as various types of functions therein. Among of the many applications on the mobile phone, which are used skype android-based for teleconferencing via mobile phone. Things can not be separated from these applications is the need of qualified internet network access for these applications can be felt up function. One of the network access to the Internet is widely used today's society is a wi-fi network. Access to the Internet does not always provide the best performance, this is due to many factors, one of which is the presence of interference. In this study, we tested transmission of video signals in real-time using an application skype on the mobile phone. Skype run on wi-fi network, which is influenced by the presence of interference or objects such as human traffic in the network. Wireshark were used to obtain data reliability wi-fi network, known as QoS. While evalvid used to obtain the data QoE restricted only get the data PSNR (Peak Signal To Noise Ratio) and MSE (Mean Square Error).
Alternative Technique reducing complexity of Maximum Attribute Relation Iwan Tri Riyadi Yanto; Imam Azhari
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 4: December 2015
Publisher : Universitas Ahmad Dahlan

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

Abstract

Clustering refers to the method grouping the large data into the smaller groups based on the similarity measure. Clustering techniques have been applied on numerical, categorical and mix data. One of the categorical data clustering technique based on the soft set theory is Maximum Attribute Relation (MAR). The MAR technique allows calculating all of pair multi soft set made. However, the computational complexity is still an issue of the technique. To overcome the drawback, the paper proposes the alternative algorithm to decrease the complexity so get the faster response time. In this paper, to get the similar results as MAR without calculating all pair of soft set is proved. The alternative algorithm is implemented in MATLAB Software, and then experimental is run on the 10 benchmark datasets. The results show that the alternative algorithm improves the computational complexity in term of response time up to 36.46%
Computing Game and Learning State in Serious Game for Learning Ririn Dwi Agustin; Ayu Purwarianti; Kridanto Surendro; Iping S Suwardi
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 4: December 2015
Publisher : Universitas Ahmad Dahlan

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

Abstract

In order to support the adaptive SGfL, teaching materials must be represented in game component that becomes the target of adaptivity. If adaptive architecture of the game only use game state (GS) to recognize player's state, SGfL require another indicator -learning state (LS)- to identify the learning progress. It is a necessary to formulate computational framework for both states in SGfL.The computational framework was divided into two moduls, macro-strategy and micro-strategy. Macro-strategy control the learning path based on learning map in AND-OR Graph data stucture. This paper focus on the Macro-strategy modul, that using online, direct, and centralized adaptivity method. The adaptivity in game has five components as its target. Based on those targets, eight development models of SGfL concept was enumerated. With similarity and difference analysis toward possibility of united LS and GS in computational framework to implement the nine SGfL concept into design and application, there are three groups of the development models i.e. (1) better united GS and LS, (2) must manage LS and GS as different entity, and (3) can choose whether to be united or not. In the model which is united LS with GS, computing model at the macro-strategy modul use and-or graph and forward chaining. However, in the opposite case, macro-strategy requires two intelligent computing solutions, those are and-or graph with forward chaining to manage LS collaborated with Finite State Automata to manage GS. The proposed computational framework of SGfL was resulted from the similarity and difference analysis toward all possible representations of teaching materials into the adaptive components of the game. It was not dependent of type of learning domain and also of the game genre.
Enhancement the Performance of OFDM based on Multiwavelets Using Turbo Codes Sameer A. Dawood; F. Malek; M. S. Anuar; HA Rahim
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 4: December 2015
Publisher : Universitas Ahmad Dahlan

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

Abstract

In wireless communication systems, the main challenge is to provide a high data rate and reliable transmission over a frequency selective fading channel. Orthogonal Frequency Division Multiplexing (OFDM) is a very attractive technique for high data rate transmission with better bandwidth efficiency. In this paper, the effectiveness of turbo codes is utilized to develop a new approach for an OFDM system based on a Discrete Multiwavelet Critical-Sampling Transform (OFDM-DMWCST). The use of turbo coding in an OFDM-DMWCST system is useful in providing the desired performance at higher data rates. Two types of turbo codes were used in this work, i.e., Parallel Concatenated Convolutional Codes (PCCCs) and Serial Concatenated Convolutional Codes (SCCCs). In both types, the decoding is performed by the iterative decoding algorithm based on the log-MAP (Maximum A Posteriori) algorithm. The simulationresults showed that, the turbo-coded OFDM-DMWCST system achieves large coding gain with lower Bit-Error-Rate (BER), therefore, offering a higher data rate under different channel conditions. In addition, thePCCCs offer better performance than SCCCs.
Energy-efficient Routing Model Based on Vector Field Theory for Large-scale Wireless Sensor Networks Ming Li; Huanyan Qian; Min Xu
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 13, No 4: December 2015
Publisher : Universitas Ahmad Dahlan

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

Abstract

Routing design is a key issue for large-scale wireless sensor networks (WSNs). Energy consumption associated with allocated resources should be considered. This paper proposes the integration of an energy-efficient model, which is based on vector field theory, in large-scale WSNs. Source nodes in WSNs have the characteristics of source points in a vector field, whereas sink nodes could be characterized as gathering points. Our scheme demonstrates that we can solve a set of partial differential equations in electrostatic theory to determine the routes that result in energy efficiency. Thus, the routing problem in WSN for energy efficiency becomes a typical PDE solution. Our simulation results show significant improvement in energy consumption. Compared with the traditional shortest path approach, the proposed model shows considerable improvement in the lifetime of the network.

Page 3 of 5 | Total Record : 45

 1   2   3   4   5 

Filter by Year

2015 2015


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