Data-Centric Routing for Intra Wireless Body Sensor Networks.

A significant proportion of the worldwide population is of the elderly people living with chronic diseases that result in high health-care cost. To provide continuous health monitoring with minimal health-care cost, Wireless Body Sensor Networks (WBSNs) has been recently emerged as a promising technology. Depending on nature of sensory data, WBSNs might require a high level of Quality of Service (QoS) both in terms of delay and reliability during data reporting phase. In this paper, we propose a data-centric routing for intra WBSNs that adapts the routing strategy in accordance with the nature of data, temperature rise issue of the implanted bio-medical sensors due to electromagnetic wave absorption, and high and dynamic path loss caused by postural movement of human body and in-body wireless communication. We consider the network models both with and without relay nodes in our simulations. Due to the multi-facet routing strategy, the proposed data-centric routing achieves better performance in terms of delay, reliability, temperature rise, and energy consumption when compared with other state-of-the-art.

A comprehensive study of data collection schemes using mobile sinks in wireless sensor networks.

Recently sink mobility has been exploited in numerous schemes to prolong the lifetime of wireless sensor networks (WSNs). Contrary to traditional WSNs where sensory data from sensor field is ultimately sent to a static sink, mobile sink-based approaches alleviate energy-holes issues thereby facilitating balanced energy consumption among nodes. In mobility scenarios, nodes need to keep track of the latest location of mobile sinks for data delivery. However, frequent propagation of sink topological updates undermines the energy conservation goal and therefore should be controlled. Furthermore, controlled propagation of sinks' topological updates affects the performance of routing strategies thereby increasing data delivery latency and reducing packet delivery ratios. This paper presents a taxonomy of various data collection/dissemination schemes that exploit sink mobility. Based on how sink mobility is exploited in the sensor field, we classify existing schemes into three classes, namely path constrained, path unconstrained, and controlled sink mobility-based schemes. We also organize existing schemes based on their primary goals and provide a comparative study to aid readers in selecting the appropriate scheme in accordance with their particular intended applications and network dynamics. Finally, we conclude our discussion with the identification of some unresolved issues in pursuit of data delivery to a mobile sink.

A survey of routing protocols in wireless body sensor networks.

Wireless Body Sensor Networks (WBSNs) constitute a subset of Wireless Sensor Networks (WSNs) responsible for monitoring vital sign-related data of patients and accordingly route this data towards a sink. In routing sensed data towards sinks, WBSNs face some of the same routing challenges as general WSNs, but the unique requirements of WBSNs impose some more constraints that need to be addressed by the routing mechanisms. This paper identifies various issues and challenges in pursuit of effective routing in WBSNs. Furthermore, it provides a detailed literature review of the various existing routing protocols used in the WBSN domain by discussing their strengths and weaknesses.

An Improved Strategy for Task Scheduling in the Parallel Computational Alignment of Multiple Sequences.

Task scheduling in parallel multiple sequence alignment (MSA) through improved dynamic programming optimization speeds up alignment processing. The increased importance of multiple matching sequences also needs the utilization of parallel processor systems. This dynamic algorithm proposes improved task scheduling in case of parallel MSA. Specifically, the alignment of several tertiary structured proteins is computationally complex than simple word-based MSA. Parallel task processing is computationally more efficient for protein-structured based superposition. The basic condition for the application of dynamic programming is also fulfilled, because the task scheduling problem has multiple possible solutions or options. Search space reduction for speedy processing of this algorithm is carried out through greedy strategy. Performance in terms of better results is ensured through computationally expensive recursive and iterative greedy approaches. Any optimal scheduling schemes show better performance in heterogeneous resources using CPU or GPU.

A computational classification method of breast cancer images using the VGGNet model.

Cancer is one of the most prevalent diseases worldwide. The most prevalent condition in women when aberrant cells develop out of control is breast cancer. Breast cancer detection and classification are exceedingly difficult tasks. As a result, several computational techniques, including k-nearest neighbor (KNN), support vector machine (SVM), multilayer perceptron (MLP), decision tree (DT), and genetic algorithms, have been applied in the current computing world for the diagnosis and classification of breast cancer. However, each method has its own limitations to how accurately it can be utilized. A novel convolutional neural network (CNN) model based on the Visual Geometry Group network (VGGNet) was also suggested in this study. The 16 layers in the current VGGNet-16 model lead to overfitting on the training and test data. We, thus, propose the VGGNet-12 model for breast cancer classification. The VGGNet-16 model has the problem of overfitting the breast cancer classification dataset. Based on the overfitting issues in the existing model, this research reduced the number of different layers in the VGGNet-16 model to solve the overfitting problem in this model. Because various models of the VGGNet, such as VGGNet-13 and VGGNet-19, were developed, this study proposed a new version of the VGGNet model, that is, the VGGNet-12 model. The performance of this model is checked using the breast cancer dataset, as compared to the CNN and LeNet models. From the simulation result, it can be seen that the proposed VGGNet-12 model enhances the simulation result as compared to the model used in this study. Overall, the experimental findings indicate that the suggested VGGNet-12 model did well in classifying breast cancer in terms of several characteristics.

Multiconstraint-Aware Routing Mechanism for Wireless Body Sensor Networks.

The merger of wireless sensor technologies, pervasive computing, and biomedical engineering has resulted in the emergence of wireless body sensor network (WBSN). WBSNs assist human beings in various monitoring applications such as health-care, entertainment, rehabilitation systems, and sports. Life-critical health-care applications of WBSNs consider both reliability and delay as major Quality of Service (QoS) parameters. In addition to the common limitations and challenges of wireless sensor networks (WSNs), WBSNs pose distinct constraints due to the behavior and chemistry of the human body. The biomedical sensor nodes (BMSNs) adopt multihop communication while reporting the heterogeneous natured physiological parameters to the nearby base station also called local coordinator. Routing in WBSNs becomes a challenging job due to the necessary QoS considerations, overheated in-body BMSNs, and high and dynamic path loss. To the best of our knowledge, none of the existing routing protocols integrate the aforementioned issues in their designs. In this research work, a multiconstraint-aware routing mechanism (modular-based) is proposed which considers the QoS parameters, dynamic and high path loss, and the overheated nodes issue. Two types of network frameworks, with and without relay/forwarder nodes, are being used. The data packets containing physiological parameters of the human body are categorized into delay-constrained, reliability-constrained, critical (both delay- and reliability-constrained), and nonconstrained data packets. NS-2 is being used to carry out the simulations of the proposed mechanism. The simulation results reveal that the proposed mechanism has improved the QoS-aware routing for WBSNs by adopting the proposed multiconstraint-aware strategy.