Azhar, Rizqi Fauzil
Indonesian Institute of Sciences

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

Performance Evaluation of Distribution Node in Case of LEACH Implementation on Wireless Sensor Network Prakoso, Bagas Mardiasyah; Zainudin, Ahmad; Kristalina, Prima; Azhar, Rizqi Fauzil
Jurnal Elektronika dan Telekomunikasi Vol 18, No 2 (2018)
Publisher : Indonesian Institute of Sciences

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.14203/jet.v18.67-74

Abstract

Wireless sensor networks consisting of sensor nodes can be used as an effective tool for collecting data in various situations. Nodes are usually placed randomly in an area to perform sensing and monitor various parameters related to environmental conditions in various locations. One of the major problems in wireless sensor networks is developing energy-efficient routing protocols that have a significant impact on the overall life of sensor networks so it is important to make energy savings in these limited energy sources to extend network life. This paper proposes a hardware design and Low-Energy Adaptive Clustering Hierarchy (LEACH) routing protocol configuration for power saving by utilizing cluster head selection mechanism. The cluster head selection process is performed periodically based on LEACH algorithm enables the node to have the best lifetime responsible for communication between the nodes and the server as well as the effort to save energy consumption of limited energy sources to extend network life. So that makes the process of sending information more effective and optimal. The system has been able to display data information along with the position of nodes in the web server with an average of 42 seconds of computing time in a rotation of the system so that it can be done 85 times in 1 hour. The system is able to provide real-time information with a throughput of more than 1.052 Kbps and packet loss of no more than 6.7%. In addition, energy savings can up to 6.5% of the existing energy in a lithium battery.
An Implementation of Grouping Nodes in Wireless Sensor Network Based on Distance by Using k-Means Clustering Azhar, Rizqi Fauzil; Zainudin, Ahmad; Kristalina, Prima; Prakoso, Bagas Mardiasyah; Tamami, Niam
CommIT (Communication and Information Technology) Journal Vol 12, No 2 (2018): CommIT Vol. 12 No. 2 Tahun 2018
Publisher : Bina Nusantara University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21512/commit.v12i2.4714

Abstract

Wireless Sensor Network (WSN) is a network consisting of several sensor nodes that communicate with each other and work together to collect data from the surrounding environment. One of the WSN problems is the limited available power. Therefore, nodes on WSN need to communicate by using a cluster-based routing protocol. To solve this, the researchers propose a node grouping based on distance by using k-means clustering with a hardware implementation. Cluster formation and member node selection are performed based on the nearest device of the sensor node to the cluster head. The k-means algorithm utilizes Euclidean distance as the main grouping nodes parameter obtained from the conversion of the Received Signal Strength Indication (RSSI) into the distance estimation between nodes. RSSI as the parameter of nearest neighbor nodes uses lognormal shadowing channel modeling method that can be used to get the path loss exponent in an observation area. The estimated distance in the observation area has 27.9% error. The average time required for grouping is 58.54 s. Meanwhile, the average time used to retrieve coordinate data on each cluster to the database is 45.54 s. In the system, the most time-consuming process is the PAN ID change process with an average time of 14.20 s for each change of PAN ID. The grouping nodes in WSN using k-means clustering algorithm can improve the power efficiency by 6.5%.