Pub Date : 2018-09-28DOI: 10.5614/ITBJ.ICT.RES.APPL.2018.12.2.2
A. Pekuwali, W. Kusuma, A. Buono
K -mer frequencies are commonly used in extracting features from metagenome fragments. In spite of this, researchers have found that their use is still inefficient. In this research, a genetic algorithm was employed to find optimally spaced k -mers. These were obtained by generating the possible combinations of match positions and don’t care positions (written as *). This approach was adopted from the concept of spaced seeds in PatternHunter. The use of spaced k -mers could reduce the size of the k -mer frequency feature’s dimension. To measure the accuracy of the proposed method we used the naive Bayesian classifier (NBC). The result showed that the chromosome 111111110001, representing spaced k -mer model [111 1111 10001], was the best chromosome, with a higher fitness (85.42) than that of the k -mer frequency feature. Moreover, the proposed approach also reduced the feature extraction time.
{"title":"Optimization of Spaced K-mer Frequency Feature Extraction using Genetic Algorithms for Metagenome Fragment Classification","authors":"A. Pekuwali, W. Kusuma, A. Buono","doi":"10.5614/ITBJ.ICT.RES.APPL.2018.12.2.2","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2018.12.2.2","url":null,"abstract":"K -mer frequencies are commonly used in extracting features from metagenome fragments. In spite of this, researchers have found that their use is still inefficient. In this research, a genetic algorithm was employed to find optimally spaced k -mers. These were obtained by generating the possible combinations of match positions and don’t care positions (written as *). This approach was adopted from the concept of spaced seeds in PatternHunter. The use of spaced k -mers could reduce the size of the k -mer frequency feature’s dimension. To measure the accuracy of the proposed method we used the naive Bayesian classifier (NBC). The result showed that the chromosome 111111110001, representing spaced k -mer model [111 1111 10001], was the best chromosome, with a higher fitness (85.42) than that of the k -mer frequency feature. Moreover, the proposed approach also reduced the feature extraction time.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":"6 5-6","pages":""},"PeriodicalIF":0.6,"publicationDate":"2018-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41301880","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-28DOI: 10.5614/ITBJ.ICT.RES.APPL.2018.12.2.6
Korkiat Kaewking, Sirapat Boonkrong
This research concerns the analysis of social networks using graph theory to find properties that can be used to determine Sybil nodes. This research also investigated the mixing time, which is one of the properties that many existing methods use for detecting Sybil attacks. The results showed that the mixing time does not reflect the difference between honest graphs and Sybil graphs. In addition, the properties of social graphs were studied and it was found that the average node distance is different in graphs containing Sybil nodes than in graphs with only honest nodes. Furthermore, the eigenvector centrality and the degree of Sybil nodes are correlated, while in honest nodes they are not.
{"title":"An Analysis of Graph Properties for Detecting Sybil Nodes in Social Networks","authors":"Korkiat Kaewking, Sirapat Boonkrong","doi":"10.5614/ITBJ.ICT.RES.APPL.2018.12.2.6","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2018.12.2.6","url":null,"abstract":"This research concerns the analysis of social networks using graph theory to find properties that can be used to determine Sybil nodes. This research also investigated the mixing time, which is one of the properties that many existing methods use for detecting Sybil attacks. The results showed that the mixing time does not reflect the difference between honest graphs and Sybil graphs. In addition, the properties of social graphs were studied and it was found that the average node distance is different in graphs containing Sybil nodes than in graphs with only honest nodes. Furthermore, the eigenvector centrality and the degree of Sybil nodes are correlated, while in honest nodes they are not.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2018-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45504173","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-28DOI: 10.5614/ITBJ.ICT.RES.APPL.2018.12.2.5
G. H. Rachman, M. L. Khodra, D. H. Widyantoro
A common task in summarizing scientific articles is employing the rhetorical structure of sentences. Determining rhetorical sentences itself passes through the process of text categorization. In order to get good performance, some works in text categorization have been done by employing word embedding. This paper presents rhetorical sentence categorization of scientific articles by using word embedding to capture semantically similar words. A comparison of employing Word2Vec and GloVe is shown. First, two experiments are evaluated using five classifiers, namely Naive Bayes, Linear SVM, IBK, J48, and Maximum Entropy. Then, the best classifier from the first two experiments was employed. This research showed that Word2Vec CBOW performed better than Skip-Gram and GloVe. The best experimental result was from Word2Vec CBOW for 20,155 resource papers from ACL-ARC, features from Teufel and the previous label feature. In this experiment, Linear SVM produced the highest F-measure performance at 43.44%.
{"title":"Word Embedding for Rhetorical Sentence Categorization on Scientific Articles","authors":"G. H. Rachman, M. L. Khodra, D. H. Widyantoro","doi":"10.5614/ITBJ.ICT.RES.APPL.2018.12.2.5","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2018.12.2.5","url":null,"abstract":"A common task in summarizing scientific articles is employing the rhetorical structure of sentences. Determining rhetorical sentences itself passes through the process of text categorization. In order to get good performance, some works in text categorization have been done by employing word embedding. This paper presents rhetorical sentence categorization of scientific articles by using word embedding to capture semantically similar words. A comparison of employing Word2Vec and GloVe is shown. First, two experiments are evaluated using five classifiers, namely Naive Bayes, Linear SVM, IBK, J48, and Maximum Entropy. Then, the best classifier from the first two experiments was employed. This research showed that Word2Vec CBOW performed better than Skip-Gram and GloVe. The best experimental result was from Word2Vec CBOW for 20,155 resource papers from ACL-ARC, features from Teufel and the previous label feature. In this experiment, Linear SVM produced the highest F-measure performance at 43.44%.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2018-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48728184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-28DOI: 10.5614/ITBJ.ICT.RES.APPL.2018.12.2.4
S. Anant, S. Veni
Nowadays, there is tremendous growth in in-car interfaces for driver safety and comfort, but controlling these devices while driving requires the driver’s attention. One of the solutions to reduce the number of glances at these interfaces is to design an advanced driver assistance system (ADAS). A vision-based touch-less hand gesture recognition system is proposed here for in-car human-machine interfaces (HMI). The performance of such systems is unreliable under ambient illumination conditions, which change during the course of the day. Thus, the main focus of this work was to design a system that is robust towards changing lighting conditions. For this purpose, a homomorphic filter with adaptive thresholding binarization is used. Also, gray-level edge-based segmentation ensures that it is generalized for users of different skin tones and background colors. This work was validated on selected gestures from the Cambridge Hand Gesture Database captured in five sets of non-uniform illumination conditions that closely resemble in-car illumination conditions, yielding an overall system accuracy of 91%, an average frame-by-frame accuracy of 81.38%, and a latency of 3.78 milliseconds. A prototype of the proposed system was implemented on a Raspberry Pi 3 interface together with an Android application, which demonstrated its suitability for non-critical in-car interfaces like infotainment systems.
{"title":"Safe Driving using Vision-based Hand Gesture Recognition System in Non-uniform Illumination Conditions","authors":"S. Anant, S. Veni","doi":"10.5614/ITBJ.ICT.RES.APPL.2018.12.2.4","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2018.12.2.4","url":null,"abstract":"Nowadays, there is tremendous growth in in-car interfaces for driver safety and comfort, but controlling these devices while driving requires the driver’s attention. One of the solutions to reduce the number of glances at these interfaces is to design an advanced driver assistance system (ADAS). A vision-based touch-less hand gesture recognition system is proposed here for in-car human-machine interfaces (HMI). The performance of such systems is unreliable under ambient illumination conditions, which change during the course of the day. Thus, the main focus of this work was to design a system that is robust towards changing lighting conditions. For this purpose, a homomorphic filter with adaptive thresholding binarization is used. Also, gray-level edge-based segmentation ensures that it is generalized for users of different skin tones and background colors. This work was validated on selected gestures from the Cambridge Hand Gesture Database captured in five sets of non-uniform illumination conditions that closely resemble in-car illumination conditions, yielding an overall system accuracy of 91%, an average frame-by-frame accuracy of 81.38%, and a latency of 3.78 milliseconds. A prototype of the proposed system was implemented on a Raspberry Pi 3 interface together with an Android application, which demonstrated its suitability for non-critical in-car interfaces like infotainment systems.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2018-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44957639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-28DOI: 10.5614/ITBJ.ICT.RES.APPL.2018.12.2.1
Edi Jaya Kusuma, C. A. Sari, E. H. Rachmawanto, D. Setiadi
Securing images can be achieved using cryptography and steganography. Combining both techniques can improve the security of images. Usually, Arnold’s transformation (ACM) is used to encrypt an image by randomizing the image pixels. However, applying only a transformation algorithm is not secure enough to protect the image. In this study, ACM was combined with RSA, another encryption technique, which has an exponential process that uses large numbers. This can confuse attackers when they try to decrypt the cipher images. Furthermore, this paper also proposes combing ACM with RSA and subsequently embedding the result in a cover image with inverted two-bit LSB steganography, which replaces two bits in the bit plane of the cover image with message bits. This modified steganography technique can provide twice the capacity of the previous method. The experimental result was evaluated using PSNR and entropy as the parameters to obtain the quality of the stego images and the cipher images. The proposed method produced a highest PSNR of 57.8493 dB and entropy equal to 7.9948.
{"title":"A Combination of Inverted LSB, RSA, and Arnold Transformation to get Secure and Imperceptible Image Steganography","authors":"Edi Jaya Kusuma, C. A. Sari, E. H. Rachmawanto, D. Setiadi","doi":"10.5614/ITBJ.ICT.RES.APPL.2018.12.2.1","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2018.12.2.1","url":null,"abstract":"Securing images can be achieved using cryptography and steganography. Combining both techniques can improve the security of images. Usually, Arnold’s transformation (ACM) is used to encrypt an image by randomizing the image pixels. However, applying only a transformation algorithm is not secure enough to protect the image. In this study, ACM was combined with RSA, another encryption technique, which has an exponential process that uses large numbers. This can confuse attackers when they try to decrypt the cipher images. Furthermore, this paper also proposes combing ACM with RSA and subsequently embedding the result in a cover image with inverted two-bit LSB steganography, which replaces two bits in the bit plane of the cover image with message bits. This modified steganography technique can provide twice the capacity of the previous method. The experimental result was evaluated using PSNR and entropy as the parameters to obtain the quality of the stego images and the cipher images. The proposed method produced a highest PSNR of 57.8493 dB and entropy equal to 7.9948.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2018-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46536914","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-09-28DOI: 10.5614/ITBJ.ICT.RES.APPL.2018.12.2.3
Yuwanuch Gulateee, J. Pagram, Barbara Combes
Students’ ownership of technology devices, their access to software and Web-based utilities, and their related preferences are the subject of this ongoing research. The devices that instructors use in the classroom, how students use online learning systems as provided by the university, and students’ skill levels when using technology for learning are also included. The major objective of this research is to provide a long-term comparative analysis across one university to determine if students’ and lecturers’ use of technology for teaching-learning has changed. Such ongoing data collection and analysis will inform individual institutions about online learning and how to improve facilities for both staff and students for maximum educational success. An initial study was conducted in 2015. This paper reports on the second data collection to determine if there have been any changes over a two-year period. The findings indicate that students have intermediate skill levels when using basic software programs for their study, whereas their social media skills are advanced. Students use mobile devices (phones and tablets) to access online learning materials. Overall, most students and staff lack basic knowledge in using information technology for study purposes. It was concluded that the university should continue to conduct ongoing monitoring and evaluation of students’ and staff’s information technology competencies.
{"title":"Which Tech Will I Use? Trends in Students’ Use and Ownership of Technology in a Thai University, an Ongoing Study","authors":"Yuwanuch Gulateee, J. Pagram, Barbara Combes","doi":"10.5614/ITBJ.ICT.RES.APPL.2018.12.2.3","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2018.12.2.3","url":null,"abstract":"Students’ ownership of technology devices, their access to software and Web-based utilities, and their related preferences are the subject of this ongoing research. The devices that instructors use in the classroom, how students use online learning systems as provided by the university, and students’ skill levels when using technology for learning are also included. The major objective of this research is to provide a long-term comparative analysis across one university to determine if students’ and lecturers’ use of technology for teaching-learning has changed. Such ongoing data collection and analysis will inform individual institutions about online learning and how to improve facilities for both staff and students for maximum educational success. An initial study was conducted in 2015. This paper reports on the second data collection to determine if there have been any changes over a two-year period. The findings indicate that students have intermediate skill levels when using basic software programs for their study, whereas their social media skills are advanced. Students use mobile devices (phones and tablets) to access online learning materials. Overall, most students and staff lack basic knowledge in using information technology for study purposes. It was concluded that the university should continue to conduct ongoing monitoring and evaluation of students’ and staff’s information technology competencies.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2018-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46442421","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-04-30DOI: 10.5614/ITBJ.ICT.RES.APPL.2018.12.1.4
S. Diwandari, A. E. Permanasari, I. Hidayah
Visitor interaction with e-commerce websites generates large amounts of clickstream data stored in web access logs. From a business standpoint, clickstream data can be used as a means of finding information on user interest. In this paper, the authors propose a method to find user interest in products offered on e-commerce websites based on web usage mining of clickstream data. In this study, user interest was investigated using the PIE approach coupled with clustering and classification techniques. The experimental results showed that the method is able to assist in analyzing visitor behavior and user interest in e-commerce products by identifying those products that prompt visitor interest.
{"title":"Research Methodology for Analysis of E-Commerce User Activity Based on User Interest using Web Usage Mining","authors":"S. Diwandari, A. E. Permanasari, I. Hidayah","doi":"10.5614/ITBJ.ICT.RES.APPL.2018.12.1.4","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2018.12.1.4","url":null,"abstract":"Visitor interaction with e-commerce websites generates large amounts of clickstream data stored in web access logs. From a business standpoint, clickstream data can be used as a means of finding information on user interest. In this paper, the authors propose a method to find user interest in products offered on e-commerce websites based on web usage mining of clickstream data. In this study, user interest was investigated using the PIE approach coupled with clustering and classification techniques. The experimental results showed that the method is able to assist in analyzing visitor behavior and user interest in e-commerce products by identifying those products that prompt visitor interest.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":"12 1","pages":"54-69"},"PeriodicalIF":0.6,"publicationDate":"2018-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48680298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-04-30DOI: 10.5614/ITBJ.ICT.RES.APPL.2018.12.1.3
Koredianto Usman, H. Gunawan, A. B. Suksmono
In this paper we propose a new approach of the compressive sensing (CS) reconstruction problem based on a geometrical interpretation of l 1 -norm minimization. By taking a large l 1 -norm value at the initial step, the intersection of l 1 -norm and the constraint curves forms a convex polytope and by exploiting the fact that any convex combination of the polytope’s vertexes gives a new point that has a smaller l 1 -norm, we are able to derive a new algorithm to solve the CS reconstruction problem. Compared to the greedy algorithm, this algorithm has better performance, especially in highly coherent environments. Compared to the convex optimization, the proposed algorithm has simpler computation requirements. We tested the capability of this algorithm in reconstructing a randomly down-sampled version of the Dow Jones Industrial Average (DJIA) index. The proposed algorithm achieved a good result but only works on real-valued signals.
{"title":"Sparse Signal Reconstruction using Weight Point Algorithm","authors":"Koredianto Usman, H. Gunawan, A. B. Suksmono","doi":"10.5614/ITBJ.ICT.RES.APPL.2018.12.1.3","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2018.12.1.3","url":null,"abstract":"In this paper we propose a new approach of the compressive sensing (CS) reconstruction problem based on a geometrical interpretation of l 1 -norm minimization. By taking a large l 1 -norm value at the initial step, the intersection of l 1 -norm and the constraint curves forms a convex polytope and by exploiting the fact that any convex combination of the polytope’s vertexes gives a new point that has a smaller l 1 -norm, we are able to derive a new algorithm to solve the CS reconstruction problem. Compared to the greedy algorithm, this algorithm has better performance, especially in highly coherent environments. Compared to the convex optimization, the proposed algorithm has simpler computation requirements. We tested the capability of this algorithm in reconstructing a randomly down-sampled version of the Dow Jones Industrial Average (DJIA) index. The proposed algorithm achieved a good result but only works on real-valued signals.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":"12 1","pages":"35-53"},"PeriodicalIF":0.6,"publicationDate":"2018-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44184722","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-04-30DOI: 10.5614/ITBJ.ICT.RES.APPL.2018.12.1.6
A. Barmawi, Widhian Bramantya
An important problem in visual cryptography is the alignment problem. Although Liu, et al. have proposed a method for aligning the shares, there is still a problem with the non-identical mathematical support visual cryptography schemes. For overcoming this problem, the Three-Orthogonal-Point (3OP) method is proposed in this paper. Based on the experimental result it was proven that it can overcome the alignment problem, while the time complexity for aligning the shares is decreased significantly from O((m×A) 2 ) to O(m×AI) , for AI < A. The security is maintained, since an attacker cannot obtain any information related to the secret image.
{"title":"Overcoming Alignment Problem in Non-Identical Mathematical Support Visual Cryptography Schemes","authors":"A. Barmawi, Widhian Bramantya","doi":"10.5614/ITBJ.ICT.RES.APPL.2018.12.1.6","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2018.12.1.6","url":null,"abstract":"An important problem in visual cryptography is the alignment problem. Although Liu, et al. have proposed a method for aligning the shares, there is still a problem with the non-identical mathematical support visual cryptography schemes. For overcoming this problem, the Three-Orthogonal-Point (3OP) method is proposed in this paper. Based on the experimental result it was proven that it can overcome the alignment problem, while the time complexity for aligning the shares is decreased significantly from O((m×A) 2 ) to O(m×AI) , for AI < A. The security is maintained, since an attacker cannot obtain any information related to the secret image.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":"12 1","pages":"87-102"},"PeriodicalIF":0.6,"publicationDate":"2018-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43075019","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-04-30DOI: 10.5614/ITBJ.ICT.RES.APPL.2018.12.1.1
Ammar S. Al-Zubaidi, Ahmad Ariffin, Abdulrahman K. Al-Qadhi
Recently, increasing battery lifetime in wireless sensor networks has turned out to be one of the major challenges faced by researchers. The sensor nodes in wireless sensor networks use a battery as their power source, which is hard to replace during deployment. Low Energy Adaptive Clustering Hierarchy (LEACH) is one of the most prominent wireless sensor network routing protocols that have been proposed to improve network lifetime by utilizing energy-efficient clustering. However, LEACH has some issues related to cluster-head selection, where the selection is done randomly. This leads to rapid loss of energy in the network. Improved LEACH is a LEACH alternative that has the ability to increase network lifetime by using the nodes’ residual energy and their distance to the base station to select cluster-head nodes. However, Improved LEACH causes reduced stability, where the stability period is the duration before the death of the first node. The network stability period is important for applications that require reliable feedback from the network. Thus, we were motivated to investigate the Improved LEACH algorithm and to try to solve the stability problem. A new protocol is proposed in this paper: Stable Improved Low Energy Adaptive Clustering Hierarchy (SILEACH), which was developed to overcome the flaws of the Improved LEACH protocol. SILEACH balances the load between the nodes by utilizing an optimized method that considers the nodes’ distance to the base station and their residual energy to select the cluster-head nodes and considers the nodes’ distance to the cluster head and the base station to form clusters. The simulation results revealed that SILEACH is significantly more efficient than Improved LEACH in terms of stability period and network lifetime.
{"title":"Enhancing the Stability of the Improved-LEACH Routing Protocol for WSNs","authors":"Ammar S. Al-Zubaidi, Ahmad Ariffin, Abdulrahman K. Al-Qadhi","doi":"10.5614/ITBJ.ICT.RES.APPL.2018.12.1.1","DOIUrl":"https://doi.org/10.5614/ITBJ.ICT.RES.APPL.2018.12.1.1","url":null,"abstract":"Recently, increasing battery lifetime in wireless sensor networks has turned out to be one of the major challenges faced by researchers. The sensor nodes in wireless sensor networks use a battery as their power source, which is hard to replace during deployment. Low Energy Adaptive Clustering Hierarchy (LEACH) is one of the most prominent wireless sensor network routing protocols that have been proposed to improve network lifetime by utilizing energy-efficient clustering. However, LEACH has some issues related to cluster-head selection, where the selection is done randomly. This leads to rapid loss of energy in the network. Improved LEACH is a LEACH alternative that has the ability to increase network lifetime by using the nodes’ residual energy and their distance to the base station to select cluster-head nodes. However, Improved LEACH causes reduced stability, where the stability period is the duration before the death of the first node. The network stability period is important for applications that require reliable feedback from the network. Thus, we were motivated to investigate the Improved LEACH algorithm and to try to solve the stability problem. A new protocol is proposed in this paper: Stable Improved Low Energy Adaptive Clustering Hierarchy (SILEACH), which was developed to overcome the flaws of the Improved LEACH protocol. SILEACH balances the load between the nodes by utilizing an optimized method that considers the nodes’ distance to the base station and their residual energy to select the cluster-head nodes and considers the nodes’ distance to the cluster head and the base station to form clusters. The simulation results revealed that SILEACH is significantly more efficient than Improved LEACH in terms of stability period and network lifetime.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":"12 1","pages":"1-13"},"PeriodicalIF":0.6,"publicationDate":"2018-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45291468","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：