Claim Missing Document
Check
Articles

Found 5 Documents
Search
Journal : EMITTER International Journal of Engineering Technology

An Adaptive Connectivity-based Centroid Algorithm for Node Positioning in Wireless Sensor Networks Pratiarso, Aries; Kristalina, Prima
EMITTER International Journal of Engineering Technology Vol 3, No 1 (2015)
Publisher : Politeknik Elektronika Negeri Surabaya (PENS)

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

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.
An Adaptive Connectivity-based Centroid Algorithm for Node Positioning in Wireless Sensor Networks Pratiarso, Aries; Kristalina, Prima
EMITTER International Journal of Engineering Technology Vol 3, No 1 (2015)
Publisher : Politeknik Elektronika Negeri Surabaya (PENS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24003/emitter.v3i1.39

Abstract

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.
An Adaptive Connectivity-based Centroid Algorithm for Node Positioning in Wireless Sensor Networks Aries Pratiarso; Prima Kristalina
EMITTER International Journal of Engineering Technology Vol 3 No 1 (2015)
Publisher : Politeknik Elektronika Negeri Surabaya (PENS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24003/emitter.v3i1.39

Abstract

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.
Medical Image Encryption Using Modified Identity Based Encryption Dian Neipa Purnamasari; Amang Sudarsono; Prima Kristalina
EMITTER International Journal of Engineering Technology Vol 7 No 2 (2019)
Publisher : Politeknik Elektronika Negeri Surabaya (PENS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24003/emitter.v7i2.405

Abstract

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.
Higher Rate Secret Key Formation (HRKF) based on Physical Layer for Securing Vehicle-to-Vehicle Communication Inka Trisna Dewi; Amang Sudarsono; Prima Kristalina; Mike Yuliana
EMITTER International Journal of Engineering Technology Vol 8 No 1 (2020)
Publisher : Politeknik Elektronika Negeri Surabaya (PENS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24003/emitter.v8i1.493

Abstract

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.