Recent research in underwater wireless sensor networks (UWSNs) has gained the attention of researchers in academia and industry for a number of applications. They include disaster and earthquake prediction, water quality and environment monitoring, leakage and mine detection, military surveillance and underwater navigation. However, the aquatic medium is associated with a number of limitations and challenges: long multipath delay, high interference and noise, harsh environment, low bandwidth and limited battery life of the sensor nodes. These challenges demand research techniques and strategies to be overcome in an efficient and effective fashion. The design of routing protocols for UWSNs is one of the promising solutions to cope with these challenges. This paper presents a survey of the routing protocols for UWSNs. For the ease of description, the addressed routing protocols are classified into two groups: localization-based and localization-free protocols. These groups are further subdivided according to the problems they address or the major parameters they consider during routing. Unlike the existing surveys, this survey considers only the latest and state-of-the-art routing protocols. In addition, every protocol is described in terms of its routing strategy and the problem it addresses and solves. The merit(s) of each protocol is (are) highlighted along with the cost. A description of the protocols in this fashion has a number of advantages for researchers, as compared to the existing surveys. Firstly, the description of the routing strategy of each protocol makes its routing operation easily understandable. Secondly, the demerit(s) of a protocol provides (provide) insight into overcoming its flaw(s) in future investigation. This, in turn, leads to the foundation of new protocols that are more intelligent, robust and efficient with respect to the desired parameters. Thirdly, a protocol can be selected for the appropriate application based on its described merit(s). Finally, open challenges and research directions are presented for future investigation.

This paper surveys the short-term road traffic forecast algorithms based on the long-short term memory (LSTM) model of deep learning. The algorithms developed in the last three years are studied and analyzed. This provides an in-depth and thorough description of the algorithms rather than their marginal description as performed in the existing surveys that focus on general deep learning algorithms. The chosen algorithms are classified depending upon the use of LSTM in combination with other techniques for processing input data features towards a final traffic forecast. The operational strategies of the algorithms are described with merits and limitations. Moreover, a comparative analysis of the compared classes of algorithms is also provided. These strategies are helpful in selection of the right algorithms and their classes for the diverse traffic conditions and their future investigation for improvement. Besides, the applications of these classes of algorithms to traffic forecast in various networks for the latest decade is graphically depicted. Moreover, the applications of the LSTM in other fields involving a forecast are provided. Finally, the challenges associated with the short-term traffic forecast using the LSTM are described and strategies are highlighted for their future investigation.

This paper provides a study of the latest target (object) detection algorithms for underwater wireless sensor networks (UWSNs). To ensure selection of the latest and state-of-the-art algorithms, only algorithms developed in the last seven years are taken into account that are not entirely addressed by the existing surveys. These algorithms are classified based on their architecture and methodologies of operation and their applications are described that are helpful in their selection in a diverse set of applications. The merits and demerits of the algorithms are also addressed that are helpful to improve their performance in future investigation. Moreover, a comparative analysis of the described algorithms is also given that further provides an insight to their selection in various applications and future enhancement. A depiction of the addressed algorithms in various applications based on publication count over the latest decade (2023-2013) is also given using the IEEE database that is helpful in knowing their future application trend. Finally, the challenges associated with the underwater target detection are highlighted and the future research paradigms are identified. The conducted study is helpful in providing a thorough analysis of the underwater target detection algorithms, their feasibility in various applications with future challenges and defined strategies for further investigation.

Smart grid (SG) vision has come to incorporate various communication technologies, which facilitate residential users to adopt different scheduling schemes in order to manage energy usage with reduced carbon emission. In this work, we have proposed a residential load management mechanism with the incorporation of energy resources (RESs) i.e., solar energy. For this purpose, a real-time electricity price (RTP), energy demand, user preferences and renewable energy parameters are taken as an inputs and genetic algorithm (GA) has been used to manage and schedule residential load with the objective of cost, user discomfort, and peak-to-average ratio (PAR) reduction. Initially, RTP is used to reduce the energy consumption cost. However, to minimize the cost along with reducing the peaks, a combined pricing model, i.e., RTP with inclining block rate (IBR) has been used which incorporates user preferences and RES to optimally schedule load demand. User comfort and cost reduction are contradictory objectives, and difficult to maximize, simultaneously. Considering this trade-off, a combined pricing scheme is modelled in such a way that users are given priority to achieve their objective as per their requirements. To validate and analyze the performance of the proposed algorithm, we first propose mathematical models of all utilized loads, and then multi-objective optimization problem has been formulated. Furthermore, analytical results regarding the objective function and the associated constraints have also been provided to validate simulation results. Simulation results demonstrate a significant reduction in the energy cost along with the achievement of both grid stability in terms of reduced peak and high comfort.

The sheer volume of movies generated these days requires an automated analytics for efficient classification, query-based search, and extraction of desired information. These tasks can only be efficiently performed by a machine learning based algorithm. We address the same issue in this paper by proposing a deep learning based technique for predicting the relevant tags for a movie and segmenting the movie with respect to the predicted tags. We construct a tag vocabulary and create the corresponding dataset in order to train a deep learning model. Subsequently, we propose an efficient shot detection algorithm to find the key frames in the movie. The extracted key frames are analyzed by the deep learning model to predict the top three tags for each frame. The tags are then assigned weighted scores and are filtered to generate a compact set of most relevant tags. This process also generates a corpus which is further used to segment a movie based on a selected tag. We present a rigorous analysis of the segmentation quality with respect to the number of tags selected for the segmentation. Our detailed experiments demonstrate that the proposed technique is not only efficacious in predicting the most relevant tags for a movie, but also in segmenting the movie with respect to the selected tags with a high accuracy.

Multivariate data sets are common in various application areas, such as wireless sensor networks (WSNs) and DNA analysis. A robust mechanism is required to compute their similarity indexes regardless of the environment and problem domain. This study describes the usefulness of a non-metric-based approach (i.e., longest common subsequence) in computing similarity indexes. Several non-metric-based algorithms are available in the literature, the most robust and reliable one is the dynamic programming-based technique. However, dynamic programming-based techniques are considered inefficient, particularly in the context of multivariate data sets. Furthermore, the classical approaches are not powerful enough in scenarios with multivariate data sets, sensor data or when the similarity indexes are extremely high or low. To address this issue, we propose an efficient algorithm to measure the similarity indexes of multivariate data sets using a non-metric-based methodology. The proposed algorithm performs exceptionally well on numerous multivariate data sets compared with the classical dynamic programming-based algorithms. The performance of the algorithms is evaluated on the basis of several benchmark data sets and a dynamic multivariate data set, which is obtained from a WSN deployed in the Ghulam Ishaq Khan (GIK) Institute of Engineering Sciences and Technology. Our evaluation suggests that the proposed algorithm can be approximately 39.9% more efficient than its counterparts for various data sets in terms of computational time.