Classifier-Based Data Transmission Reduction in Wearable Sensor Network for Human Activity Monitoring

A Multi-Agent Prediction Method for Data Sampling and Transmission Reduction in Internet of Things Sensor Networks

Sensor networks can provide valuable real-time data for various IoT applications. However, the amount of sensed and transmitted data should be kept at a low level due to the limitations imposed by network bandwidth, data storage, processing capabilities, and finite energy resources. In this paper, a new method is introduced that uses the predicted intervals of possible sensor readings to efficiently suppress unnecessary transmissions and decrease the amount of data samples collected by a sensor node. In the proposed method, the intervals of possible sensor readings are determined with a multi-agent system, where each agent independently explores a historical dataset and evaluates the similarity between past and current sensor readings to make predictions. Based on the predicted intervals, it is determined whether the real sensed data can be useful for a given IoT application and when the next data sample should be transmitted. The prediction algorithm is executed by the IoT gateway or in the cloud. The presented method is applicable to IoT sensor networks that utilize low-end devices with limited processing power, memory, and energy resources. During the experiments, the advantages of the introduced method were demonstrated by considering the criteria of prediction interval width, coverage probability, and transmission reduction. The experimental results confirm that the introduced method improves the accuracy of prediction intervals and achieves a higher rate of transmission reduction compared with state-of-the-art prediction methods.

Spectrum Evaluation in CR-Based Smart Healthcare Systems Using Optimizable Tree Machine Learning Approach

The rapid technological advancements in the current modern world bring the attention of researchers to fast and real-time healthcare and monitoring systems. Smart healthcare is one of the best choices for this purpose, in which different on-body and off-body sensors and devices monitor and share patient data with healthcare personnel and hospitals for quick and real-time decisions about patients' health. Cognitive radio (CR) can be very useful for effective and smart healthcare systems to send and receive patient's health data by exploiting the primary user's (PU) spectrum. In this paper, tree-based algorithms (TBAs) of machine learning (ML) are investigated to evaluate spectrum sensing in CR-based smart healthcare systems. The required data sets for TBAs are created based on the probability of detection (Pd) and probability of false alarm (Pf). These data sets are used to train and test the system by using fine tree, coarse tree, ensemble boosted tree, medium tree, ensemble bagged tree, ensemble RUSBoosted tree, and optimizable tree. Training and testing accuracies of all TBAs are calculated for both simulated and theoretical data sets. The comparison of training and testing accuracies of all classifiers is presented for the different numbers of received signal samples. Results depict that optimizable tree gives the best accuracy results to evaluate the spectrum sensing with minimum classification error (MCE).

Data transmission reduction formalization for cloud offloading-based IoT systems

Computation offloading is the solution for IoT devices of limited resources and high-cost processing requirements. However, the network related issues such as latency and bandwidth consumption need to be considered. Data transmission reduction is one of the solutions aiming to solve network related problems by reducing the amount of data transmitted. In this paper, we propose a generalized formal data transmission reduction model independent of the system and the data type. This formalization is based on two main ideas: 1) Not sending data until a significant change occurs, 2) Sending a lighter size entity permitting the cloud to deduct the data captured by the IoT device without actually receiving it. This paper includes the mathematical representation of the model, general evaluation metrics formulas as well as detailed projections on real world use cases.

Ensemble of RNN Classifiers for Activity Detection Using a Smartphone and Supporting Nodes

Nowadays, sensor-equipped mobile devices allow us to detect basic daily activities accurately. However, the accuracy of the existing activity recognition methods decreases rapidly if the set of activities is extended and includes training routines, such as squats, jumps, or arm swings. Thus, this paper proposes a model of a personal area network with a smartphone (as a main node) and supporting sensor nodes that deliver additional data to increase activity-recognition accuracy. The introduced personal area sensor network takes advantage of the information from multiple sensor nodes attached to different parts of the human body. In this scheme, nodes process their sensor readings locally with the use of recurrent neural networks (RNNs) to categorize the activities. Then, the main node collects results from supporting sensor nodes and performs a final activity recognition run based on a weighted voting procedure. In order to save energy and extend the network's lifetime, sensor nodes report their local results only for specific types of recognized activity. The presented method was evaluated during experiments with sensor nodes attached to the waist, chest, leg, and arm. The results obtained for a set of eight activities show that the proposed approach achieves higher recognition accuracy when compared with the existing methods. Based on the experimental results, the optimal configuration of the sensor nodes was determined to maximize the activity-recognition accuracy and reduce the number of transmissions from supporting sensor nodes.

Machine Learning for Healthcare Wearable Devices: The Big Picture

Using artificial intelligence and machine learning techniques in healthcare applications has been actively researched over the last few years. It holds promising opportunities as it is used to track human activities and vital signs using wearable devices and assist in diseases' diagnosis, and it can play a great role in elderly care and patient's health monitoring and diagnostics. With the great technological advances in medical sensors and miniaturization of electronic chips in the recent five years, more applications are being researched and developed for wearable devices. Despite the remarkable growth of using smart watches and other wearable devices, a few of these massive research efforts for machine learning applications have found their way to market. In this study, a review of the different areas of the recent machine learning research for healthcare wearable devices is presented. Different challenges facing machine learning applications on wearable devices are discussed. Potential solutions from the literature are presented, and areas open for improvement and further research are highlighted.

A Population-Based Iterated Greedy Algorithm for Maximizing Sensor Network Lifetime

Finding dominating sets in graphs is very important in the context of numerous real-world applications, especially in the area of wireless sensor networks. This is because network lifetime in wireless sensor networks can be prolonged by assigning sensors to disjoint dominating node sets. The nodes of these sets are then used by a sleep-wake cycling mechanism in a sequential way; that is, at any moment in time, only the nodes from exactly one of these sets are switched on while the others are switched off. This paper presents a population-based iterated greedy algorithm for solving a weighted version of the maximum disjoint dominating sets problem for energy conservation purposes in wireless sensor networks. Our approach is compared to the ILP solver, CPLEX, which is an existing local search technique, and to our earlier greedy algorithm. This is performed through its application to 640 random graphs from the literature and to 300 newly generated random geometric graphs. The results show that our algorithm significantly outperforms the competitors.

Data Transmission Reduction in Wireless Sensor Network for Spatial Event Detection

Wireless sensor networks have found many applications in detecting events such as security threats, natural hazards, or technical malfunctions. An essential requirement for event detection systems is the long lifetime of battery-powered sensor nodes. This paper introduces a new method for prolonging the wireless sensor network’s lifetime by reducing data transmissions between neighboring sensor nodes that cooperate in event detection. The proposed method allows sensor nodes to decide whether they need to exchange sensor readings for correctly detecting events. The sensor node takes into account the detection algorithm and verifies whether its current sensor readings can impact the event detection performed by another node. The data are transmitted only when they are found to be necessary for event detection. The proposed method was implemented in a wireless sensor network to detect the instability of cargo boxes during transportation. Experimental evaluation confirmed that the proposed method significantly extends the network lifetime and ensures the accurate detection of events. It was also shown that the introduced method is more effective in reducing data transmissions than the state-of-the-art event-triggered transmission and dual prediction algorithms.

A Greedy Heuristic for Maximizing the Lifetime of Wireless Sensor Networks Based on Disjoint Weighted Dominating Sets

Dominating sets are among the most well-studied concepts in graph theory, with many real-world applications especially in the area of wireless sensor networks. One way to increase network lifetime in wireless sensor networks consists of assigning sensors to disjoint dominating node sets, which are then sequentially used by a sleep–wake cycling mechanism. This paper presents a greedy heuristic for solving a weighted version of the maximum disjoint dominating sets problem for energy conservation purposes in wireless sensor networks. Moreover, an integer linear programming model is presented. Experimental results based on a large set of 640 problem instances show, first, that the integer linear programming model is only useful for small problem instances. Moreover, they show that our algorithm outperforms recent local search algorithms from the literature with respect to both solution quality and computation time.