Coverage Protocols for Wireless Sensor Networks: Review and Future Directions

The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result, many coverage protocols were proposed. In this survey, we first propose a taxonomy for classifying coverage protocols in WSNs. Then, we classify the coverage protocols into three categories (i.e. coverage aware deployment protocols, sleep scheduling protocols for flat networks, and cluster-based sleep scheduling protocols) based on the network stage where the coverage is optimized. For each category, relevant protocols are thoroughly reviewed and classified based on the adopted coverage techniques. Finally, we discuss open issues (and recommend future directions to resolve them) associated with the design of realistic coverage protocols. Issues such as realistic sensing models, realistic energy consumption models, realistic connectivity models and sensor localization are covered

PSO Based Deployment of Hybrid Sensor Networks

With the rapid increase in the usage of wireless sensor networks, it is emerging as a technology for monitoring various physical activities. The essential characteristics of wireless sensor network are coverage, cost, connectivity and lifetime which are dependent upon the number and type of sensors being used for the required task. A random deployment strategy of sensor nodes may cause coverage holes in the sensing ?eld. The work presented here shall mainly focus on deployment strategy of WSNs which will improve the coverage area that poses the biggest challenge to the developers. Most of the problems related to WSNs are modelled and approached as multi objective functions through various genetic algorithms. PSO is one such technique that is e?cient and computationally e?cient in addressing various issues such as optimising sensor deployment and localization of sensor nodes. A modi?ed particle swarm optimization (PSO) technique using grid based strategy has been proposed for sensor deployment which is capable of e?ciently deploying the sensors with an objective of maximizing the coverage ratio. It will determine the optimum location of the mobile nodes after the initial random deployment .The optimality rate of this approach is also higher as compared to other genetic algorithms

A Hybrid Modified Ant Colony Optimization - Particle Swarm Optimization Algorithm for Optimal Node Positioning and Routing in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) have been widely deployed in hostile locations for environmental monitoring. Sensor placement and energy management are the two main factors that should be focused due to certain limitations in WSNs. The nodes in a sensor network might not stay charged when energy draining takes place; therefore, increasing the operational lifespan of the network is the primary purpose of energy management. Recently, major research interest in WSN has been focused with the essential aspect of localization. Several types of research have also taken place on the challenges of node localization of wireless sensor networks with the inclusion of range-free and range-based localization algorithms. In this work, the optimal positions of Sensor Nodes (SNs) are determined by proposing a novel Hybrid M-ACO – PSO (HMAP) algorithm. In the HMAP method, the improved PSO utilizes learning strategies for estimating the relay nodes\u27 optimal positions. The M-ACO assures the data conveyance. A route discovers when it relates to the ideal route irrespective of the possibility of a system that includes the nodes with various transmission ranges, and the network lifetime improves. The proposed strategy is executed based on the energy, throughput, delivery ratio, overhead, and delay of the information packets

Optimal Coverage in Wireless Sensor Network using Augmented Nature-Inspired Algorithm

           One of the difficult problems that must be carefully considered before any network configuration is getting the best possible network coverage. The amount of redundant information that is sensed is decreased due to optimal network coverage, which also reduces the restricted energy consumption of battery-powered sensors. WSN sensors can sense, receive, and send data concurrently. Along with the energy limitation, accurate sensors and non-redundant data are a crucial challenge for WSNs. To maximize the ideal coverage and reduce the waste of the constrained sensor battery lifespan, all these actions must be accomplished. Augmented Nature-inspired algorithm is showing promise as a solution to the crucial problems in “Wireless Sensor Networks” (WSNs), particularly those related to the reduced sensor lifetime. For “Wireless Sensor Networks” (WSNs) to provide the best coverage, we focus on algorithms that are inspired by Augmented Nature in this research. In wireless sensor networks, the cluster head is chosen using the Diversity-Driven Multi-Parent Evolutionary Algorithm. For Data encryption Improved Identity Based Encryption (IIBE) is used.  For centralized optimization and reducing coverage gaps in WSNs Time variant Particle Swarm Optimization (PSO) is used. The suggested model's metrics are examined and compared to various traditional algorithms. This model solves the reduced sensor lifetime and redundant information in Wireless Sensor Networks (WSNs) as well as will give real and effective optimum coverage to the Wireless Sensor Networks (WSNs)

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

Wildfire Monitoring Based on Energy Efficient Clustering Approach for FANETS

Forest fires are a significant threat to the ecological system’s stability. Several attempts have been made to detect forest fires using a variety of approaches, including optical fire sensors, and satellite-based technologies, all of which have been unsuccessful. In today’s world, research on flying ad hoc networks (FANETs) is a thriving field and can be used successfully. This paper describes a unique clustering approach that identifies the presence of a fire zone in a forest and transfers all sensed data to a base station as soon as feasible via wireless communication. The fire department takes the required steps to prevent the spread of the fire. It is proposed in this study that an efficient clustering approach be used to deal with routing and energy challenges to extend the lifetime of an unmanned aerial vehicle (UAV) in case of forest fires. Due to the restricted energy and high mobility, this directly impacts the flying duration and routing of FANET nodes. As a result, it is vital to enhance the lifetime of wireless sensor networks (WSNs) to maintain high system availability. Our proposed algorithm EE-SS regulates the energy usage of nodes while taking into account the features of a disaster region and other factors. For firefighting, sensor nodes are placed throughout the forest zone to collect essential data points for identifying forest fires and dividing them into distinct clusters. All of the sensor nodes in the cluster communicate their packets to the base station continually through the cluster head. When FANET nodes communicate with one another, their transmission range is constantly adjusted to meet their operating requirements. This paper examines the existing clustering techniques for forest fire detection approaches restricted to wireless sensor networks and their limitations. Our newly designed algorithm chooses the most optimum cluster heads (CHs) based on their fitness, reducing the routing overhead and increasing the system’s efficiency. Our proposed method results from simulations are compared with the existing approaches such as LEACH, LEACH-C, PSO-HAS, and SEED. The evaluation is carried out concerning overall energy usage, residual energy, the count of live nodes, the network lifetime, and the time it takes to build a cluster compared to other approaches. As a result, our proposed EE-SS algorithm outperforms all the considered state-of-art algorithms.publishedVersio

Improved LEACH Protocol based on Moth Flame Optimization Algorithm for Wireless Sensor Networks

Wireless sensor nodes are made up of small electronic devices designed for detecting, determining, and sending data under severe physical conditions. These sensor nodes rely heavily on batteries for energy, which drain at a quicker pace due to the extensive communication and processing tasks they must carry out. Managing this battery resource is the major challenge in wireless sensor networks (WSNs). This work aims at developing an improved performance and energy-efficient low-energy adaptive clustering hierarchy (IPE-LEACH) that can extend the lifespan of networks. This paper proposes a novel LEACH protocol that uses the moth flame optimization (MFO) algorithm for clustering and routing to increase the longevity of the sensor network. IPE-LEACH proved to have a better cluster-head (CH) selection technique by eliminating redundant data, thereby extending the network lifetime. IPE-LEACH was compared with four other existing algorithms, and it performed better than: original LEACH by 60%, EiP-LEACH by 45%, LEACH-GA by 58%, and LEACH-PSO by 13.8%. It can therefore be concluded that IPE-LEACH is a promising clustering algorithm that has the potential to realize high flexibility in WSNs in case the CH fails.     

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