Khalid K. Almuzaini
Bio: Khalid K. Almuzaini is an academic researcher from University of Victoria. The author has contributed to research in topics: Computer science & Wireless sensor network. The author has an hindex of 4, co-authored 5 publications receiving 52 citations.
TL;DR: The AIoT-H application is likely to be explored in this research article due to its potential to aid with existing and different technologies, as well as bring useful solutions to healthcare security challenges.
Abstract: A significant study has been undertaken in the areas of health care and administration of cutting-edge artificial intelligence (AI) technologies throughout the previous decade. Healthcare professionals studied smart gadgets and other medical technologies, along with the AI-based Internet of Things (IoT) (AIoT). Connecting the two regions makes sense in terms of improving care for rural and isolated resident individuals. The healthcare industry has made tremendous strides in efficiency, affordability, and usefulness as a result of new research options and major cost reductions. This includes instructions (AIoT-based) medical advancements can be both beneficial and detrimental. While the IoT concept undoubtedly offers a number of benefits, it also poses fundamental security and privacy concerns regarding medical data. However, resource-constrained AIoT devices are vulnerable to a number of assaults, which can significantly impair their performance. Cryptographic algorithms used in the past are inadequate for safeguarding IoT-enabled networks, presenting substantial security risks. The AIoT is made up of three layers: perception, network, and application, all of which are vulnerable to security threats. These threats can be aggressive or passive in nature, and they can originate both within and outside the network. Numerous IoT security issues, including replay, sniffing, and eavesdropping, have the ability to obstruct network communication. The AIoT-H application is likely to be explored in this research article due to its potential to aid with existing and different technologies, as well as bring useful solutions to healthcare security challenges. Additionally, every day, several potential problems and inconsistencies with the AIoT-H technique have been discovered.
TL;DR: A new range-based algorithm which is based on the density-based outlier detection algorithm (DBOD) from data mining, which requires selection of the K-nearest neighbours (KNN) and performs better than these algorithms even when the anchor geometry about an unlocalized node is poor.
Abstract: Node localization is commonly employed in wireless networks. For example, it is used to improve routing and enhance security. Localization algorithms can be classified as range-free or range-based. Range-based algorithms use location metrics such as ToA, TDoA, RSS, and AoA to estimate the distance between two nodes. Proximity sensing between nodes is typically the basis for range-free algorithms. A tradeoff exists since range-based algorithms are more accurate but also more complex. However, in applications such as target tracking, localization accuracy is very important. In this paper, we propose a new range-based algorithm which is based on the density-based outlier detection algorithm (DBOD) from data mining. It requires selection of the K-nearest neighbours (KNN). DBOD assigns density values to each point used in the location estimation. The mean of these densities is calculated and those points having a density larger than the mean are kept as candidate points. Different performance measures are used to compare our approach with the linear least squares (LLS) and weighted linear least squares based on singular value decomposition (WLS-SVD) algorithms. It is shown that the proposed algorithm performs better than these algorithms even when the anchor geometry about an unlocalized node is poor.
TL;DR: The simulated results show that the PLAEOR-MCND achieves 120 sec of NLife and 20 J of EC than the state-of-the-art protocols.
Abstract: During data transmission, a decentralised Mobile Ad Hoc Network (MANET) might result in high Energy Consumption (EC) and a short Network Lifetime (NLife). To address these difficulties, an on-demand Power and Load-Aware multipath node-disjoint source routing is presented based on the Enhanced Opportunistic Routing (PLAEOR) protocol. This unique protocol aims at using power, load, and latency to manage routing costs depending on control packet flooding from the destination node. However, the exchange of control packets from the target to all nodes may impact network efficiency. As a result, the PLAEOR is designed with a Multichannel Cooperative Neighbor Discovery (MCND) protocol to locate the nearby cooperative nodes for each node in the routing path during control packet transmission. Furthermore, when the packet rate of CBR is 20 packets/sec, the simulated results show that the PLAEOR-MCND achieves 120 sec of NLife and 20 J of EC than the state-of-the-art protocols.
TL;DR: An enhanced identity-based encryption approach where a secure key is generated using part of an identity bit string in order to avoid leakage of users’ identity even if an adversary or attacker decodes the key or encrypted data is proposed.
Abstract: The demand of cloud computing and 5G networks has increased in the current scenario due to their attractive features and also the security related to the data over the cloud. In the context of cloud security, there is a number of computationally hard methods available. One of the most popular methods used to secure data over the cloud is the identity-based encryption (IBE). It is an access policy that allows only authorized users to access legible data in order to avoid a malicious attack. IBE comprises of four stages, namely, setup, key generation or extract, encryption, and decryption. Key generation is one of the important and time-consuming phases in which a security key is generated. It is a computational and decisional hard problem for generating unbreakable and nonderivable secure keys. This paper proposes an enhanced identity-based encryption approach where a secure key is generated using part of an identity bit string in order to avoid leakage of users’ identity even if an adversary or attacker decodes the key or encrypted data. Experiment results show that the prosed algorithm takes less time in the encryption and decryption as compared to the competitive approach named efficient selective-ID secure identity-based encryption approach. One of the most important features of the proposed approach is that it hides the user’s identity by using the Lagrange coefficient, which consists of a polynomial interpolation function. The security of the system depends on the hardness of computing the bilinear Diffie-Hellman problem.
••15 May 2011
TL;DR: This paper proposes a new range-based algorithm which is based on decision tree classification and the density-based spatial clustering of applications with noise (DBSCAN) algorithm, which are well known in data mining.
Abstract: Node localization has many applications in wireless networks. For example, it can be used to improve routing and enhance security. Localization algorithms can be classified as range-free or range- based. Range-based algorithms use location metrics such as ToA, TDoA, RSS, and/or AoA to estimate the distance between nodes. Range-free algorithms are based on proximity sensing. Range-based algorithms are more accurate but also more computationally complex. However, in applications such as target tracking, localization accuracy is important. In this paper, we propose a new range-based algorithm which is based on decision tree classification and the density-based spatial clustering of applications with noise (DBSCAN) algorithm, which are well known in data mining. The Euclidean distance between intersection points is used as a distance metric, and the DBSCAN algorithm is applied to a subset of intersection points based on this metric. Different performance measures are used to compare our localization algorithm with linear least squares (LLS) and weighted linear least squares based on singular value decomposition (WLS- SVD). The proposed algorithm is shown to perform better than the LLS and WLS-SVD algorithms even when the anchor geometric distribution about an unlocalized node is poor.
TL;DR: In this work, GWO algorithm is incorporated to spot the correct position of unknown nodes, so as to handle the node localization problem in wireless sensor network (WSN).
Abstract: Seyedali Mirjalili et al. (2014) introduced a completely unique metaheuristic technique particularly grey wolf optimization (GWO). This algorithm mimics the social behavior of grey wolves whereas it follows the leadership hierarchy and attacking strategy. The rising issue in wireless sensor network (WSN) is localization problem. The objective of this problem is to search out the geographical position of unknown nodes with the help of anchor nodes in WSN. In this work, GWO algorithm is incorporated to spot the correct position of unknown nodes, so as to handle the node localization problem. The proposed work is implemented using MATLAB 8.2 whereas nodes are deployed in a random location within the desired network area. The parameters like computation time, percentage of localized node, and minimum localization error measures are utilized to analyse the potency of GWO rule with other variants of metaheuristics algorithms such as particle swarm optimization (PSO) and modified bat algorithm (MBA). The observed results convey that the GWO provides promising results compared to the PSO and MBA in terms of the quick convergence rate and success rate.
TL;DR: The performance investigation in the simulation models and real experiments show that the proposed RSSI-based localization algorithms work properly in both outdoor and large-scale indoor environments, and their performance is comparable to GPS.
Abstract: Localization is an important research topic that has been applied in many different applications. Different wireless technologies have been applied in localization but each has its own limitations. LoRa wireless technology has recently been proposed to support M2M (Machine-to-Machine) and IoT (Internet of Things) applications. Its key features (long range, low power and low cost) show that LoRa technology can be an appropriate alternative for localization in both large-scale indoor and outdoor environments. To the best of our knowledge, we are among the first (1) working on localization using LoRa technology, (2) to develop RSSI-based (Receiver Signal Strength Indicator based) localization algorithms in LoRa networks, and (3) to reduce the effect of Gaussian and non-Gaussian noise during localization in LoRa networks. This paper proposes different RSSI-based localization algorithms to reduce the effect of Gaussian and non-Gaussian noise in LoRa networks. The performance investigation in our simulation models and real experiments show that the proposed localization algorithms work properly in both outdoor and large-scale indoor environments. In outdoor environments, their performance is comparable to GPS (Global Positioning System), the most popular satellite-based localization system.
TL;DR: This paper discussed the various localization algorithms in WSNs with their applicable areas, requirements and limitations, and on conclusion compared these localization algorithms and analyzed the future research directions.
Abstract: Wireless sensor networks (WSNs) have recently emerges as promising technology in wireless communication field and gained special attention by research groups. It uses small and cheap gadgets with low energy requirements and limited on board computing resourceswhich communicates with each other’s or base stations without any pre-defined infrastructure. The property of being infrastructure less makes it suitable in distinctive application situations including remotemonitoring, disaster management, military applications and biomedical health observing devices. In many of these applications, node localization is unavoidably one of the important system parameters for example in target tracking if the nodes are not able to obtain the accurate location information, the related task cannot be performed.It is also helpful in routing, network coverage and quarry management of sensors. In general the localization techniques are ordered into two general classifications: range based and range free. In this paper, we discussed the various localization algorithms with their applicable areas, requirements and limitations. Moreover, on conclusion we compare these localization algorithms and analyze the future research directions for the localization algorithms in WSNs.
TL;DR: This research has developed an outlier detection technique named as iF_Ensemble for Wi-Fi indoor localization environment by analyzing RSSs using the combination of supervised, unsupervised and ensemble machine learning methods.
Abstract: In Internet of things (IoT) millions of devices are intelligently connected for providing smart services. Especially in indoor localization environment, that is one of the most concerning topic of smart cities, internet of things and wireless sensor networks. Many technologies are being used for localization purpose in indoor environment and Wi-Fi using received signal strengths (RSSs) is one of them. Wi-Fi RSSs are sensitive to reflection, refraction, interference and channel noise that cause irregularity in signal strengths. The irregular and anomalous RSS values, used in a Wi-Fi indoor localization environment, cannot define the location of any unknown node correctly. Therefore, this research has developed an outlier detection technique named as iF_Ensemble for Wi-Fi indoor localization environment by analyzing RSSs using the combination of supervised, unsupervised and ensemble machine learning methods. In this research isolation forest (iForest) is used as an unsupervised learning method. Supervised learning method includes support vector machine (SVM), K-nearest neighbor (KNN) and random forest (RF) classifiers with stacking that is an ensemble learning method. For the evaluation purpose accuracy, precision, recall, F-score and ROC-AUC curve are used. The evaluation of used machine learning method provides high accuracy of 97.8 percent with proposed outlier detection methods and almost 2 percent improvement in the accuracy of localization process in indoor environment after eliminating outliers.
01 Oct 2016
TL;DR: An implementation of the classification algorithm for classifying air quality in BSC node for generating the danger status of the warning system and it is shown that the proposed decision tree algorithm has the capability to classify the air quality data from sensor nodes with the accuracy and precision.
Abstract: Currently, the air quality monitoring becomes important things for knowing the value of air pollution especially in the cities. In our previous research, we built the air quality monitoring system using wireless sensor network (WSN). Each sensor nodes will transmit all of the air quality data to the base station controller (BSC). This data consists of weather condition, temperature, humidity, carbon monoxide (CO) and carbon dioxide (CO 2 ). In this paper, we propose an implementation of the classification algorithm for classifying air quality in BSC node for generating the danger status of the warning system. By using the C4.5 algorithm, the entropy and information gain values of each case were determined in order to construct the decision tree structure and building the rule sets. From the experiment using confusion matrix, we can see that the proposed decision tree algorithm has the capability to classify the air quality data from sensor nodes with the accuracy of 85.71%, the precision of 81.82%, the sensitivity of 60.00%, and the specificity of 92.31%.