Cardiovascular diseases (CVDs) kill about 20.5 million people every year. Early prediction can help people to change their lifestyles and to ensure proper medical treatment if necessary. In this research, ten machine learning (ML) classifiers from different categories, such as Bayes, functions, lazy, meta, rules, and trees, were trained for efficient heart disease risk prediction using the full set of attributes of the Cleveland heart dataset and the optimal attribute sets obtained from three attribute evaluators. The performance of the algorithms was appraised using a 10-fold cross-validation testing option. Finally, we performed tuning of the hyperparameter number of nearest neighbors, namely, ‘k’ in the instance-based (IBk) classifier. The sequential minimal optimization (SMO) achieved an accuracy of 85.148% using the full set of attributes and 86.468% was the highest accuracy value using the optimal attribute set obtained from the chi-squared attribute evaluator. Meanwhile, the meta classifier bagging with logistic regression (LR) provided the highest ROC area of 0.91 using both the full and optimal attribute sets obtained from the ReliefF attribute evaluator. Overall, the SMO classifier stood as the best prediction method compared to other techniques, and IBk achieved an 8.25% accuracy improvement by tuning the hyperparameter ‘k’ to 9 with the chi-squared attribute set.

Developing a reliable and accurate indoor localization system is a crucial step for creating a seamless and interactive user-device experience in nearly all intelligent internet of things (IIoTs) and smart applications. Indoor localization systems based on WiFi fingerprinting have been considered as a promising alternative to model-based approaches owing to their accuracy, low cost, availability, and ease of configuration. However, recent studies have revealed that in complex environments, WiFi fingerprinting techniques are faced with a lot of challenges as the coverage area increases. These challenges include fingerprint spatial uncertainty, instability in the received signal strength indicator (RSSI) and discrepancy in fingerprint distribution. Furthermore, there is frequent need for database upgrades or even recreation whenever there is a change in the architecture of the location. These challenges have questioned the robustness and efficiency of most of the existing schemes. In this paper, we present an indoor localization architecture for complex multi-building multi-floor location prediction and subsequently propose SALLoc (SAE-ALSTM Localization), a WiFi fingerprinting indoor localization scheme based on Stacked Autoencoder (SAE) and Attention-based Long Short-Time Memory (ALSTM) framework. Firstly, stratified sampling technique is used to separate validation set from the entire uneven RSSI training set which ensures that the same proportion of RSSI samples are present in both sets. Secondly, SAE is utilized to select core features and decrease the dimensions of the RSSI samples. Finally, ALSTM is trained to focus on these features to achieve robust location prediction. Extensive investigations were conducted using UJIIndoorLoc, Tampere and UTSIndoorLoc datasets, and the results obtained demonstrated the superiority of the proposed scheme in terms of prediction accuracy, robustness, and generalizations when compared to state-of-the-art methods. The mean localization error (MLE) on UJIIndoorLoc, Tampere and UTSIndoorLoc datasets are 8.28 m, 9.52 m, and 6.48 m respectively. Consequently, it can be concluded that the proposed scheme is accurate and well-suited for large-scale indoor environment location prediction.

Communication in industrial wireless networks necessitates reliability and precision. Besides, the existence of interference or traffic in the network must not affect the estimated network properties. Therefore, data packets have to be sent within a certain time frame and over a reliable connection. However, the working scenarios and the characteristics of the network itself make it vulnerable to node or link faults, which impact the transmission reliability and overall performance. This article aims to introduce a developed multipath routing model, which leads to cost-effective planning, low latency and high reliability of industrial wireless mesh networks, such as the WirelessHART networks. The multipath routing model has three primary paths, and each path has a backup node. The backup node stores the data transmitted by the parent node to grant communication continuity when primary nodes fail. The multipath routing model is developed based on optimal network planning and deployment algorithm. Simulations were conducted on a WirelessHART simulator using Network Simulator (NS2). The performance of the developed model is compared with the state-of-the-art. The obtained results reveal a significant reduction in the average network latency, low power consumption, better improvement in expected network lifetime, and enhanced packet delivery ratio which improve network reliability.

The placement of wireless mesh routers is a significant matter in enhancing the performance of a wireless mesh network. Therefore, it is essential that the mesh routers are optimally placed to guarantee strong connectivity and coverage for ensuring the best network accessibility. The importance of this issue has motivated the researchers to pursue more investigation on optimizing the networks’ performance. Various optimization algorithms have been developed in the literature to identify the trade-offs between network connectivity and client coverage. This work is aimed at implementing a novel application of Harris Hawk’s Optimization (HHO) algorithm to optimally place mesh routers in a wireless mesh network so as to improve connectivity and coverage. The HHO seeks optimal routers placement that leads to maximizing the connection between routers and increasing the number of covered clients. In this study, three network configurations are used with sizes of 40, 60, and 100 mesh routers. The simulation results are statistically analyzed and compared to other population-based algorithms such as Sine Cosine Algorithm (SCA), Gray Wolf’s Optimization (GWO), and Particle Swarm Optimization (PSO). Moreover, the performance of HHO is compared with the state-of-the-art to validate the effectiveness of the proposed approach. The simulation findings and statistical analysis confirm that the HHO outperforms the other algorithms in terms of network coverage and connectivity. The outcomes demonstrate that HHO can be considered an efficacious means to enhance the performance of wireless mesh networks (WMNs).

Wireless sensor networks (WSNs) have received considerable interest in recent years. These sensor nodes can gather information from the surrounding environment and transmit it to a designated location. Each sensor node in WSN typically has a battery with a limited capacity. Due to their large number and because of various environmental challenges, it is sometimes hard to replace this finite battery. As a result, energy-efficient communication is seen as a critical aspect in extending the lifespan of a sensor node. On the other hand, some applications that require large coverage and generate various sorts of data packets require multi-hop routing and quality of service (QoS) features. Therefore, in order to avoid network failure, these applications need an energy-efficient QoS MAC protocol that can support multiple levels of data packet priority and multi-hop routing features while focusing on energy conservation. An energy-aware QoS MAC protocol based on Prioritized Data and Multi-hop routing (EQPD-MAC) is proposed in this article. The EQPD-MAC protocol offers a simple yet effective cross-layer communication method. It provides timely delivery of multi-priority packets, uses an adaptive active time to limit idle listening, and integrates a robust routing protocol. Finally, the EQPD-MAC protocol’s performance was evaluated and compared to three other well-known QoS MAC protocols. The simulation findings show that the proposed protocol significantly decreases sensor node energy consumption by up to 30.3%, per-bit energy consumption by up to 29.6%, sink node energy consumption by up to 27.4% and increases throughput by up to 23.3%.

A wireless sensor network (WSN) deploys hundreds or thousands of nodes that may introduce large-scale data over time. Dealing with such an amount of collected data is a real challenge for energy-constraint sensor nodes. Therefore, numerous research works have been carried out to design efficient data clustering techniques in WSNs to eliminate the amount of redundant data before transmitting them to the sink while preserving their fundamental properties. This paper develops a new error-aware data clustering (EDC) technique at the cluster-heads (CHs) for in-network data reduction. The proposed EDC consists of three adaptive modules that allow users to choose the module that suits their requirements and the quality of the data. The histogram-based data clustering (HDC) module groups temporal correlated data into clusters and eliminates correlated data from each cluster. Recursive outlier detection and smoothing (RODS) with HDC module provides error-aware data clustering, which detects random outliers using temporal correlation of data to maintain data reduction errors within a predefined threshold. Verification of RODS (V-RODS) with HDC module detects not only random outliers but also frequent outliers simultaneously based on both the temporal and spatial correlations of the data. The simulation results show that the proposed EDC is computationally cheap, able to reduce a significant amount of redundant data with minimum error, and provides efficient error-aware data clustering solutions for remote monitoring environmental applications.