Adaptive Node Clustering for Underwater Sensor Networks.

Monitoring of an underwater environment and communication is essential for many applications, such as sea habitat monitoring, offshore investigation and mineral exploration, but due to underwater current, low bandwidth, high water pressure, propagation delay and error probability, underwater communication is challenging. In this paper, we proposed a sensor node clustering technique for UWSNs named as adaptive node clustering technique (ANC-UWSNs). It uses a dragonfly optimization (DFO) algorithm for selecting ideal measure of clusters needed for routing. The DFO algorithm is inspired by the swarming behavior of dragons. The proposed methodology correlates with other algorithms, for example the ant colony optimizer (ACO), comprehensive learning particle swarm optimizer (CLPSO), gray wolf optimizer (GWO) and moth flame optimizer (MFO). Grid size, transmission range and nodes density are used in a performance matrix, which varies during simulation. Results show that DFO outperform the other algorithms. It produces a higher optimized number of clusters as compared to other algorithms and hence optimizes overall routing and increases the life span of a network.

Adaptive Node Clustering Technique for Smart Ocean Under Water Sensor Network (SOSNET).

Abstract: Smart ocean is a term broadly used for monitoring the ocean surface, sea habitat monitoring, and mineral exploration to name a few. Development of an efficient routing protocol for smart oceans is a non-trivial task because of various challenges, such as presence of tidal waves, multiple sources of noise, high propagation delay, and low bandwidth. In this paper, we have proposed a routing protocol named adaptive node clustering technique for smart ocean underwater sensor network (SOSNET). SOSNET employs a moth flame optimizer (MFO) based technique for selecting a near optimal number of clusters required for routing. MFO is a bio inspired optimization technique, which takes into account the movement of moths towards light. The SOSNET algorithm is compared with other bio inspired algorithms such as comprehensive learning particle swarm optimization (CLPSO), ant colony optimization (ACO), and gray wolf optimization (GWO). All these algorithms are used for routing optimization. The performance metrics used for this comparison are transmission range of nodes, node density, and grid size. These parameters are varied during the simulation, and the results indicate that SOSNET performed better than other algorithms.

Transfer Learning Assisted Classification and Detection of Alzheimer's Disease Stages Using 3D MRI Scans.

Alzheimer's disease effects human brain cells and results in dementia. The gradual deterioration of the brain cells results in disability of performing daily routine tasks. The treatment for this disease is still not mature enough. However, its early diagnosis may allow restraining the spread of disease. For early detection of Alzheimer's through brain Magnetic Resonance Imaging (MRI), an automated detection and classification system needs to be developed that can detect and classify the subject having dementia. These systems also need not only to classify dementia patients but to also identify the four progressing stages of dementia. The proposed system works on an efficient technique of utilizing transfer learning to classify the images by fine-tuning a pre-trained convolutional network, AlexNet. The architecture is trained and tested over the pre-processed segmented (Grey Matter, White Matter, and Cerebral Spinal Fluid) and un-segmented images for both binary and multi-class classification. The performance of the proposed system is evaluated over Open Access Series of Imaging Studies (OASIS) dataset. The algorithm showed promising results by giving the best overall accuracy of 92.85% for multi-class classification of un-segmented images.

Energy Aware Cluster-Based Routing in Flying Ad-Hoc Networks.

Flying ad-hoc networks (FANETs) are a very vibrant research area nowadays. They have many military and civil applications. Limited battery energy and the high mobility of micro unmanned aerial vehicles (UAVs) represent their two main problems, i.e., short flight time and inefficient routing. In this paper, we try to address both of these problems by means of efficient clustering. First, we adjust the transmission power of the UAVs by anticipating their operational requirements. Optimal transmission range will have minimum packet loss ratio (PLR) and better link quality, which ultimately save the energy consumed during communication. Second, we use a variant of the K-Means Density clustering algorithm for selection of cluster heads. Optimal cluster heads enhance the cluster lifetime and reduce the routing overhead. The proposed model outperforms the state of the art artificial intelligence techniques such as Ant Colony Optimization-based clustering algorithm and Grey Wolf Optimization-based clustering algorithm. The performance of the proposed algorithm is evaluated in term of number of clusters, cluster building time, cluster lifetime and energy consumption.

An autonomous mixed data oversampling method for AIOT-based churn recognition and personalized recommendations using behavioral segmentation.

The telecom sector is currently undergoing a digital transformation by integrating artificial intelligence (AI) and Internet of Things (IoT) technologies. Customer retention in this context relies on the application of autonomous AI methods for analyzing IoT device data patterns in relation to the offered service packages. One significant challenge in existing studies is treating churn recognition and customer segmentation as separate tasks, which diminishes overall system accuracy. This study introduces an innovative approach by leveraging a unified customer analytics platform that treats churn recognition and segmentation as a bi-level optimization problem. The proposed framework includes an Auto Machine Learning (AutoML) oversampling method, effectively handling three mixed datasets of customer churn features while addressing imbalanced-class distribution issues. To enhance performance, the study utilizes the strength of oversampling methods like synthetic minority oversampling technique for nominal and continuous features (SMOTE-NC) and synthetic minority oversampling with encoded nominal and continuous features (SMOTE-ENC). Performance evaluation, using 10-fold cross-validation, measures accuracy and F1-score. Simulation results demonstrate that the proposed strategy, particularly Random Forest (RF) with SMOTE-NC, outperforms standard methods with SMOTE. It achieves accuracy rates of 79.24%, 94.54%, and 69.57%, and F1-scores of 65.25%, 81.87%, and 45.62% for the IBM, Kaggle Telco and Cell2Cell datasets, respectively. The proposed method autonomously determines the number and density of clusters. Factor analysis employing Bayesian logistic regression identifies influential factors for accurate customer segmentation. Furthermore, the study segments consumers behaviorally and generates targeted recommendations for personalized service packages, benefiting decision-makers.

An autonomous decision-making framework for gait recognition systems against adversarial attack using reinforcement learning.

Gait identification based on Deep Learning (DL) techniques has recently emerged as biometric technology for surveillance. We leveraged the vulnerabilities and decision-making abilities of the DL model in gait-based autonomous surveillance systems when attackers have no access to underlying model gradients/structures using a patch-based black-box adversarial attack with Reinforcement Learning (RL). These automated surveillance systems are secured, blocking the attacker's access. Therefore, the attack can be conducted in an RL framework where the agent's goal is determining the optimal image location, causing the model to perform incorrectly when perturbed with random pixels. Furthermore, the proposed adversarial attack presents encouraging results (maximum success rate = 77.59%). Researchers should explore system resilience scenarios (e.g., when attackers have no system access) before using these models in surveillance applications.

Social distancing enhanced automated optimal design of physical spaces in the wake of the COVID-19 pandemic.

As the COVID-19 pandemic unfolds, manually enhanced ad-hoc solutions have helped the physical space designers and decision makers to cope with the dynamic nature of space planning. Due to the unpredictable nature by which the pandemic is unfolding, the standard operating procedures also change, and the protocols for physical interaction require continuous reconsideration. Consequently, the development of an appropriate technological solution to address the current challenge of reconfiguring common physical environments with prescribed physical distancing measures is much needed. To do this, we propose a design optimization methodology which takes the dimensions, as well as the constraints and other necessary requirements of a given physical space to yield optimal redesign solutions on the go. The methodology we propose here utilizes the solution to the well-known mathematical circle packing problem, which we define as a constrained mathematical optimization problem. The resulting optimization problem is solved subject to a given set of parameters and constraints - corresponding to the requirements on the social distancing criteria between people and the imposed constraints on the physical spaces such as the position of doors, windows, walkways and the variables related to the indoor airflow pattern. Thus, given the dimensions of a physical space and other essential requirements, the solution resulting from the automated optimization algorithm can suggest an optimal set of redesign solutions from which a user can pick the most feasible option. We demonstrate our automated optimal design methodology by way of a number of practical examples, and we discuss how this framework can be further taken forward as a design platform that can be implemented practically.

CACONET: Ant Colony Optimization (ACO) Based Clustering Algorithm for VANET.

A vehicular ad hoc network (VANET) is a wirelessly connected network of vehicular nodes. A number of techniques, such as message ferrying, data aggregation, and vehicular node clustering aim to improve communication efficiency in VANETs. Cluster heads (CHs), selected in the process of clustering, manage inter-cluster and intra-cluster communication. The lifetime of clusters and number of CHs determines the efficiency of network. In this paper a Clustering algorithm based on Ant Colony Optimization (ACO) for VANETs (CACONET) is proposed. CACONET forms optimized clusters for robust communication. CACONET is compared empirically with state-of-the-art baseline techniques like Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO). Experiments varying the grid size of the network, the transmission range of nodes, and number of nodes in the network were performed to evaluate the comparative effectiveness of these algorithms. For optimized clustering, the parameters considered are the transmission range, direction and speed of the nodes. The results indicate that CACONET significantly outperforms MOPSO and CLPSO.