Metaheuristics Techniques for Cluster Head Selection in WSN: A Survey

In recent years, Wireless sensor communication is growing expeditiously on the capability to gather information, communicate and transmit data effectively. Clustering is the main objective of improving the network lifespan in Wireless sensor network. It includes selecting the cluster head for each cluster in addition to grouping the nodes into clusters. The cluster head gathers data from the normal nodes in the cluster, and the gathered information is then transmitted to the base station. However, there are many reasons in effect opposing unsteady cluster head selection and dead nodes. The technique for selecting a cluster head takes into factors to consider including residual energy, neighbors’ nodes, and the distance between the base station to the regular nodes. In this study, we thoroughly investigated by number of methods of selecting a cluster head and constructing a cluster. Additionally, a quick performance assessment of the techniques' performance is given together with the methods' criteria, advantages, and future directions

The Application of Ant Colony Optimization

The application of advanced analytics in science and technology is rapidly expanding, and developing optimization technics is critical to this expansion. Instead of relying on dated procedures, researchers can reap greater rewards by utilizing cutting-edge optimization techniques like population-based metaheuristic models, which can quickly generate a solution with acceptable quality. Ant Colony Optimization (ACO) is one the most critical and widely used models among heuristics and meta-heuristics. This book discusses ACO applications in Hybrid Electric Vehicles (HEVs), multi-robot systems, wireless multi-hop networks, and preventive, predictive maintenance

Applied (Meta)-Heuristic in Intelligent Systems

Engineering and business problems are becoming increasingly difficult to solve due to the new economics triggered by big data, artificial intelligence, and the internet of things. Exact algorithms and heuristics are insufficient for solving such large and unstructured problems; instead, metaheuristic algorithms have emerged as the prevailing methods. A generic metaheuristic framework guides the course of search trajectories beyond local optimality, thus overcoming the limitations of traditional computation methods. The application of modern metaheuristics ranges from unmanned aerial and ground surface vehicles, unmanned factories, resource-constrained production, and humanoids to green logistics, renewable energy, circular economy, agricultural technology, environmental protection, finance technology, and the entertainment industry. This Special Issue presents high-quality papers proposing modern metaheuristics in intelligent systems

Reconfigurable Antenna Systems: Platform implementation and low-power matters

Antennas are a necessary and often critical component of all wireless systems, of which they share the ever-increasing complexity and the challenges of present and emerging trends. 5G, massive low-orbit satellite architectures (e.g. OneWeb), industry 4.0, Internet of Things (IoT), satcom on-the-move, Advanced Driver Assistance Systems (ADAS) and Autonomous Vehicles, all call for highly flexible systems, and antenna reconfigurability is an enabling part of these advances. The terminal segment is particularly crucial in this sense, encompassing both very compact antennas or low-profile antennas, all with various adaptability/reconfigurability requirements. This thesis work has dealt with hardware implementation issues of Radio Frequency (RF) antenna reconfigurability, and in particular with low-power General Purpose Platforms (GPP); the work has encompassed Software Defined Radio (SDR) implementation, as well as embedded low-power platforms (in particular on STM32 Nucleo family of micro-controller). The hardware-software platform work has been complemented with design and fabrication of reconfigurable antennas in standard technology, and the resulting systems tested. The selected antenna technology was antenna array with continuously steerable beam, controlled by voltage-driven phase shifting circuits. Applications included notably Wireless Sensor Network (WSN) deployed in the Italian scientific mission in Antarctica, in a traffic-monitoring case study (EU H2020 project), and into an innovative Global Navigation Satellite Systems (GNSS) antenna concept (patent application submitted). The SDR implementation focused on a low-cost and low-power Software-defined radio open-source platform with IEEE 802.11 a/g/p wireless communication capability. In a second embodiment, the flexibility of the SDR paradigm has been traded off to avoid the power consumption associated to the relevant operating system. Application field of reconfigurable antenna is, however, not limited to a better management of the energy consumption. The analysis has also been extended to satellites positioning application. A novel beamforming method has presented demonstrating improvements in the quality of signals received from satellites. Regarding those who deal with positioning algorithms, this advancement help improving precision on the estimated position

An Adaptive, Discrete Space Oriented Wolf Pack Optimization Algorithm for a Movable Wireless Sensor Network

Recently, many related algorithms have been proposed to find an efficient wireless sensor network with good sustainability, a stable connection, and a high covering rate. To further improve the coverage rate of movable wireless sensor networks under the condition of guaranteed connectivity, this paper proposes an adaptive, discrete space oriented wolf pack optimization algorithm for a movable wireless sensor network (DSO-WPOA). Firstly, a strategy of adaptive expansion based on a minimum overlapping full-coverage model is designed to achieve minimum overlap and no-gap coverage for the monitoring area. Moreover, the adaptive shrinking grid search wolf pack optimization algorithm (ASGS-CWOA) is improved to optimize the movable wireless sensor network, which is a discrete space oriented problem. This improvement includes the usage of a target–node probability matrix and the design of an adaptive step size method, both of which work together to enhance the convergence speed and global optimization ability of the algorithm. Theoretical research and experimental results indicate that compared with the coverage algorithm based on particle swarm optimization (PSO-WSN) and classical virtual force algorithm, the newly proposed algorithm possesses the best coverage rate, better stability, acceptable performance in terms of time, advantages in energy savings, and no gaps

Particle Swarm Optimization

Particle swarm optimization (PSO) is a population based stochastic optimization technique influenced by the social behavior of bird flocking or fish schooling.PSO shares many similarities with evolutionary computation techniques such as Genetic Algorithms (GA). The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. This book represents the contributions of the top researchers in this field and will serve as a valuable tool for professionals in this interdisciplinary field

Development of Autonomous Surface Vessels for Hydrographic Survey Applications

Autonomously navigating surface vessels have a variety of potential applications for ocean mapping. The use of small vessels for coastal mapping is investigated through the development of hardware and software that form a complete system for survey operations. The hardware is selected to minimize cost while providing flexibility for installation on different platforms. MOOS-IvP open-source autonomy software enables independent operation of the vessel and provides for human monitoring. Custom applications allow the sensors and actuators of the hardware platforms to interface with MOOS-IvP. An autonomy behavior is developed that replicates current human driven survey acquisition, in which the boat plans paths automatically to achieve full survey coverage with a swath sonar system. With initial input of a survey boundary and depths from the onboard sonar system, subsequent paths are planned to be offset based on the collected data. This behavior is tested in simulation and field experiments. A model reference adaptive control system for the heading of the vessel is investigated for improved reliability of vessel operation in a variety of conditions and over the full range of operation speeds. Simulations tests verify the adaptation of two types of controllers. A new method for speed control to increase endurance and decrease engine wear is also proposed and simulated. Together, these developments form an easily configurable system that provides automated hydrographic survey capability to a vessel with minimal human involvement for optimal performance

Network delay control through adaptive queue management

Timeliness in delivering packets for delay-sensitive applications is an important QoS (Quality of Service) measure in many systems, notably those that need to provide real-time performance. In such systems, if delay-sensitive traffic is delivered to the destination beyond the deadline, then the packets will be rendered useless and dropped after received at the destination. Bandwidth that is already scarce and shared between network nodes is wasted in relaying these expired packets. This thesis proposes that a deterministic per-hop delay can be achieved by using a dynamic queue threshold concept to bound delay of each node. A deterministic per-hop delay is a key component in guaranteeing a deterministic end-to-end delay. The research aims to develop a generic approach that can constrain network delay of delay-sensitive traffic in a dynamic network. Two adaptive queue management schemes, namely, DTH (Dynamic THreshold) and ADTH (Adaptive DTH) are proposed to realize the claim. Both DTH and ADTH use the dynamic threshold concept to constrain queuing delay so that bounded average queuing delay can be achieved for the former and bounded maximum nodal delay can be achieved for the latter. DTH is an analytical approach, which uses queuing theory with superposition of N MMBP-2 (Markov Modulated Bernoulli Process) arrival processes to obtain a mapping relationship between average queuing delay and an appropriate queuing threshold, for queue management. While ADTH is an measurement-based algorithmic approach that can respond to the time-varying link quality and network dynamics in wireless ad hoc networks to constrain network delay. It manages a queue based on system performance measurements and feedback of error measured against a target delay requirement. Numerical analysis and Matlab simulation have been carried out for DTH for the purposes of validation and performance analysis. While ADTH has been evaluated in NS-2 simulation and implemented in a multi-hop wireless ad hoc network testbed for performance analysis. Results show that DTH and ADTH can constrain network delay based on the specified delay requirements, with higher packet loss as a trade-off