Articles
<![CDATA[An Implementation of Grouping Nodes in Wireless Sensor Network Based on Distance by Using k-Means Clustering ]]>
<![CDATA[Rizqi Fauzil Azhar]]>;
<![CDATA[Ahmad Zainudin]]>;
<![CDATA[Prima Kristalina]]>;
<![CDATA[Bagas Mardiasyah Prakoso]]>;
<![CDATA[Niam Tamami]]>
<![CDATA[ CommIT (Communication and Information Technology) Journal Vol. 12 No. 2 (2018): CommIT Journal ]]>
Publisher : <![CDATA[Bina Nusantara University ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.21512/commit.v12i2.4714
<![CDATA[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%.]]>
<![CDATA[An Adaptive Connectivity-based Centroid Algorithm for Node Positioning in Wireless Sensor Networks ]]>
<![CDATA[Aries Pratiarso]]>;
<![CDATA[Prima Kristalina]]>
<![CDATA[ EMITTER International Journal of Engineering Technology Vol 3 No 1 (2015) ]]>
Publisher : <![CDATA[Politeknik Elektronika Negeri Surabaya (PENS) ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.24003/emitter.v3i1.39
<![CDATA[In wireless sensor network applications, the position of nodes is randomly distributed following the contour of the observation area. A simple solution without any measurement tools is provided by range-free method. However, this method yields the coarse estimating position of the nodes. In this paper, we propose Adaptive Connectivity-based (ACC) algorithm. This algorithm is a combination of Centroid as range-free based algorithm, and hop-based connectivity algorithm. Nodes have a possibility to estimate their own position based on the connectivity level between them and their reference nodes. Each node divides its communication range into several regions where each of them has a certain weight depends on the received signal strength. The weighted value is used to obtain the estimated position of nodes. Simulation result shows that the proposed algorithm has up to 3 meter error of estimated position on 100x100 square meter observation area, and up to 3 hop counts for 80 meters' communication range. The proposed algorithm performs an average error positioning up to 10 meters better than Weighted Centroid algorithm.Keywords: adaptive, connectivity, centroid, range-free.]]>
<![CDATA[Medical Image Encryption Using Modified Identity Based Encryption ]]>
<![CDATA[Dian Neipa Purnamasari]]>;
<![CDATA[Amang Sudarsono]]>;
<![CDATA[Prima Kristalina]]>
<![CDATA[ EMITTER International Journal of Engineering Technology Vol 7 No 2 (2019) ]]>
Publisher : <![CDATA[Politeknik Elektronika Negeri Surabaya (PENS) ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.24003/emitter.v7i2.405
<![CDATA[The development of technology and communication also affects the level of security needed for digital image transmission. It is known that digital images now have important meanings in both communication and video conference. In this paper, we propose a security method for medical encryption in the form of images. The proposed method is implemented in the modified Identity-Based Encryption scheme. The encryption algorithm used is Elliptic Curve Cryptography (ECC) to generate key pairs and the Advanced Encryption Standard (AES) to generate symmetric keys and encrypt process. This method has been tested based on computation time, histogram analysis and statistical analysis. The results of the test were obtained that the proposed method was resistant to multiple attacks despite having slower computing time. The proposed compute time error percentage is 1.69% for key generator stages and 0.07% for total compute time at the encrypt-decrypt stage.]]>
<![CDATA[Higher Rate Secret Key Formation (HRKF) based on Physical Layer for Securing Vehicle-to-Vehicle Communication ]]>
<![CDATA[Inka Trisna Dewi]]>;
<![CDATA[Amang Sudarsono]]>;
<![CDATA[Prima Kristalina]]>;
<![CDATA[Mike Yuliana]]>
<![CDATA[ EMITTER International Journal of Engineering Technology Vol 8 No 1 (2020) ]]>
Publisher : <![CDATA[Politeknik Elektronika Negeri Surabaya (PENS) ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.24003/emitter.v8i1.493
<![CDATA[One effort to secure vehicle-to-vehicle (V2V) communication is to use a symmetrical cryptographic scheme that requires the distribution of shared secret keys. To reduce attacks on key distribution, physical layer-based key formation schemes that utilize the characteristics of wireless channels have been implemented. However, existing schemes still produce a low bit formation rate (BFR) even though they can reach a low bit error rate (BER). Note that V2V communication requires a scheme with high BFR in order to fulfill its main goal of improving road safety. In this research, we propose a higher rate secret key formation (HRKF) scheme using received signal strength (RSS) as a source of random information. The focus of this research is to produce keys with high BFR without compromising BER. To reduce bit mismatch, we propose a polynomial regression method that can increase channel reciprocity. We also propose a fixed threshold quantization (FTQ) method to maintain the number of bits so that the BFR increases. The test results show that the HRKF scheme can increase BFR from 40% up to 100% compared to existing research schemes. To ensure the key cannot be guessed by the attacker, the HRKF scheme succeeds in producing a key that meets the randomness of the NIST test.]]>
<![CDATA[Improve the Robustness of Range-Free Localization Methods on Wireless Sensor Networks using Recursive Position Estimation Algorithm ]]>
<![CDATA[Prima Kristalina]]>;
<![CDATA[Wirawan Wirawan]]>;
<![CDATA[Gamantyo Hendrantoro]]>
<![CDATA[ Journal of ICT Research and Applications Vol. 5 No. 3 (2011) ]]>
Publisher : <![CDATA[LPPM ITB ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.5614/itbj.ict.2011.5.3.4
<![CDATA[The position of a sensor node at wireless sensor networks determines the received data sensing accuracy. By the knowledge of sensor positioning, the location of target sensed can be estimated. Localization techniques used to find out the position of sensor node by considering the distance of this sensor from the vicinity reference nodes. Centroid Algorithm is a robust, simple and low cost localization technique without dependence on hardware requirement. We propose Recursive Position Estimation Algorithm to obtain the more accurate node positioning on range-free localization technique. The simulation result shows that this algorithm has the ability on increasing position accuracy up to 50%. The trade off factor shows the smaller the number of reference nodes the higher the computational time required. The new method on the availability on sensor power controlled is proposed to optimize the estimated position.]]>
<![CDATA[Performance Evaluation of Distribution Node in Case of LEACH Implementation on Wireless Sensor Network ]]>
<![CDATA[Bagas Mardiasyah Prakoso]]>;
<![CDATA[Ahmad Zainudin]]>;
<![CDATA[Prima Kristalina]]>;
<![CDATA[Rizqi Fauzil Azhar]]>
<![CDATA[ Jurnal Elektronika dan Telekomunikasi Vol 18, No 2 (2018) ]]>
Publisher : <![CDATA[LIPI Press ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
DOI: 10.14203/jet.v18.67-74
<![CDATA[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.]]>
<![CDATA[PEMBUATAN PEMBATAS PEMAKAIAN TELEPON DAN KONTROL PERALATAN ELEKTRONIK BERBASIS MIKROKONTROLER ]]>
<![CDATA[Akuwan Saleh]]>;
<![CDATA[Prima Kristalina]]>;
<![CDATA[Anang Budikarso]]>
<![CDATA[ SENTIA 2015 Vol 7, No 1 (2015) ]]>
Publisher : <![CDATA[SENTIA 2015 ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (645.339 KB)
<![CDATA[Telepon merupakan alat komunikasi yang banyak diminati masyarakat, karena harganya yang relatif murah dan lebih cepat bila dibandingkan dengan alat komunikasi lainnya. Dalam melakukan pembicaraan, biasanya pemakai tidak memperdulikan waktu dan biaya. Oleh karena itu, agar biaya pemakaian tidak membebani pemakai maka pada perangkat telepon dibuat aplikasi untuk pembatas pemakaian dengan cara user login dan mengisi password untuk mengaktifkan counter dengan durasi tertentu dan aplikasi kontrol peralatan rumah jarak jauh yang dilakukan melalui telepon pengirim menggunakan mikrokontroler dengan memanfaatkan saluran telepon sebagai media transmisi. Pada aplikasi ini ditambahkan mikrokontroler DT-51, Phone Interface, dan LCD Graphic. Mikrokontroler berfungsi untuk mengolah data dari phone Interface yang berasal dari penekanan tombol keypad pada telepon pengirim sebagai perintah yang diterjemahkan oleh mikrokontroler untuk mengendalikan rangkaian sakelar (relay). Pengguna dapat mengerti peralatan yang dikontrol dalam keadaan on atau off setelah perintah dilaksanakan dengan membaca sinyal balasan berupa nada beep. Berdasarkan pengujian diperoleh hasil bahwa penggunaan pembatas pemakaian, kondisi belum login, jalur telepon dalam keadaan mati dan setelah login jalur telepon siap melakukan panggilan. Saat penambahan durasi 1 sampai 9 menit, dapat dilakukan dengan baik, dengan prosentase keberhasilan mencapai 100% untuk setiap panggilan. Sedangkan pengujian dengan pengiriman melalui telepon analog dan mobile-phone diperoleh kontrol on/off peralatan listrik dengan penekanan tombol terjadi delay kurang dari 1 detik.]]>
<![CDATA[DESIGN OF ARTIFICIAL NEURAL NETWORK SOFTWARE FOR PREDICTING THE HEALTH GRADE IN A TELEPHONE EXCHANGE ]]>
<![CDATA[Wiratmoko Yuwono]]>;
<![CDATA[Yodik Iwan Herlambang]]>;
<![CDATA[Mauridhi Hery Purnomo]]>;
<![CDATA[Prima Kristalina]]>
<![CDATA[ SAINTEKBU Vol 1 No 1 (2008) ]]>
Publisher : <![CDATA[KH. A. Wahab Hasbullah University ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (209.235 KB)
|
DOI: 10.32764/saintekbu.v1i1.32
<![CDATA[Application of artificial neural network software ( ANN ) has been implemented forpredicting many thing and replace the conventional ways of predicting method using linearregression. Back Propagation algorithm can be used to reach the result of the program thatcan predict the telephone exchange health grade according to the data that has beenrecorded before. By predicting each parameter that has correlation to the telephoneexchange health grade, we can predict the telephone exchange health grade in the nextperiod.Kata kunci : jaringan syaraf tiruan, propagasi balik, nilai kesehatan sentral.]]>
<![CDATA[DESIGN AND IMPLEMENT ADAPTIVE NEURAL NETWORK SOFTWARE FOR ROUTING DATA PROCESS IN COMPUTER NETWORK ]]>
<![CDATA[Dadio Nugroho]]>;
<![CDATA[Risa Ekowati]]>;
<![CDATA[Prima Kristalina]]>;
<![CDATA[Mauridhi Hery P]]>
<![CDATA[ SAINTEKBU Vol 1 No 2 (2008) ]]>
Publisher : <![CDATA[KH. A. Wahab Hasbullah University ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (120.19 KB)
|
DOI: 10.32764/saintekbu.v1i2.81
<![CDATA[The data transmission in computer network is very important. Therefore, this issue always need a serious attention, especially in the middle and wide area networking which consist of many routers. This Adaptive Neural Network's software for routing data in computer network (which is called JST Router later) is designed to solve a routing problem for choosing the best data routing path using Backpropagation Algorithm of Neural NetworkKeywords : routing table , routing algorithms, routing protocols , Artificial Neural Networks .]]>
<![CDATA[Modifikasi Identity-based Encryption pada Keamanan dan Kerahasiaan Data Rekam Medis ]]>
<![CDATA[Dian Neipa Purnamasari]]>;
<![CDATA[Amang Sudarsono]]>;
<![CDATA[Prima Kristalina]]>
<![CDATA[ INOVTEK POLBENG Vol 9, No 2 (2019): INOVTEK VOL.9 NO 2 - 2019 ]]>
Publisher : <![CDATA[POLITEKNIK NEGERI BENGKALIS ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (80.356 KB)
|
DOI: 10.35314/ip.v9i2.1005
<![CDATA[Keamanan pada data rekam medis menjadi hal yang penting selain mengingat pentingnya isi dari rekam medis tersebut, keamanan pada data rekam medis telah diatur oleh kemeterian di Indonesia. Perkembangan teknologi membawa pengaruh pada penyimpanan data rekam medis, salah satunya perubahan data rekam medis dari konvensional menjadi elektronik. Namun, perkembangan teknologi ini juga memiliki dampak buruk yaitu munculnya oknum-oknum yang menjalankan kegiatan ilegal untuk mendapatkan keuntungan pribadi atau kelompok. Salah satunya adalah mencuri data rekam medis untuk memeras pasien, bahkan melakukan perubahan pada data rekam medis yang berdampak fatal pada kesehatan pasien. Pada penelitian ini diusulkan metode keamanan data rekam medis menggunakan modifikasi skema Identity-based Encryption (IBE) dan algoritma AES atau dapat disebut dengan mIBE-AES. Keunikan dari metode yang diusulkan adalah nilai awal yang telah ditentukan dari tiap byte pada identitas pengguna sehingga dapat menekan waktu komputasi pada proses pembangkitan kunci. Metode yang diusulkan akan dibandingkan dengan metode keamanan yang hanya menggunakan algoritma AES. Evaluasi performa yang telah dilakukan adalah pengujian kinerja dan tingkat keamanan pada penyerangan Man in The Middle (MITM). Didapatkan hasil bahwa metode mIBE-AES lebih unggul dengan total waktu komputasi 0,799 detik serta mampu menangani penyerangan MITM dengan skenario sniffing dan chosen-plaintext.]]>
