Node Localization In Sensor Networks Research Articles

Improved Two Hidden Layers Extreme Learning Machines for Node Localization in Range Free Wireless Sensor Networks

Wireless Sensor Network (WSN) architectures are widely used in a variety of practical applications. In most cases of application, the event information transmitted by a sensor node via the network has no significance without the knowledge of its accurate geographical localization. In this paper, a method based on Machine Learning Technique (MLT) is proposed to improve node accuracy localization in WSN. We propose a Single Hidden Layer Extreme Learning Machine (SHL-ELM) and a Two Hidden Layer Extreme Learning Machine (THL-ELM) based methods for nodes localization in WSN. The suggested methods are applied in different Multi-hop WSN deployment cases. We focused on range-free localization algorithm in isotropic case and irregular environments. Simulation results demonstrate that the proposed THL-ELM algorithm greatly minimizes the average localization errors when compared to the Single Hidden Layer Extreme Learning Machine and the Distance Vector Hop (DV- Hop) algorithm.

A node localisation method for wireless sensor networks based on an improved bee colony algorithm

To overcome the problems of inaccurate positioning and large time consumption for traditional node localisation in wireless sensor networks, a node localisation method based on an improved bee colony algorithm is proposed in this paper. This paper adopts a traditional method combined with a classical multidimensional expansion method to construct a static distance matrix, uses the improved bee colony algorithm to obtain the original coordinates of the static nodes in a wireless sensor network, and determines the actual positions of these nodes. And use the offset speed and a time sequence method to construct an offset compensation model of dynamic sensor nodes. Combined with the uniform measurement method of node target positioning, the optimal positioning of the dynamic sensor nodes is determined. The experimental results show that the accuracy of the proposed method is approximately 98%, and the shortest time is approximately 2.2 s.

Deep learning techniques for noise-resilient localisation in wireless sensor networks

Deep learning techniques are highly attractive for extracting meaningful representations of data of the type encountered in wireless sensor network applications. In particular, these techniques lend themselves readily to the implementation of node localisation in wireless sensor networks as the present work demonstrates. Anchor-based range-based time-of-arrival-measurement deep learning localisation techniques are implemented both in the classification and in the regression modes using convolutional neural networks and standard deep neural networks. A performance comparison against gradient descent localisation is carried out. Deep learning techniques exhibited better noise resilience for typical standard deviation ranges of the measurement noise, especially when used in the classification mode. Compressed sampling is also implemented for tracking a mobile node via deep learning regression techniques to increase energy efficiency.

Online Sequential DV-Hop Localization Algorithm for Wireless Sensor Networks

One of the main issues of wireless sensor networks is localization. Besides, it is important to track and analyze the sensed information. The technique of localization can calculate node position with the help of a set of designed nodes, denoted as anchors. The set density of these anchors may be incremented or decremented because of many reasons such as maintenance, lifetime, and breakdown. The well-known Distance Vector Hop (DV-Hop) algorithm is a suitable solution for localizing nodes having few neighbor anchors. However, existing DV-Hop-based localization methods have not considered the problem of anchor breakdown which may happen during the localization process. In order to avoid this issue, an Online Sequential DV-Hop algorithm is proposed in this paper to sequentially calculate positions of nodes and improve accuracy of node localization for multihop wireless sensor networks. The algorithm deals with the variation of the number of available anchors in the network. We note that DV-Hop algorithm is used in this article to process localization of nodes by a new optimized method for the estimation of the average distance of hops between nodes. Our proposed localization method is based on an online sequential computation. Compared with the original DV-Hop and other localization methods from the literature, simulation results prove that the proposed algorithm greatly minimizes the average of localization error of sensor nodes.

Wireless sensor nodes localiser based on sine–cosine algorithm

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.

Symbiotic Organism Search Algorithm with Multi-Group Quantum-Behavior Communication Scheme Applied in Wireless Sensor Networks

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.

DSLA: Dynamic Sampling Localization Algorithm Based on Virtual Anchor Node

Compared with the localization methods in the static sensor networks, node localization in dynamic sensor networks is more complicated due to the mobility of the nodes. Dynamic Sampling Localization Algorithm Based on Virtual Anchor (DSLA) is proposed in this paper to localize the unknown nodes in dynamic sensor networks. Firstly, DSLA algorithm predicts the speed and movement direction of nodes to determine a sector sampling area. Secondly, a method of calculating the sampling quantity with the size of the sampling area dynamically changing is proposed in this paper. Lastly, the virtual anchor node, i.e., the unknown node that got the preliminary possible area (PLA), assists the other unknown nodes to reduce their PLAs. The last PLA is regarded as a filtering condition to filter out the conflicting sample points quickly. In this way, the filtered sample is close to its real coordinates. The simulation results show that the DSLA algorithm can greatly improve the positioning performance when ensuring the execution time is shorter and the localization coverage rate is higher. The localization error of the DSLA algorithm can be dropped to about 20%.

Underwater Acoustic Sensor Networks Node Localization Based on Compressive Sensing in Water Hydrology.

Groundwater is an important source of human activities, agriculture and industry. Underwater Acoustic Sensor Networks (UASNs) is one of the important technologies for marine environmental monitoring. Therefore, it is of great significance to study the node self- localization technology of underwater acoustic sensor network. This paper mainly studies the node localization algorithm based on range-free. In order to save cost and energy consumption, only a small number of sensing nodes in sensor networks usually know their own location. How to locate all nodes accurately through these few nodes is the focus of our research. In this paper, combined with the compressive sensing algorithm, a range-free node localization algorithm based on node hop information is proposed. Aiming at the problem that connection information collected by the algorithm is an integer, the hop is modified to further improve the localization performance. The simulation analysis shows that the improved algorithm is effective to improve the localization accuracy without additional cost and energy consumption compared with the traditional method.

An Adaptation Multi-Group Quasi-Affine Transformation Evolutionary Algorithm for Global Optimization and Its Application in Node Localization in Wireless Sensor Networks.

Developing metaheuristic algorithms has been paid more recent attention from researchers and scholars to address the optimization problems in many fields of studies. This paper proposes a novel adaptation of the multi-group quasi-affine transformation evolutionary algorithm for global optimization. Enhanced population diversity for adaptation multi-group quasi-affine transformation evolutionary algorithm is implemented by randomly dividing its population into three groups. Each group adopts a mutation strategy differently for improving the efficiency of the algorithm. The scale factor F of mutations is updated adaptively during the search process with the different policies along with proper parameter to make a better trade-off between exploration and exploitation capability. In the experimental section, the CEC2013 test suite and the node localization in wireless sensor networks were used to verify the performance of the proposed algorithm. The experimental results are compared results with three quasi-affine transformation evolutionary algorithm variants, two different evolution variants, and two particle swarm optimization variants show that the proposed adaptation multi-group quasi-affine transformation evolutionary algorithm outperforms the competition algorithms. Moreover, analyzed results of the applied adaptation multi-group quasi-affine transformation evolutionary for node localization in wireless sensor networks showed that the proposed method produces higher localization accuracy than the other competing algorithms.

Implementation of an efficient extreme learning machine for node localization in unmanned aerial vehicle assisted wireless sensor networks

SummaryAccurate node localization in wireless sensor networks (WSNs) is an essential for many networking protocols like clustering, routing, and network map building. The classical localization techniques such as multilateration and optimization‐based least square localization (OLSL) techniques estimate position of unknown node (UN) from the distance measured between all anchor nodes (ANs) and UNs. On the other hand, node localization using fixed terrestrial ANs suffers from poor localization accuracy because the ground to ground (GG) channel link is not reliable. By contrast, the mobile anchor deployed in unmanned aerial vehicle (UAV) provides high localization accuracy through reliable air to ground (AG) channel link. Still, the nonlinear distortion introduced in the wireless channel makes the distance measurement noisy. This noisy distance measurement also limits localization accuracy of classical localization techniques. Hence, the highly nonlinear artificial neural network (ANN) models such as multilayer perceptron (MLP) models can be applied effectively for node localization in UAV‐assisted WSNs. However, the MLP suffers from slow training speed, which limits its usage in real‐time applications. So, the extreme learning machine (ELM) is found to be a better alternative because it works on empirical error minimization theory, and its learning process requires only a single iteration. The detailed simulation analysis supports the proposed ELM localization scheme in terms of both localization accuracy and computational complexity.

Implementation of self adaptive mutation factor and cross-over probability based differential evolution algorithm for node localization in wireless sensor networks

Node localization or positioning is essential for many position aware protocols in a wireless sensor network. The classical global poisoning system used for node localization is limited because of its high cost and its unavailability in the indoor environments. So, several localization algorithms have been proposed in the recent past to improve localization accuracy and to reduce implementation cost. One of the popular approaches of localization is to define localization as a least square localization (LSL) problem. During optimization of LSL problem, the performance of the classical Gauss–Newton method is limited because it can be trapped by local minima. By contrast, differential evolution (DE) algorithm has high localization accuracy because it has an ability to determine global optimal solution to the LSL problem. However, the convergence speed of the conventional DE algorithm is low as it uses fixed values of mutation factor and cross-over probability. Thus, in this paper, a self-adaptive mutation factor cross-over probability based differential evolution (SA-MCDE) algorithm is proposed for LSL problem to improve convergence speed. The SA-MCDE algorithm adaptively adjusts the mutation factor and cross-over probability in each generation to better explore and exploit the global optimal solution. Thus, improved localization accuracy with high convergence speed is expected from the SA-MCDE algorithm. The rigorous simulation results conducted for several localization algorithms declare that the propose SA-MCDE based localization has about (40–90) % more localization accuracy over the classical techniques.

A comparative investigation of deterministic and metaheuristic algorithms for node localization in wireless sensor networks

Location-based services in wireless sensor networks demand precise information of locations of sensor nodes. Range-based localization, a problem formulated as a two-dimensional optimization problem, has been addressed in this paper as a multistage exercise using bio-inspired metaheuristics. A modified version of the shuffled frog leaping algorithm (MSFLA) has been developed for accurate sensor localization. The results of MSFLA have been compared with those of geometric trilateration, artificial bee colony and particle swarm optimization algorithms. Dependance of localization accuracies achieved by these algorithms on the environmental noise has been investigated. Simulation results show that MSFLA delivers the estimates of the locations over 30% more accurately than the geometric trilateration method does in noisy environments. However, they involve higher computational expenses. The MSFLA delivers the most accurate localization results; but, it requires the longest computational time.

Locating the Nodes From Incomplete Euclidean Distance Matrix Using Bayesian Learning

Node localization in wireless sensor networks (WSNs) has received a considerable amount of attention. In this paper, using the natural low-rank properties of the Euclidean distance matrix (EDM), we formulate the node location finding problem from only a small fraction of random entries of the EDM as a low-rank matrix recovery problem. A Bayesian-learning-based method is utilized to recover the original EDM, based on which the relative positions of all the sensor nodes in WSNs are accurately estimated by applying classical multi-dimensional scaling (MDS). In addition, with the location knowledge of anchor nodes, we transform the relative positions into absolute positions. The simulation results illustrate that our proposed approach leads to superior performance over various other methods.

Wireless Sensor Node Localization Algorithm Based on Particle Swarm Optimization and Quantum Neural Network

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.

Developing status and some cutting-edge issues of underwater sensor network localization technology

Owing to the complicated marine environment, a vast majority of terrestrial wireless sensor network technologies cannot be used directly in underwater sensor networks, which should be studied in combination with the special marine environment. In the last decade, there has been great progress in underwater sensor network localization technology. This paper summarizes the developing status first, and then puts forward some cutting-edge issues about underwater sensor network localization technology. Finally, this paper forecasts some practical questions expected to be solved in the next few years about underwater sensor network node localization technology.

A hybrid harmony search algorithm for node localisation in wireless sensor networks

Harmony search (HS) has been widely used in the field of wireless sensor networks. However, the search strategy of the basic HS has excellent exploration capability but weak exploitation capability. To enhance the search capability of HS, this paper presents a hybrid harmony search algorithm (HBHS) for node localisation in wireless sensor networks. The proposed HBHS employs the best solution to enhance the exploitation capability. Moreover, HBHS utilises an adaptive search step-size scheme to further enhance the search capability. To verify the search performance, HBHS is compared with two HS algorithms on a suit of classical benchmark problems. The comparisons confirm that HBHS can achieve better performance than the compared HS algorithms on the most of the benchmark problems. Further, HBHS is applied for node localisation in wireless sensor networks.

Three dimensional power efficient distributed node localisation in wireless sensor networks

Three dimensional power efficient distributed node localisation in wireless sensor networks

Three dimensional power efficient distributed node localisation in wireless sensor networks

Wireless sensor networks (WSNs) are usually used in applications in which information is only applicable when the location of informative node is known. Although the high accuracy is the main advantage of centralised algorithms, the distributed ones are more efficient in power consumption, robustness and reliability. In this paper, we first propose a three dimensional (3D) distributed node localisation algorithm for WSNs in which sensor nodes cooperate to estimate the unknown location in a distribute manner. Then, we propose a node selection algorithm extending the life time of the network. We further propose a weighting function to improve the performance of proposed algorithm. We further analyse the proposed method and prove its convergence. Simulation results confirm that the proposed algorithms are applicable in 3D environments while achieving acceptable performance in the case of localisation error, improving the robustness of the network and reducing the power consumption at least by 20%.

Unmanned aerial vehicle–assisted node localization for wireless sensor networks

Wireless sensor networks have been proposed for many location-dependent monitoring applications. Existing localization methods often suffer low accuracy and high energy consumption. In response to ...

Dynamic Fuzzy-Logic Based Path Planning for Mobility-Assisted Localization in Wireless Sensor Networks.

Mobile anchor path planning techniques have provided as an alternative option for node localization in wireless sensor networks (WSNs). In such context, path planning is a movement pattern where a mobile anchor node’s movement is designed in order to achieve a maximum localization ratio possible with a minimum error rate. Typically, the mobility path planning is designed in advance, which is applicable when the mobile anchor has sufficient sources of energy and time. However, when the mobility movement is restricted or limited, a dynamic path planning design is needed. This paper proposes a novel distributed range-free movement mechanism for mobility-assisted localization in WSNs when the mobile anchor’s movement is limited. The designed movement is formed in real-time pattern using a fuzzy-logic approach based on the information received from the network and the nodes’ deployment. Our proposed model, Fuzzy-Logic based Path Planning for mobile anchor-assisted Localization in WSNs (FLPPL), offers superior results in several metrics including both localization accuracy and localization ratio in comparison to other similar works.