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 47 Documents
 1   2   3   4   5 
Search results for , issue "Vol 14, No 1: March 2016" : 47 Documents clear
Robust Localization Algorithm Based on Best Length Optimization for Wireless Sensor Networks Hua Wu; Guangyuan Zhang; Yang Liu; Xiaoming Wu; Bo Zhang
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 1: March 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

In this paper, a robust range-free localization algorithm by realizing best hop length optimization is proposed for node localization problem in wireless sensor networks (WSNs). This algorithm is derived from classic DV-Hop method but the critical hop length between any relay nodes is accurately computed and refined in space WSNs with arbitrary network connectivity. In case of network parameters hop length between nodes can be derived without complicated computation and further optimized using Kalman filtering in which guarantees robustness even in complicated environment with random node communication range. Especially sensor fusion techniques used has well gained robustness, accuracy, scalability, and power efficiency even without accurate distance or angle measurement which is more suitable in nonlinear conditions and power limited WSNs environment. Simulation results indicate it gained high accuracy compared with DV-Hop and Centroid methods in random communication range conditions which proves it gives characteristic of high robustness. Also it needs relatively little computation time which possesses high efficiency. It can well solve localization problem with many unknown nosed in the network and results prove the theoretical analysis.
Volterra Series identification Based on State Transition Algorithm with Orthogonal Transformation Cong Wang; Hong-Li Zhang; Wen-hui Fan
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 1: March 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

A Volterra kernel identification method based on state transition algorithm with orthogonal transformation (called OTSTA) was proposed to solve the hard problem in identifying Volterra kernels of nonlinear systems. Firstly, the population with chaotic sequences was initialized by using chaotic strategy. Then the orthogonal transformation was used to finish the mutation operator of the selected individual. OTSTA was used on the identification of Volterra series, and compared with particle swarm optimization (called PSO) and state transition algorithm (STA). The simulation results showed that OTSTA has better identification precision and convergence than PSO and STA under non-noise interference. And when there is noise, the identification precision, convergence and anti-interference of OTSTA are also superior to PSO and STA.
A New Method of Reference Signals Calculation for Switching Compensator Yiying Wang; Jiangong Liu; Yang Liu
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 1: March 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

This paper is under in-depth investigation due to suspicion of possible plagiarism on a high similarity indexThe switching compensation devices, such as active power filters and static var generator, are growing rapidly for power quality improvement. The current reference signals is one of the important factor affecting the responsible speed and compensation effect. In this paper, a new strategy for reference signals calculation is present based on Current’s Physical Components. Through the orthogonal decomposition of the load current by the CPC power theory, the reference current, for various compensation objectives of switching compensation devices, can be calculated by the combination of the orthogonal current components. It is demonstrated that this strategy can be used for various compensation goals of limited switching compensation devices and changing the compensation objectives on-line according to the power grids. The validity of the developed strategy is verified by the simulation results.
A Simple Checking Algorithm with Perturb and Observe Maximum Power Point Tracking for Partially Shaded Photovoltaic System Rozana Alik; Awang Jusoh; Tole Sutikno
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 1: March 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

This paper presents a simple checking algorithm for maximum power point tracking (MPPT) technique for Photovoltaic (PV) system using Perturb and Observe (P&O) algorithm. The main benefit of this checking algorithm is the simplicity and efficiency of the system whose duty cycle produced by the MPPT is smoother and changes faster according to maximum power point (MPP). This checking algorithm can determine the maximum power first before the P&O algorithm takes place to identify the voltage at MPP (VMPP), which is needed to calculate the duty cycle for the boost converter. To test the effectiveness of the algorithm, a simulation model of PV system has been carried out using MATLAB/Simulink under different level of irradiation; or in other words partially shaded condition of PV array. The results from the system using the proposed approach prove to have faster response and low ripple. Besides, the results are close to the desired outputs and exhibit an approximately 98.25% of the system efficiency. On the other hand, the system with conventional P&O MPPT seems to be unstable and has higher percentage of error. In summary, the proposed method is useful under varying level of irradiation with higher efficiency of the system.
A Cellular Automata Modeling for Visualizing and Predicting Spreading Patterns of Dengue Fever Puspa Eosina Hosen; Taufik Djatna; Helda Khusun
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 1: March 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

A Cellular Automata (CA) model is used for visualizing and predicting spreading pattern of the disease. The main problem of this model is how to find a function that represents an update rule that changes the state of a cell in time steps affected by neighborhood. This research aims to develop visualization and prediction model of the spreading patterns of Dengue Hemorrhagic Fever. The contribution of our study is to introduce a new approach in defining a probabilistic function that represents CA transmission rule by employing Von Neumann neighborhood and the Hidden Markov Model (HMM). This study only considered an infective state which dedicated particular attention to the spatial distribution of infected areas. The infected data were devided into four categories and change the definition of a cell as an area. The evaluation was conducted by comparing the results of the proposed model to that of one yielded by a Susceptible-Infected-Recovered (SIR) model. The evaluation result showed that the CA model was capable of generating patterns that similar to the patterns generated by SIR models with a similarities value of 0.95.
Hybridizing PSO With SA for Optimizing SVR Applied to Software Effort Estimation Dinda Novitasari; Imam Cholissodin; Wayan Firdaus Mahmudy
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 1: March 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

This study investigates Particle Swarm Optimization (PSO) hybridization with Simulated Annealing (SA) to optimize Support Vector Machine (SVR). The optimized SVR is used for software effort estimation. The optimization of SVR consists of two sub-problems that must be solved simultaneously; the first is input feature selection that influences method accuracy and computing time. The next sub-problem is finding optimal SVR parameter that each parameter gives significant impact to method performance. To deal with a huge number of candidate solutions of the problems, a powerful approach is required. The proposed approach takes advantages of good solution quality from PSO and SA. We introduce SA based acceptance rule to accept new position in PSO. The SA parameter selection is introduced to improve the quality as stochastic algorithm is sensitive to its parameter. The comparative works have been between PSO in quality of solution and computing time. According to the results, the proposed model outperforms PSO SVR in quality of solution
A Contention-Based Routing Protocol for VANET Deling Huang; Yusong Yan
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 1: March 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

In VANETs, vehicles as nodes are self-organized and inter-communicated without centralized authority. The topology formed by vehicles changes quickly, which makes routing become instability. Position-based routing, compared with traditional routing, is more scalable and feasible. Thus it has been proven stabler for VANETs than conventional routing. However, the frequently changed topology and nodes density could break the path a packet is following. Thus designing a robust multi-hop routing in VANET is challenging. This paper proposes an enhanced position-based routing protocol called CBGR, which takes into account the velocity and direction of vehicles in VANET. Simulation results show that CBGR achieves a high level of routing performance in terms of hop counts, network latency and packet delivery ratio both in dense or sparse vehicular ad-hoc networks.
Carrier Aggregation Technique to Improve Capacity in LTE-Advanced Network Iskandar Iskandar; R. Galih
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 1: March 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

Carrier aggregation (CA) is a major feature in LTE-advanced technology that allows network provider to use more than one carrier simultaneously to increase capacity. CA uses two or more individual component carriers (CCs) of the same (intra-band) and different (inter-band) frequency bands. In this paper, we evaluate CA techniques with the test parameter using BLER and throughput inside the tested area of LTE network. The tested area is designed to represent most common environment in which LTE will be deployed. We use 30 MHz frequency bandwidth in the simulation to evaluate intra-band and inter-band CA technique performance. Two CCs is allocated for primary serving cell (PCell) and secondary serving cell (SCell). Simulation result shows for the downlink, BLER tend to increase, as the frequency configuration is increase. However, for the uplink BLER is zero. We found that for CA configuration with wider PCell bandwidth resulting better throughput. In CA intra-band, the throughput of non-contiguous CA is better than CA contiguous. Then in the inter-band CA, CC combination with a lower frequency produces higher throughput.
Design of Compact Microstrip U Shape Bandpass Filter Using Via Ground Holes Fajri Darwis; Arief Budi Santiko; Novita Dwi Susanti
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 1: March 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

This paper present the microstrip bandpass filter using two U shape resonators with using via ground holes. The bandpass filter was established using two U shape resonators with using via ground holes and deployed on RT/duroid 6010 LM aims to minimize the dimension of filter. The proposed filter was characterized using software simulation. The characteristic of proposed filter is to deal with required specification. Hardware realization was done to verify the characteristic of proposed filter. The bandpass filter has the dimension of 4.2 mm x 3.8 mm. The filter was expected to have center frequency of 400 Mhz with minimum 3dB bandwidth of 15 Mhz, maximum insertion loss of -1.5 dB and VSWR less than 2. VSWR and 3dB bandwidth on realized filter have a good agreement with required specification. However the insertion loss and center frequency was not adequate. The realized filter has insertion loss of -2.554 dB with the center frequency of 404.711 MHz.
Robust Image Segmentation Using LBP Embedded Region Merging Jie Zhang; Chengjun Xie; Liangtu Song; Rui Li; Hongbo Chen
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 14, No 1: March 2016
Publisher : Universitas Ahmad Dahlan

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

Abstract

This paper is under in-depth investigation due to suspicion of possible plagiarism on a high similarity index. The region merging algorithm by the maximal similarity with color histogram has been applied successfully in color image segmentation. However, only using color histogram information is not sufficient and effective for superior segmentation. We propose a novel color image segmentation method based on region merging by using joint color-texture histogram in this paper. The proposed method incorporates both color histogram and texture histogram information to measure the similarity of different regions and thus to guide the region merging process. Experiments show that our method is more accurate and robust than traditional image segmentation methods based on region merging.

Page 1 of 5 | Total Record : 47

 1   2   3   4   5 

Filter by Year

2016 2016


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