Jurnal
SINTA 1
An Implementation of Grouping Nodes in Wireless Sensor Network Based on Distance by Using k-Means Clustering
CommIT (Communication and Information Technology) Journal · Vol. 12 No. 2 (2018) · hlm. 97–104
ISSN 2460-7010, 1979-2484
Terbit 2018-10-31
Penerbit Bina Nusantara University
Bahasa eng
Abstrak
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%.
Jaringan kolaborasi para penulis
14 penulis ·
31 tautan kepenulisan bersama
· 2 lintas organisasi
Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.
Politeknik Elektronika Negeri Surabaya Institut Teknologi Sepuluh Nopember
Organisasi berbeda
Organisasi sama
Afiliasi tidak diketahui
Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.
Sumber metadata: OAI-PMH (metadata jurnal) https://journal.binus.ac.id/index.php/commit/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 8 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="en-US">An Implementation of Grouping Nodes in Wireless Sensor Network Based on Distance by Using k-Means Clustering</dc:title>
<dc:creator>Azhar, Rizqi Fauzil</dc:creator>
<dc:creator>Zainudin, Ahmad</dc:creator>
<dc:creator>Kristalina, Prima</dc:creator>
<dc:creator>Prakoso, Bagas Mardiasyah</dc:creator>
<dc:creator>Tamami, Niam</dc:creator>
<dc:subject xml:lang="en-US">Wireless Sensor Network</dc:subject>
<dc:subject xml:lang="en-US">Cluster- Based</dc:subject>
<dc:subject xml:lang="en-US">k-Nearest Neighbour</dc:subject>
<dc:description xml:lang="en-US">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%.</dc:description>
<dc:publisher xml:lang="en-US">Bina Nusantara University</dc:publisher>
<dc:date>2018-10-31</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
<dc:format>application/pdf</dc:format>
<dc:identifier>https://journal.binus.ac.id/index.php/commit/article/view/4714</dc:identifier>
<dc:identifier>10.21512/commit.v12i2.4714</dc:identifier>
<dc:source xml:lang="en-US">CommIT (Communication and Information Technology) Journal; Vol. 12 No. 2 (2018): CommIT Journal; 97-104</dc:source>
<dc:source>2460-7010</dc:source>
<dc:source>1979-2484</dc:source>
<dc:language>eng</dc:language>
<dc:relation>https://journal.binus.ac.id/index.php/commit/article/view/4714/3466</dc:relation>
<dc:rights xml:lang="en-US">Copyright (c) 2018 CommIT (Communication and Information Technology) Journal</dc:rights>
</oai_dc:dc>
Sitasi dan pengindeksan
Jumlah menurut tiap indeks pada 13 Nov 2026; setiap indeks menghitung sitasi dengan cara berbeda.
OpenAlex juga mencatat karya ini di: crossref, doaj.
Sitasi artikel ini
APA 7
Azhar, R. F., Zainudin, A., Kristalina, P., Prakoso, B. M., & Tamami, N. (2018). An Implementation of Grouping Nodes in Wireless Sensor Network Based on Distance by Using k-Means Clustering. CommIT (Communication and Information Technology) Journal, 12(2), 97–104. https://doi.org/10.21512/commit.v12i2.4714
Salin
IEEE
R. F. Azhar, A. Zainudin, P. Kristalina, B. M. Prakoso, and N. Tamami, “An Implementation of Grouping Nodes in Wireless Sensor Network Based on Distance by Using k-Means Clustering,” CommIT (Communication and Information Technology) Journal, vol. 12, no. 2, pp. 97–104, 2018, doi: 10.21512/commit.v12i2.4714.
Salin
Dibuat dari metadata jurnal; periksa nama penulis sebelum dipakai.