Node Localization in Wireless Sensor Networks by Artificial Immune System

Within the growing Internet of Things (IoT) paradigm, a Wireless Sensor Network (WSN) is a critical component. In a WSN, sensor node localization is typically utilized to identify the target node’s current location at the sink node (SN). This allows local data to be analysed, making it more meaningful. However, there exists an intrinsic problem with node localization and energy efficiency, as identified in the literature, which has led to poor performance, namely, poor estimation, transmission, and detection of the network. This intrinsic problem also directly affects energy efficiency in a WSN, resulting in energy loss and poor node distribution in the WSN. There seems to be no lasting and reliable solution to this intrinsic node localization problem in WSNs. Hence, this research study proposed hyper-heuristic optimization algorithms to improve node localization and energy efficiency in WSNs. This research adopts the Design Research (DR) methodology and the Theory of Modelling and Simulation as the theoretical frameworks of the study. The hyper-heuristic model designed, was considered the conceptual framework of the study. To validate the novel technique, different sizes of sensor networks, namely: - 100 sensor nodes; 100 to 1 500 nodes and 200 to 450 sensor nodes with 20 anchor nodes were simulated in an area measuring 100m x 100m. The novel hyper-heuristic model was implemented in a MATLAB R2020a environment. The hyper-heuristic optimization algorithm’s substantial simulated experiment results were benchmarked utilizing state-of-the-art (modern) techniques to solve challenges related to node localization error, total energy consumed, average consumed packet energy, network throughput, shortest path, dead nodes, packets dispatched to the base station (BS), and the probability of error within the entire network dependent on size. The Data Energy Efficiency Clustering-Gaussian (DEEC-GAUSS) method was used to provide solutions to challenges related to energy efficiency in WSNs. In addition, this research study explored the use of the novel DEEC-GAUSS Gradient Distance Elimination Algorithm (DGGDEA) as the hyper-heuristic optimisation model for localization of nodes in WSNs. DEEC-GAUSS and DGGDEA were valuable additions to the body of knowledge. The results showed that the novel DEEC-GAUSS was the most energy efficient algorithm for 100 sensor nodes and 1000 to 1500 sensor nodes when compared to other stateof-the-art algorithms. Furthermore, the results showed that the novel DGGDEA was able to drastically minimize the node estimation error for sensor nodes. Reliability, accuracy and convergence using hyper-heuristic models to enhance the communication within WSNs has been simulated with evidence that DEEC-GAUSS and DGGDEA has outperformed other stateof-the-art approaches

Aiming at the problem of node localization in wireless sensor networks, a location algorithm for optimizing distance vector hopping (DV-hop) by constructing a quantum neural network model based on particle swarm optimization (PSO) is proposed. According to the average distance obtained by the traditional DV-HOP and the distance from the measured nodes, the quantum neural network model is constructed, and the average distance is trained by the particle swarm optimization algorithm which would shorten the training time of the traditional artificial neural network and accelerate the convergence speed. By using the proposed model, the optimal mean value is obtained, and the optimization of the DV-HOP algorithm is realized. The simulation results show that compared with the traditional DV-HOP algorithm, the proposed algorithm can reduce the positioning error by about 20%, and the positioning accuracy is significantly improved.

There has been a growing interest in the applications of wireless sensor networks in unattended environments. In such applications, sensor nodes are usually deployed randomly in an area of interest. Knowledge of accurate node location is essential in order to correlate the gathered data to the origin of the sensed phenomena and assure the relevance of the reported information. In this paper, we present an efficient anchor-free protocol for localization in wireless sensor networks. Each node discovers its neighbors that are within its transmission range and estimates their ranges. Our algorithm fuses local range measurements in order to form a network wide unified coordinate systems while minimizing the overhead incurred at the deployed sensors. Scalability is achieved through grouping sensors into clusters. Simulation results show that the proposed protocol achieves precise localization of sensors and maintains consistent error margins.

Wireless sensor networks are an emerging technology deployed in many fields. Knowing the positions of sensor nodes is critical for many applications to perform their tasks. Hence, accurate node localisation in wireless sensor networks is an essential issue. The node localisation problem can be formulated as a multidimensional optimisation problem. In this study, the authors propose a node localisation scheme based on a sine–cosine algorithm. The proposed scheme addresses the flip ambiguity problem, which can badly affect the localisation accuracy of the entire network. The efficacy of the proposed scheme is evaluated through intensive experimentation under different scenarios. The obtained results show the superiority of the proposed scheme against other optimisation algorithms in terms of the localisation accuracy, the number of localised nodes, and the computation time.

In recent years node localization in wireless sensor networks (WSNs) has attracted much attention due to the increase of usage and applications of WSNs. Many algorithms and techniques for locating sensor nodes have been proposed in the literature. A recent algorithm, which is based on a given set of pairwise distance estimates among nodes and the target, generates a map of node locations. This algorithm, known as FastMap, uses projections onto orthogonal hyperplanes to find the coordinates successively. In this paper, we analytically study the performance of the FastMap algorithm for 2D positioning. Moreover a modified version of FastMap with better performance is proposed and analyzed. The analysis shows that the optimum anchor placement should be at the edge of the network.

This chapter describes one of the major challenges in technology advancement of Wireless Sensor Networks (WSNs), i.e., Localization in WSNs. In recent years, sensor node localization is an emerging research area in WSNs. The sensor data become useless, if we do not know the location of the reporting node. Coordinates determination of the sensor node is a challenging problem and it is referred as localization problem. The nodes which has unknown coordinates is termed as target Nodes. Various localization methods can be utilized to find out the location of sensor nodes, those coordinates are not known in a system/network. Efficient WSN localization can be treated as multi-dimensional optimization problem which can be addressed through population based stochastic techniques, which involves the minimization of a function of differences between Euclidean and measured distance between sensor nodes. In this chapter various connectivity, range information and mobility based localization algorithms have been discussed. For optimizing the results of these algorithms, various computational intelligence (CI) based optimizing algorithms like Particle Swarm Optimization, Biogeography Based Optimization, Firefly Algorithm and Genetic Algorithm have been discussed. A choice between these algorithm is influenced by the localization accuracy expected to be and convergence rate.

The symbiotic organism search (SOS) algorithm is a promising meta-heuristic evolutionary algorithm. Its excellent quality of global optimization solution has aroused the interest of many researchers. In this work, we not only applied the strategy of multi-group communication and quantum behavior to the SOS algorithm, but also formed a novel global optimization algorithm called the MQSOS algorithm. It has speed and convergence ability and plays a good role in solving practical problems with multiple arguments. We also compared MQSOS with other intelligent algorithms under the CEC2013 large-scale optimization test suite, such as particle swarm optimization (PSO), parallel PSO (PPSO), adaptive PSO (APSO), QUasi-Affine TRansformation Evolutionary (QUATRE), and oppositional SOS (OSOS). The experimental results show that MQSOS algorithm had better performance than the other intelligent algorithms. In addition, we combined and optimized the DV-hop algorithm for node localization in wireless sensor networks, and also improved the DV-hop localization algorithm to achieve higher localization accuracy than some existing algorithms.

This paper proposes a novel and computationally efficient global optimization method based on swarm intelligence for locating nodes in a WSN environment. The mean squared range error of all neighbouring anchor nodes is taken as the objective function for this non linear optimization problem. The Particle Swarm Optimization (PSO) is a high performance stochastic global optimization tool that ensures the minimization of the objective function, without being trapped into local optima. The easy implementation and low memory requirement features of PSO make it suitable for highly resource constrained WSN environments. Computational experiments on data drawn from simulated WSNs show better convergence characteristics than the existing Simulated Annealing based WSN localization.

Localization is a key technology in wireless sensor networks. Faced with the challenges of the sensors’ memory, computational constraints, and limited energy, particle swarm optimization has been widely applied in the localization of wireless sensor networks, demonstrating better performance than other optimization methods. In particle swarm optimization-based localization algorithms, the variants and parameters should be chosen elaborately to achieve the best performance. However, there is a lack of guidance on how to choose these variants and parameters. Further, there is no comprehensive performance comparison among particle swarm optimization algorithms. The main contribution of this paper is three-fold. First, it surveys the popular particle swarm optimization variants and particle swarm optimization-based localization algorithms for wireless sensor networks. Secondly, it presents parameter selection of nine particle swarm optimization variants and six types of swarm topologies by extensive simulations. Thirdly, it comprehensively compares the performance of these algorithms. The results show that the particle swarm optimization with constriction coefficient using ring topology outperforms other variants and swarm topologies, and it performs better than the second-order cone programming algorithm.

Meta-heuristic-based guidance model for node localization in wireless sensor networks

Node localization in wireless sensor networks is an important research direction. On the basis of the tradition of the DV-Hop, this paper proposes a new positioning algorithm by analyzing its shortcomings. The new algorithm eliminates the long-distance anchor node information. It fixed the error of the average hop distance, and selected anchor nodes to participate in the trilateral positioning selectively. Finally, we use the MATLAB to simulate the network. The simulation results show that the modified algorithm is better than the original algorithm in terms of performance. And it has more accurate positioning.

There are many optimisation problems in the real world. To solve these problems, different intelligent optimisation techniques/algorithms have been developed in the past several years. Among these algorithms, artificial bee colony (ABC) has received much attention in optimisation community. Compared to other similar algorithms, ABC has fewer control parameters. However, ABC shows poor local search ability and slow convergence rate. In this paper, we propose a novel ABC variant, called DyGABC, which employs two strategies including the global best solution guided solution model and a dynamic model for dimension updating. Experiments on 12 optimisation problems show that our DyGABC is better than the standard ABC and another improved ABC algorithm. In addition, DyGABC is used to improve the accuracy performance of node localisation in wireless sensor networks. Simulation results demonstrate that our approach is better than the original distance vector-hop (DV-Hop) algorithm.

Sensor nodes' locations perform a vital role in many sensor network applications. Localization of sensor node in Wireless Sensor Networks adds security issues such as node re-authentication and tracing the movement. A number of techniques have been proposed recently to solve the locations issues of regular sensors but inadequate to support hostile and dynamic environments since their designs are only for the static environments. In this paper, we propose the well-organized node authentication and key exchange protocol that trim downs the overhead in node re-authentication and also facilitates untraceability of localized nodes. The proposed protocol will be the efficient solution to increase the lifetime of sensor network.

In this paper we propose two novel and computationally efficient metaheuristic algorithms based on tabu search (TS) and particle swarm optimization (PSO) principles for locating the sensor nodes in a distributed wireless sensor network (WSN) environment. The WSN localization problem is formulated as a non‐linear optimization problem with mean squared range error resulting from noisy distance measurement as the objective function. Unlike gradient descent methods, both TS and PSO methods ensure minimization of the objective function without the solution being trapped into local optima. We further implement a refinement phase with error propagation control for improvement of the results. The performance of the proposed algorithms are compared with each other and also against simulated annealing based WSN localization. The effects of range measurement error, anchor node density and uncertainty in the anchor node position on localization performance are also studied through various simulations. The simulation results establish better accuracy, computational efficiency and convergence characteristics for TS and PSO methods. Further, the efficacy of the proposed methods is verified with data collected from an experimental sensor network reported in the literature. Copyright © 2008 John Wiley & Sons, Ltd.

The paper describes a concept of software tool for development of nodes localization in large wireless sensor network. The basic module is the event driven simulator that enables loading position of wireless network nodes, description of the behavior of nodes, description of the environment and modeling of wave propagation in defined space. Node localization and deployment problem in wireless sensor network are supported by implemented algorithms.