Survey on Various Aspects of Clustering in Wireless Sensor Networks Employing Classical, Optimization, and Machine Learning Techniques

A wide range of academic scholars, engineers, scientific and technology communities are interested in energy utilization of Wireless Sensor Networks (WSNs). Their extensive research is going on in areas like scalability, coverage, energy efficiency, data communication, connection, load balancing, security, reliability and network lifespan. Individual researchers are searching for affordable methods to enhance the solutions to existing problems that show unique techniques, protocols, concepts, and algorithms in the wanted domain. Review studies typically offer complete, simple access or a solution to these problems. Taking into account this motivating factor and the effect of clustering on the decline of energy, this article focuses on clustering techniques using various wireless sensor networks aspects. The important contribution of this paper is to give a succinct overview of clustering

ENAMS: Energy optimization algorithm for mobile wireless sensor networks using evolutionary computation and swarm intelligence.

Although traditionally Wireless Sensor Network (WSNs) have been regarded as static sensor arrays used mainly for environmental monitoring, recently, its applications have undergone a paradigm shift from static to more dynamic environments, where nodes are attached to moving objects, people or animals. Applications that use WSNs in motion are broad, ranging from transport and logistics to animal monitoring, health care and military. These application domains have a number of characteristics that challenge the algorithmic design of WSNs. Firstly, mobility has a negative effect on the quality of the wireless communication and the performance of networking protocols. Nevertheless, it has been shown that mobility can enhance the functionality of the network by exploiting the movement patterns of mobile objects. Secondly, the heterogeneity of devices in a WSN has to be taken into account for increasing the network performance and lifetime. Thirdly, the WSN services should ideally assist the user in an unobtrusive and transparent way. Fourthly, energy-efficiency and scalability are of primary importance to prevent the network performance degradation. This thesis contributes toward the design of a new hybrid optimization algorithm; ENAMS (Energy optimizatioN Algorithm for Mobile Sensor networks) which is based on the Evolutionary Computation and Swarm Intelligence to increase the life time of mobile wireless sensor networks. The presented algorithm is suitable for large scale mobile sensor networks and provides a robust and energy- efficient communication mechanism by dividing the sensor-nodes into clusters, where the number of clusters is not predefined and the sensors within each cluster are not necessary to be distributed in the same density. The presented algorithm enables the sensor nodes to move as swarms within the search space while keeping optimum distances between the sensors. To verify the objectives of the proposed algorithm, the LEGO-NXT MIND-STORMS robots are used to act as particles in a moving swarm keeping the optimum distances while tracking each other within the permitted distance range in the search space

Energy Efficient Clustered Load Balanced LEACH Protocol Based on Particle Swarm Optimization in Underwater Wireless Sensor Networks

Underwater wireless sensor networks (UWSN) are generally positioned over a sizeable aquatic area and sensor nodes are mobile due to their distinct environment. The networks' sensor nodes have the ability to self-organize and communicate. The sensor networks are used in many fields, such as habitat monitoring, small energy cost, object/entity tracking, forecasting and remote control of hazardous regions, surveillance, routing etc. Due to their mobility, sensor nodes use more energy, have a lower node distribution density, and require longer localization times. Clustering is an efficient topology control strategy for achieving the goal of conserving energy. This manuscript presents a novel technique for prolonging the lifetime of a network using the LEACH protocol. The proposed load-balanced LEACH protocol uses the concept of PSO (Particle Swarm Optimization) in which a cluster head is chosen based on UWSN's current energy level, load factor, degree of nodes, and distance from the head node are used for clustering to reduce energy consumption. The proposed design has been simulated in NS2.35 and compared with three clustering routing protocols, LEACH, E-LEACH, and C-LEACH on the various performance factors like remaining energy, number of packets transmitted and lost during transmission, bit-rate analysis, number of alive and dead nodes. The proposed design shows an improvement in network lifetime and in energy conservation by selecting optimal cluster heads

K-means online-learning routing protocol (K-MORP) for unmanned aerial vehicles (UAV) adhoc networks

Unmanned Aerial Vehicles (UAVs) have become a hot topic due to their flexible architecture adopted in many wireless technologies. In UAV ad hoc networks, traditional routing protocols with a fixed topology are ineffective due to dynamic mobility and unstable paths. Therefore, the mobility patterns of UAVs challenge efficient and reliable routing in UAV networks. Traditional routing algorithms are often based on assumptions of static nodes and predetermined network topologies. Which are not suitable for the dynamic and unpredictable nature of UAV mobility patterns. To address this problem, this paper introduces a K-means online learning routing protocol (KMORP) scheme employing a Markov mobility model for UAV ad hoc networks. Initially, the proposed method utilizes a 3D Gauss Markov mobility model to accurately estimate UAV positions, while K-means online learning is adopted for dynamic clustering and load balancing. Designed for real-time data processing, KMORP is well suited for UAV ad hoc networks, quickly adapting to network environmental changes such as UAV mobility, interference, and signal degradation to ensure efficient data transmission and communication. This is achieved while reducing the overall communication overhead and increasing the packet delivery ratio(PDR%). In the routing phase, the proposed scheme employs inter-cluster forwarding nodes to transmit messages among different clusters. Extensive simulations demonstrate the performance of the proposed KMORP, showing a 38% better PDR compared to OLSR and over 50% less end-to-end(E2E) delay compared to typical K-Means. Furthermore, the proposed KMORP exhibited an average throughput of 955 kbps, showing a substantial improvement in network performance. The results underscore that the proposed KMORP outperforms existing techniques in terms of PDR, E2E delay, and throughput.© 2023 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).fi=vertaisarvioitu|en=peerReviewed

Swarming Reconnaissance Using Unmanned Aerial Vehicles in a Parallel Discrete Event Simulation

Current military affairs indicate that future military warfare requires safer, more accurate, and more fault-tolerant weapons systems. Unmanned Aerial Vehicles (UAV) are one answer to this military requirement. Technology in the UAV arena is moving toward smaller and more capable systems and is becoming available at a fraction of the cost. Exploiting the advances in these miniaturized flying vehicles is the aim of this research. How are the UAVs employed for the future military? The concept of operations for a micro-UAV system is adopted from nature from the appearance of flocking birds, movement of a school of fish, and swarming bees among others. All of these natural phenomena have a common thread: a global action resulting from many small individual actions. This emergent behavior is the aggregate result of many simple interactions occurring within the flock, school, or swarm. In a similar manner, a more robust weapon system uses emergent behavior resulting in no weakest link because the system itself is made up of simple interactions by hundreds or thousands of homogeneous UAVs. The global system in this research is referred to as a swarm. Losing one or a few individual unmanned vehicles would not dramatically impact the swarms ability to complete the mission or cause harm to any human operator. Swarming reconnaissance is the emergent behavior of swarms to perform a reconnaissance operation. An in-depth look at the design of a reconnaissance swarming mission is studied. A taxonomy of passive reconnaissance applications is developed to address feasibility. Evaluation of algorithms for swarm movement, communication, sensor input/analysis, targeting, and network topology result in priorities of each model\u27s desired features. After a thorough selection process of available implementations, a subset of those models are integrated and built upon resulting in a simulation that explores the innovations of swarming UAVs

A Hybrid Metaheuristic Algorithm for Stop Point Selection in Wireless Rechargeable Sensor Network

A wireless rechargeable sensor network (WRSN) enables charging of rechargeable sensor nodes (RSN) wirelessly through a mobile charging vehicle (MCV). Most existing works choose the MCV’s stop point (SP) at random, the cluster’s center, or the cluster head position, all without exploring the demand from RSNs. It results in a long charging delay, a low charging throughput, frequent MCV trips, and more dead nodes. To overcome these issues, this paper proposes a hybrid metaheuristic algorithm for stop point selection (HMA-SPS) that combines the techniques of the dragonfly algorithm (DA), firefly algorithm (FA), and gray wolf optimization (GWO) algorithms. Using FA and GWO techniques, DA predicts an ideal SP using the run-time metrics of RSNs, such as energy, delay, distance, and trust factors. The simulated results demonstrate faster convergence with low delay and highlight that more RSNs can be recharged with fewer MCV visits, further enhancing energy utilization, throughput, network lifetime, and trust factor