The wireless sensor network node localization algorithm based on multitudinous beacon

DV-Hop is a typical node localization algorithm without ranging of wireless sensor network. Because of the shortcoming that this algorithm's accuracy for node positioning is not high, a sensor node localization algorithm based on improved wolves algorithm is proposed. The algorithm is based on the classic DV-Hop algorithm, converts the wireless sensor node localization problem into a multi-constrained optimization problem, and uses improved wolves algorithm to solve this problem, then obtains the optimal solution of unknown node coordinates. Matlab simulation show that, this algorithm can significantly improve the positioning accuracy of the node than other wireless sensor network node localization algorithm.

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

The wireless sensor network node localization algorithms are studied more and more at present, but most are based on two-dimensional localization algorithm for three-dimensional localization of too few. Based on the researches on the classic two-dimensional localization algorithm, and the trilateration was extended to three-dimensional localization algorithm. Error analysis of this algorithm was revealed in the classic two-dimensional and three-dimensional environment, and the node localization error with a linear relationship between average nodes ranging error was found.

The localization of nodes in a wireless sensor network is milestone to the correct functioning of the network. This paper aims to evaluate by means of simulations the Malguki spring localization algorithm. The algorithm is simulated for three different anchor deployment scenarios: the classical scenarios of random and uniform anchors and a novel scenario called hybrid. This paper analyzes the algorithm from the point of view of the obtained average errors, as well as from the point of view of the parameters that influence its results.

In this paper, we propose an improved DV-Hop algorithm for wireless sensor network (WSN) node localization. Our algorithm applies a novel virtual node method to calculate the average hop size and a novel rule to correct unreasonable distance. Then it introduces a kind of weighted least squares method to calculate the locations of unknown nodes. Our algorithm doesn't require beacon nodes to broadcast additional information. We simulated our algorithm contrasting with the original DV-Hop algorithm under different conditions. The experiment results showed that our algorithm improved the localization accuracy obviously.

With the development of electronic technology and communication protocols, wireless sensor network technology is developing rapidly. In a sense, the traditional static wireless sensor network has been unable to meet the needs of new applications. However, the introduction of mobile nodes extends the application of wireless sensor networks, despite the technical challenges. Because of its flexibility, the mobile wireless sensor network has attracted great attention, and even small, self-controlled mobile sensor devices have appeared. At present, mobile node localization has become one of the hotspots in wireless sensor networks. As the storage energy of wireless sensor network nodes is limited, and the communication radius is small, many scientists have focused their research direction on the location algorithm of mobile nodes. According to the continuity principle of mobile node movement, in this paper we propose an improved mobile node localization algorithm based on the Monte Carlo Location (MCL) algorithm, and the method can reduce the sampling interval effectively. First of all, this paper introduces the structure and classification of wireless sensor localization technology. Secondly, the principle of the Monte Carlo Location algorithm is described in detail. Thirdly, we propose an efficient method for mobile node localization based on the MCL algorithm. Finally, the effectiveness and accuracy of the new algorithm are verified by comparative analysis.

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.

Localization of mobile nodes in wireless sensor network gets more and more important, because many applications need to locate the source of incoming measurements as precise as possible. Many previous approaches to the location-estimation problem need know the theories and experiential signal propagation model and collect a large number of labeled samples. So, these approaches are coarse localization because of the inaccurate model, and to obtain such data requires great effort. In this paper, a semi-supervised manifold learning is used to estimate the locations of mobile nodes in a wireless sensor network. The algorithm is used to compute a subspace mapping function between the signal space and the physical space by using a small amount of labeled data and a large amount of unlabeled data. This mapping function can be used online to determine the location of mobile nodes in a sensor network based on the signals received. We use independent development nodes to setup the network in metallurgical industry environment, outdoor and indoor. Experimental results show that we can achieve a higher accuracy with much less calibration effort as compared with RADAR localization systems.

Wireless Sensor Network (WSN) refers to a network of devices that can communicate the information gathered from a monitored field through wireless links. As a critical technology of WSN, the localization algorithm plays a vital role in improving node location accuracy and network efficiency. A hybrid Pigeon Inspired Optimization (PIO) with a typical localization model is proposed to solve the problem of node localization in WSN. The self-learning idea of PIO and speed formula are combined to improve exploring and exploiting agents of PIO. Fitness function for optimization is mathematically modeled based on analysis Pareto distances. The simulation results compared with the other approaches in the literature, e.g., the improved particle swarm optimization (PSO) and the cuckoo search (CS) show that the proposed method effectively improves the location accuracy of nodes and reduces the cumulative error caused by success positioning nodes.

When 2D localization algorithm is extended to 3D space, it achieves node localization with better localization accuracy. An improved immune particle swarm optimization (IIPSO) localization algorithm is proposed to estimate the localization of nodes in wireless sensor networks (WSN). The results show that IIPSO algorithm outperforms the traditional two-dimensional localization algorithm based on iterative estimation of the center of mass by 3%-6%. The proposed algorithm has better resistance to RSSI measurement errors and can achieve more than 99% node localization coverage through multiple iterations, which is effective for WSN.

In many instances, as special applications of wireless sensor networks, wireless sensor networks need to know the location of nodes. A wireless sensor network localization algorithm based on Particle Swarm Optimization is proposed in this thesis to solve the problem of inaccurate positioning and large energy consumption for wireless sensor network node positioning. The algorithm combines the particle swarm optimization algorithm (PSO) and node localization algorithm to improve the positioning accuracy.

SummaryDespite the close of a tumultuous 2020 and the start of 2021, connected devices will continue to shape the future of numerous industries, and businesses are confident that the Internet of Things (IoT) will play a key role in the future success of their trade. The growing Internet of Things (IoT) is connecting devices to a variety of sensors, applications, and other IoT elements to automate business processes and support human efficiencies in business and the home. WSN along with node localization algorithms can play a critical role in IoT applications. Nevertheless, in IoT applications, the context of real‐time location‐based services is gaining an overwhelming interest. To do this, several approaches are proposed in the recent literature based mainly on computational intelligence algorithms. This paper proposes a node localization algorithm based on swarm intelligence algorithms, that is, a hybrid Harris Hawks optimization based on differential evolution (HHODE).HHODE algorithm relies on Euclidian Distance as objective function to evaluate best‐fit coordinates of sensor nodes in a wireless sensor network. Moreover, several experimentations are performed depending on the network size, communication range of sensors, geographical distribution, and the beacon nodes' density to demonstrate the efficiency of the HHODE algorithm. Compared to Standard DE, HOO, PSO, and Bat Algorithm, HHODE shows higher performance with regard to node localization.

Wireless Sensor Networks (WSN) are widely used in different monitoring systems. Given the distributed nature of WSN, a constantly increasing number of research studies are concentrated on some important aspects: maximizing network autonomy, node localization, and data access security. The node localization and distance estimation algorithms have, as their starting points, different information provided by the nodes. The level of signal strength is often such a starting point. A system for Received Signal Strength Indicator (RSSI) acquisition has been designed, implemented, and tested. In this paper, experiments in different operating environments have been conducted to show the variation of Received Signal Strength Indicator (RSSI) metric related to distance and geometrical orientation of the nodes and environment, both indoor and outdoor. Energy aware data transmission algorithms adjust the power consumed by the nodes according to the relative distance between the nodes. Experiments have been conducted to measure the current consumed by the node depending on the adjusted transmission power. In order to use the RSSI values as input for distance or location detection algorithms, the RSSI values can’t be used without intermediate processing steps to mitigate with the non-linearity of the measured values. The results of the measurements confirmed that the RSSI level varies with distance, geometrical orientation of the sensors, and environment characteristics.

For most wireless sensor network (WSN) applications, the positions of the sensor nodes need to be known. Global positioning systems have not fitted into WSNs very well owing to their price, power consumption, accuracy and limitations in their operating environment. Hence, the last decade has brought about a large number of proposed methods for WSN node localization. They show tremendous variation in the physical phenomena they use, the signal properties they measure, the resources they consume, as well as in their accuracy, range, advantages and limitations. This paper provides a high-level, comprehensive overview of this very active research area.

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.