Deep Learning (DL) algorithms enabled computational models consist of multiple processing layers that represent data with multiple levels of abstraction. In recent years, usage of deep learning is rapidly proliferating in almost every domain, especially in medical image processing, medical image analysis, and bioinformatics. Consequently, deep learning has dramatically changed and improved the means of recognition, prediction, and diagnosis effectively in numerous areas of healthcare such as pathology, brain tumor, lung cancer, abdomen, cardiac, and retina. Considering the wide range of applications of deep learning, the objective of this article is to review major deep learning concepts pertinent to brain tumor analysis (e.g., segmentation, classification, prediction, evaluation.). A review conducted by summarizing a large number of scientific contributions to the field (i.e., deep learning in brain tumor analysis) is presented in this study. A coherent taxonomy of research landscape from the literature has also been mapped, and the major aspects of this emerging field have been discussed and analyzed. A critical discussion section to show the limitations of deep learning techniques has been included at the end to elaborate open research challenges and directions for future work in this emergent area.

Energy constraint is one of the main design issues of wireless sensor networks. Over the past few years, the concept of the wireless mobile charger (WMC) has been proposed in order to improve the energy efficiency of the networks. In such schemes, optimizing the moving trajectory and charging time of WMC are considered as two main problems. Several schemes attempt to optimize the moving trajectory of WMC without considering the balanced energy depletion time of nodes, which leads to degrading the energy efficiency and network lifetime. Thus, a route optimization of WMC algorithm is proposed to determine the optimal trajectory of WMC to move along sensor nodes in such a way that the balanced energy depletion time of the nodes is achieved. Moreover, in most of the existing schemes, WMCs charge the nodes as long as their batteries are fully charged. However, not considering the remaining lifetime of the other nodes leads to premature network death and decreases the network performance. Therefore, a charge time optimization of WMC algorithm is proposed to overcome the mentioned problem. Simulation results demonstrate that the proposed scheme remarkably enhance the network performance in terms of different evaluation metrics.

Wireless Sensor Networks (WSNs) have grown excessively due to their various applications and low installation cost. One of the design challenges of WSNs is to balance the energy consumption among sensor nodes, which results in enhanced network lifetime. In the past few years, several Mobile Sink (MS) based schemes exclusively focus on determining the optimal sojourn time of MS to balance the energy consumption among Cluster Heads (CH). However, most of them are evaluated under unpredictable mobility pattern. Although they significantly improve the network lifetime, however, unpredictable mobility pattern imposes extra overheads on the network. Therefore, Collaborative Mobile Sink Sojourn Time Optimization (CMS2TO) scheme is proposed in this paper. The CMS2TO aims to optimize the sojourn time of MS in each cluster in order to achieve balanced lifetime of CHs belonging to different layers of the network. The main contribution of CMS2TO is to utilize a collaborative mechanism in order to determine the optimal sojourn time of MS in each cluster. In fact, in the proposed scheme, the CHs belonging to other layers cooperate in calculating the sojourn time of MS at the residence cluster. Based on experimental results, proposed CMS2TO enhances the network performance in terms of different performance evaluation metrics.

The key concerns to enhance the lifetime of IoT-enabled Underwater Wireless Sensor Networks (IoT-UWSNs) are energy-efficiency and reliable data delivery under constrained resource. Traditional transmission approaches increase the communication overhead, which results in congestion and affect the reliable data delivery. Currently, many routing protocols have been proposed for UWSNs to ensure reliable data delivery and to conserve the node’s battery with minimum communication overhead (by avoiding void holes in the network). In this paper, adaptive energy-efficient routing protocols are proposed to tackle the aforementioned problems using the Shortest Path First (SPF) with least number of active nodes strategy. These novel protocols have been developed by integrating the prominent features of Forward Layered Multi-path Power Control One (FLMPC-One) routing protocol, which uses 2-hop neighbor information, Forward Layered Multi-path Power Control Two (FLMPC-Two) routing protocol, which uses 3-hop neighbor information and ’Dijkstra’ algorithm (for shortest path selection). Different Packet Sizes (PSs) with different Data Rates (DRs) are also taken into consideration to check the dynamicity of the proposed protocols. The achieved outcomes clearly validate the proposed protocols, namely: Shortest Path First using 3-hop neighbors information (SPF-Three) and Breadth First Search with Shortest Path First using 3-hop neighbors information (BFS-SPF-Three). Simulation results show the effectiveness of the proposed protocols in terms of minimum Energy Consumption (EC) and Required Packet Error Rate (RPER) with a minimum number of active nodes at the cost of affordable delay.