Pigeon-Inspired Optimization for Node Location in Wireless Sensor 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.

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

In order to improve the accuracy of node location in wireless sensor networks (WSNs), an intelligent location algorithm based on composite Particle Swarm Optimization (PSO) is proposed for DV-Hop. The problem of uncertain location is transformed into a multi-dimension optimization problem after the process of maximum likelihood method. Moreover, satisfactory accuracy of location is obtained with the advantage of composite PSO in NP problems. The experiment results show that, our proposed algorithm is excellent in decreasing location error, improving accuracy and robustness, compared with traditional methods.

Wireless Sensor Network (WSN) is composed of sensor nodes deployed to achieve some specific task. Localization of individual mobile node is a challenging task in wireless sensor networks. Localization system is not only for location identification but also provides the base for routing, density control, tracking, and a number of other communication network aspects. In real time applications of outdoor or indoor environments, there are significant challenges for node localization in WSN. Keeping in view the fact that many precise and smart solutions have been proposed, an approach for range free localization is Concentric Anchor Beacon (CAB), which comes with the requirement of improvement. In this paper, we have presented a novel solution “Power Tuning Anchors” (PTA) algorithm that outperforms in terms of accuracy. In PTA, mobile node localizes its position on the basis of minimum received power levels transmitted by the neighboring anchors. Localization error, anchor density, radio range and Gitter between two consecutive power levels are the performance metrics used for evaluation of PTA. Initial empirical results have shown better precision and more accuracy in terms of aforementioned performance parameter.

On the interaction between localization and location verification for wireless sensor networks

We propose a novel approach to the source localization and tracking problem in wireless sensor networks. By applying minimax approximation and semidefinite relaxation, we transform the traditionally nonlinear and nonconvex problem into convex optimization problems for two different source localization models involving measured distance and received signal strength. Based on the problem transformation, we develop a fast low-complexity semidefinite programming (SDP) algorithm for two different source localization models. Our algorithm can either be used to estimate the source location or be used to initialize the original nonconvex maximum likelihood algorithm.

This paper presents a particle swarm optimization (PSO)‐based approach to enhance node localization accuracy in wireless sensor networks (WSNs). Traditional range‐based methods such as RSSI suffer from high positioning errors, while conventional DV‐Hop algorithms rely on assumptions that often fail under real‐world conditions. To overcome these limitations, the proposed method integrates a bounding box technique to constrain the initial search space, along with anticipatory and refinement strategies to address flip ambiguity. Additionally, inter‐node distance information, including distances between unknown nodes, is leveraged to further improve localization accuracy. Simulation results demonstrate that the proposed PSO‐based approach significantly reduces localization error, enhances accuracy and coverage, and lowers variance compared to standard DV‐Hop and Improved DV‐Hop (IDV‐Hop) algorithms. These improvements contribute to more accurate, reliable, and computationally efficient localization in WSNs.

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.

In wireless sensor networks (WSNs), localization is one of the most important topics because the location information is typically useful for many applications.The primary data used in a localization process include the locations of anchor nodes and the distances between neighboring nodes.However, these data may contain outliers that deviate from their true values.The existence of the outliers might make the estimated positions not accurate.Thus, it is important to detect and handle outliers in order to achieve high localization accuracy.In this paper, we survey the existing outlier detection techniques for localization in wireless sensor networks.We provide taxonomy for classifying outlier detection techniques in WSNs localization based on different features.In addition, we present comparisons of these techniques.Finally, we discuss the future research directions in this area.

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.

In wireless sensor networks (WSN) high-accuracy localization is crucial for both of WNS management and many other numerous location-based applications. Only a subset of nodes in a WSN is deployed as anchor nodes with their locations a priori known to localize unknown sensor nodes. The accuracy of the estimated position depends on the number of anchor nodes. Obviously, increasing the number or ratio of anchors will undoubtedly increase the localization accuracy. However, it severely constrains the flexibility of WSN deployment while impacting costs and energy. This paper aims to drastically reduce anchor number or ratio of anchor in WSN deployment and ensures a good trade-off for localization accuracy. Hence, this work presents an approach to decrease the number of anchor nodes without compromising localization accuracy. Assuming a random string WSN topology, the results in terms of anchor rates and localization accuracy are presented and show significant reduction in anchor deployment rates from 32% to 2%.

Localization is a significant consideration in a Wireless Sensor Network (WSN), as it is essential to correlate sensor information with the geographic location it originates from. The DV-Hop algorithm, being a range-free, distributed algorithm, is an attractive option in this regard, due to its simplicity. In this paper, we present two algorithms to improve the localization accuracy of the DV-Hop algorithm. The Hop Size derived through a distributed fashion by the DV-Hop algorithm is optimized using the knowledge of the position of the anchor nodes. The locations of the unknown nodes are then estimated using the optimum hop size. We examine the performance of the proposed algorithms through simulations in environments with varying node numbers, anchor ratios and radio range. The results show that the proposed algorithms have improved performance in localization accuracy and stability compared to the original DV-Hop algorithm.

Geotagging of sensor data in a wireless sensor network is important in many applications. It may not always be possible to record locations of the sensor nodes during deployment. Localization techniques provide the node location information, however most of these techniques rely on the neighboring nodes for localization. Thus it is essential that the information from neighbors be trustworthy and/or the localization techniques be robust to some of the nodes turning malicious. In this paper, we address the scenario where the malicious node(s) attempt to disrupt the localization process of a target node in an uncoordinated manner. We propose a secure localization technique, called the weighted least square (WLS) localization, in a network with one or more compromised anchor nodes (nodes with known positions are referred to as anchor nodes). The WLS technique assigns larger weights to the anchor nodes that are closer to the target node and is shown to offer significant advantages over existing techniques. The Cramer-Rao lower bound (CRLB) on the root mean square error (RMSE) of the position estimate for the uncoordinated attack is also derived. The proposed technique is shown to provide better localization accuracy than existing algorithms.

Range-free localization schemes are much promising in wireless sensor networks because they can estimate the location of a sensor node without power-consuming and expensive devices for measuring distance or angle information. Among range-free schemes, multi-hop schemes can localize sensor nodes with a few beacon nodes through the multi-hop connection between nodes. Since the localization accuracy depends largely on the communication range in multi-hop schemes, the communication range should be determined considering the relationship between the communication range and the localization accuracy. In this paper, we propose the selection method of the communication range for the DV-Hop scheme, a typical multi-hop scheme. The DV-Hop scheme utilizing the selection method of the communication range leads to better position determination than some existent range-free multi-hop schemes.

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.