In Wireless Body Area Networks (WBANs) with respect to health care, sensors are positioned inside the body of an individual to transfer sensed data to a central station periodically. The great challenges posed to healthcare WBANs are the black hole and sink hole attacks. Data from deployed sensor nodes are attracted by sink hole or black hole nodes while grabbing the shortest path. Identifying this issue is quite a challenging task as a small variation in medicine intake may result in a severe illness. This work proposes a hybrid detection framework for attacks by applying a Proportional Coinciding Score (PCS) and an MK-Means algorithm, which is a well-known machine learning technique used to raise attack detection accuracy and decrease computational difficulties while giving treatments for heartache and respiratory issues. First, the gathered training data feature count is reduced through data pre-processing in the PCS. Second, the pre-processed features are sent to the MK-Means algorithm for training the data and promoting classification. Third, certain attack detection measures given by the intrusion detection system, such as the number of data packages trans-received, are identified by the MK-Means algorithm. This study demonstrates that the MK-Means framework yields a high detection accuracy with a low packet loss rate, low communication overhead, and reduced end-to-end delay in the network and improves the accuracy of biomedical data.

In the current ongoing crisis, people mostly rely on mobile phones for all the activities, but query analysis and mobile data security are major issues. Several research works have been made on efficient detection of antipatterns for minimizing the complexity of query analysis. However, more focus needs to be given to the accuracy aspect. In addition, for grouping similar antipatterns, a clustering process was performed to eradicate the design errors. To address the above‐said issues and further enhance the antipattern detection accuracy with minimum time and false positive rate, in this work, Random Forest Bagging X‐means SQL Query Clustering (RFBXSQLQC) technique is proposed. Different patterns or queries are initially gathered from the input SQL query log, and bootstrap samples are created. Then, for each pattern, various weak clusters are constructed via X‐means clustering and are utilized as the weak learner (clusters). During this process, the input patterns are categorized into different clusters. Using the Bayesian information criterion, the similarity measure is employed to evaluate the similarity between the patterns and cluster weight. Based on the similarity value, patterns are assigned to either relevant or irrelevant groups. The weak learner results are aggregated to form strong clusters, and, with the aid of voting, a majority vote is considered for designing strong clusters with minimum time. Experiments are conducted to evaluate the performance of the RFBXSQLQC technique using the IIT Bombay dataset using the metrics like antipattern detection accuracy, time complexity, false-positive rate, and computational overhead with respect to the differing number of queries. The results revealed that the RFBXSQLQC technique outperforms the existing algorithms by 19% with pattern detection accuracy, 34% minimized time complexity, 64% false-positive rate, and 31% in terms of computational overhead.

Clustering in wireless sensor networks plays a vital role in solving energy and scalability issues. Although multiple deployment structures and cluster shapes have been implemented, they sometimes fail to produce the expected outcomes owing to different geographical area shapes. This paper proposes a clustering algorithm with a complex deployment structure called radial-shaped clustering (RSC). The deployment structure is divided into multiple virtual concentric rings, and each ring is further divided into sectors called clusters. The node closest to the midpoint of each sector is selected as the cluster head. Each sector’s data are aggregated and forwarded to the sink node through angular inclination routing. We experimented and compared the proposed RSC performance against that of the existing fan-shaped clustering algorithm. Experimental results reveal that RSC outperforms the existing algorithm in scalability and network lifetime for large-scale sensor deployments.

The Internet of Things (IoT) is enhancing our lives in a variety of structures, which consists of smarter cities, agribusiness, and e‐healthcare, among others. Even though the Internet of Things has many features with the consumer Internet of Things, the open nature of smart devices and their worldwide connection make IoT networks vulnerable to a variety of assaults. Several approaches focused on attack detection in Internet of Things devices, which has the longest calculation times and the lowest accuracy issues. It is proposed in this paper that an attack detection framework for Internet of Things devices, based on the DWU‐ODBN method, be developed to alleviate the existing problems. At the end of the process, the proposed method is used to identify the source of the assault. It comprises steps such as preprocessing, feature extraction, feature selection, and classification to identify the source of the attack. A random oversampler is used to preprocess the input data by dealing with NaN values, categorical features, missing values, and unbalanced datasets before being used to deal with the imbalanced dataset. When the data has been preprocessed, it is then sent to the MAD Median‐KS test method, which is used to extract features from the dataset. To categorize the data into attack and nonattack categories, the features are classified using the dual weight updation‐based optimal deep belief network (DWU‐ODBN) classification technique, which is explained in more detail below. According to the results of the experimental assessment, the proposed approach outperforms existing methods in terms of detecting intrusions and assaults. The proposed work achieves 77 seconds to achieve the attack detection with an accuracy rate of 98.1%.

Tuberculosis (TB) is still one of the most serious health issues today with a high fatality rate. While attempts are being made to make primary diagnosis more reliable and accessible in places with high tuberculosis rates, Chest X-rays has become a popular source. However, specialist radiologists are required for the screening process, which could be a challenge in developing countries. For early diagnosis of tuberculosis utilizing CXR images, a complete automatic system of tuberculosis detection can decrease the need for trained staff. Various deep learning and machine learning technologies have been introduced in recent years for examining digital chest radiographs for TB-related variances with the goal of reducing inter-class reader variability and reproducibility, as well as providing radiologic services in areas where radiologists are not available. Tuberculosis is sometimes misclassified as other conditions with similar radiographic patterns as a result of CXR images, resulting in inefficient therapy. The current approach, however, is limited to Computer-Aided Detection (CAD), which has only been evaluated with non-deep learning models. Deep neural networks open potentially new avenues for tuberculosis treatment. There are no peer-reviewed studies comparing the effectiveness of various deep learning systems in detecting TB anomalies, and none compare multiple deep learning systems with human readers. In this paper, the aim of the proposed method is to develop an efficient tuberculosis detection system based on stochastic learning with artificial neural network (ANN) model by random variations using Chest X-ray images. This approach can able to incorporate random functions into the network, either by assigning stochastic transfer functions to the network or by assigning stochastic weights to the network. This proposed method is to learn features from CXR images and optimize the parameters of an ANN model by randomly mixing the training dataset before each iteration, resulting in varied ordering of model parameter updates. Furthermore, in a neural network, model weights are frequently initialized at a random beginning point. By focusing on randomness functions with optimization, the proposed technique achieved great accuracy. The motivation of the proposed method is to detect abnormalities in CXR with the different levels of complexity of TB by strong or weak evidence with different deep geometric contexts such as shape, size, cavitation, and density. ANN’s primary benefit is extracting hidden linear and non-linear inter-relationships of high-dimensional and complex data. The proposed method was systematically tested with the Shenzhen and Montgomery datasets using metrics such as sensitivity, specificity, and accuracy, and it was discovered that the proposed method attained better accuracy when compared to state-of-the-art methods. The proposed method shows an improved efficiency with sensitivity of 96.12%, specificity of 98.01%, accuracy 98.45% and F-Score 95.88% respectively.