An Optimal Node Localization in WSN Based on Siege Whale Optimization Algorithm

Localization or positioning scheme in Wireless sensor networks (WSNs) is one of the most challenging andfundamental operations in various monitoring or tracking applications because the network deploys a large areaand allocates the acquired location information to unknown devices. The metaheuristic approach is one of themost advantageous ways to deal with this challenging issue and overcome the disadvantages of the traditionalmethods that often suffer from computational time problems and small network deployment scale. This studyproposes an enhanced whale optimization algorithm that is an advanced metaheuristic algorithm based on thesiege mechanism (SWOA) for node localization inWSN. The objective function is modeled while communicatingon localized nodes, considering variables like delay, path loss, energy, and received signal strength. The localizationapproach also assigns the discovered location data to unidentified devices with the modeled objective functionby applying the SWOA algorithm. The experimental analysis is carried out to demonstrate the efficiency of thedesigned localization scheme in terms of various metrics, e.g., localization errors rate, converges rate, and executedtime. Compared experimental-result shows that theSWOA offers the applicability of the developed model forWSNto perform the localization scheme with excellent quality. Significantly, the error and convergence values achievedby the SWOA are less location error, faster in convergence and executed time than the others compared to at least areduced 1.5% to 4.7% error rate, and quicker by at least 4%and 2% in convergence and executed time, respectivelyfor the experimental scenarios.

Improved PSO-Extreme Learning Machine Algorithm for Indoor Localization

Wi Fi and fingerprinting localization method have been a hot topic in indoor positioning because of their universality and location-related features.The basic assumption of fingerprinting localization is that the received signal strength indication(RSSI)distance is accord with the location distance.Therefore,how to efficiently match the current RSSI of the user with the RSSI in the fingerprint database is the key to achieve high-accuracy localization.In this paper,a particle swarm optimization-extreme learning machine(PSO-ELM)algorithm is proposed on the basis of the original fingerprinting localization.Firstly,we collect the RSSI of the experimental area to construct the fingerprint database,and the ELM algorithm is applied to the online stages to determine the corresponding relation between the location of the terminal and the RSSI it receives.Secondly,PSO algorithm is used to improve the bias and weight of ELM neural network,and the global optimal results are obtained.Finally,extensive simulation results are presented.It is shown that the proposed algorithm can effectively reduce mean error of localization and improve positioning accuracy when compared with K-Nearest Neighbor(KNN),Kmeans and Back-propagation(BP)algorithms.

Multiple Targets Localization Algorithm Based on Covariance Matrix Sparse Representation and Bayesian Learning

The multi-source passive localization problem is a problem of great interest in signal pro-cessing with many applications.In this paper,a sparse representation model based on covariance matrix is constructed for the long-range localization scenario,and a sparse Bayesian learning algo-rithm based on Laplace prior of signal covariance is developed for the base mismatch problem caused by target deviation from the initial point grid.An adaptive grid sparse Bayesian learning targets localization(AGSBL)algorithm is proposed.The AGSBL algorithm implements a covari-ance-based sparse signal reconstruction and grid adaptive localization dictionary learning.Simula-tion results show that the AGSBL algorithm outperforms the traditional compressed-aware localiza-tion algorithm for different signal-to-noise ratios and different number of targets in long-range scenes.

LFM Radar Source Passive Localization Algorithm Based on Range Migration

Traditional single-satellite passive localization algorithms are influenced by frequency and angle measurement accuracies,resulting in error estimation of emitter position on the order of kilometers.Subsequently,a single-satellite localization algorithm based on passive synthetic aper-ture(PSA)was introduced,enabling high-precision positioning.However,its estimation of azimuth and range distance is considerably affected by the residual frequency offset(RFO)of uncoopera-tive system transceivers.Furthermore,it requires data containing a satellite flying over the radia-tion source for RFO search.After estimating the RFO,an accurate estimation of azimuth and range distance can be carried out,which is difficult to achieve in practical situations.An LFM radar source passive localization algorithm based on range migration is proposed to address the dif-ficulty in estimating frequency offset.The algorithm first provides a rough estimate of the pulse repetition time(PRT).It processes intercepted signals through range compression,range interpola-tion,and polynomial fitting to obtain range migration observations.Subsequently,it uses the changing information of range migration and an accurate PRT to formulate a system of nonlinear equations,obtaining the emitter position and a more accurate PRT through a two-step localization algorithm.Frequency offset only induces a fixed offset in range migration,which does not affect the changing information.This algorithm can also achieve high-precision localization in squint scenar-ios.Finally,the effectiveness of this algorithm is verified through simulations.

An Improved DV-Hop Localization Algorithm Based on Hop Distances Correction

DV-Hop localization algorithm has greater localization error which estimates distance from an unknown node to the different anchor nodes by using estimated average size of a hop to achieve the location of the unknown node.So an improved DV-Hop localization algorithm based on correctional average size of a hop,HDCDV-Hop algorithm,is proposed.The improved algorithm corrects the estimated distance between the unknown node and different anchor nodes based on fractional hop count information and relatively accurate coordinates of the anchor nodes information,and it uses the improved Differential Evolution algorithm to get the estimate location of unknown nodes so as to further reduce the localization error.Simulation results show that our proposed algorithm have lower localization error and higher localization accuracy compared with the original DV-Hop algorithm and other classical improved algorithms.

A Localization Algorithm Using a Mobile Anchor Node Based on Region Determination in Underwater Wireless Sensor Networks

At present, most underwater positioning algorithms improve the positioning accuracy by increasing the number of anchor nodes which resulting in the increasing energy consumption. To solve this problem, the paper proposes a localization algorithm assisted by mobile anchor node and based on region determination(LMRD), which not only improves the positioning accuracy of nodes positioning but also reduces the energy consumption. This algorithm is divided into two stages: region determination stage and location positioning stage. In the region determination stage, the target region is divided into several sub-regions by the region division strategy with the smallest overlap rate which can reduce the number of virtual anchor nodes and lock the target node to a sub-region, and then through the planning of mobile nodes to optimize the travel path, reduce the moving distance, and reduce system energy consumption. In the location positioning stage, the target node location can be calculated using the HILBERT path planning and trilateration. The simulation results show that the proposed algorithm can improve the positioning accuracy when the energy consumption is reduced.

无线传感器网络基于测距的节点定位算法综述OverviewoftheNodeLocalizationAlgorithmBasedonRangingofWirelessSensorNetworks

基于测距的定位方法对测量的距离信息运用几何知识求解未知节点的位置,常用在定位精度较高的领域,可在误差、能耗、受环境因素影响等方面进行优化。本文对基于测距的无线传感器网络节点定位算法进行详细地分析和比较。

High speed robust image registration and localization using optimized algorithm and its performances evaluation

Local invariant algorithm applied in downward-looking image registration,usually computes the camera＇s pose relative to visual landmarks.Generally,there are three requirements in the process of image registration when using these approaches.First,the algorithm is apt to be influenced by illumination.Second,algorithm should have less computational complexity.Third,the depth information of images needs to be estimated without other sensors.This paper investigates a famous local invariant feature named speeded up robust feature（SURF）,and proposes a highspeed and robust image registration and localization algorithm based on it.With supports from feature tracking and pose estimation methods,the proposed algorithm can compute camera poses under different conditions of scale,viewpoint and rotation so as to precisely localize object＇s position.At last,the study makes registration experiment by scale invariant feature transform（SIFT）,SURF and the proposed algorithm,and designs a method to evaluate their performances.Furthermore,this study makes object retrieval test on remote sensing video.For there is big deformation on remote sensing frames,the registration algorithm absorbs the Kanade-Lucas-Tomasi（KLT） 3-D coplanar calibration feature tracker methods,which can localize interesting targets precisely and efficiently.The experimental results prove that the proposed method has a higher localization speed and lower localization error rate than traditional visual simultaneous localization and mapping（vSLAM） in a period of time.

An Improved Underwater Acoustic Network Localization Algorithm

Underwater sensor network can achieve the unmanned environmental monitoring and military monitoring missions.Underwater acoustic sensor node cannot rely on the GPS to position itself,and the traditional indirect positioning methods used in Ad Hoc networks are not fully applicable to the localization of underwater acoustic sensor networks.In this paper,we introduce an improved underwater acoustic network localization algorithm.The algorithm processes the raw data before localization calculation to enhance the tolerance of random noise.We reduce the redundancy of the calculation results by using a more accurate basic algorithm and an adjusted calculation strategy.The improved algorithm is more suitable for the underwater acoustic sensor network positioning.

RSSI-based Algorithm for Indoor Localization

Wireless node localization is one of the key technologies for wireless sensor networks. Outdoor localization can use GPS, AGPS (Assisted Global Positioning System) [6], but in buildings like supermarkets and underground parking, the accuracy of GPS and even AGPS will be greatly reduced. Since Indoor localization requests higher accuracy, using GPS or AGPS for indoor localization is not feasible in the current view. RSSI-based trilateral localization algorithm, due to its low cost, no additional hardware support, and easy-understanding, it becomes the mainstream localization algorithm in wireless sensor networks. With the development of wireless sensor networks and smart devices, the number of WIFI access point in these buildings is increasing, as long as a mobile smart device can detect three or three more known WIFI hotspots’ positions, it would be relatively easy to realize self-localization (Usually WIFI access points locations are fixed). The key problem is that the RSSI value is relatively vulnerable to the influence of the physical environment, causing large calculation error in RSSI-based localization algorithm. The paper proposes an improved RSSI-based algorithm, the experimental results show that compared with original RSSI-based localization algorithms the algorithm improves the localization accuracy and reduces the deviation.

Reach Centroid Localization Algorithm

As much as accurate or precise position estimation is always desirable, coarse accuracy due to sensor node localization is often sufficient. For such level of accuracy, Range-free localization techniques are being explored as low cost alternatives to range based localization techniques. To manage cost, few location aware nodes, called anchors are deployed in the wireless sensor environment. It is from these anchors that all other free nodes are expected to estimate their own positions. This paper therefore, takes a look at some of the foremost Range-free localization algorithms, detailing their limitations, with a view to proposing a modified form of Centroid Localization Algorithm called Reach Centroid Localization Algorithm. The algorithm employs a form of anchor nodes position validation mechanism by looking at the consistency in the quality of Received Signal Strength. Each anchor within the vicinity of a free node seeks to validate the actual position or proximity of other anchors within its vicinity using received signal strength. This process mitigates multipath effects of radio waves, particularly in an enclosed environment, and consequently limits localization estimation errors and uncertainties. Centroid Localization Algorithm is then used to estimate the location of a node using the anchors selected through the validation mechanism. Our approach to localization becomes more significant, particularly in indoor environments, where radio signal signatures are inconsistent or outrightly unreliable. Simulated results show a significant improvement in localization accuracy when compared with the original Centroid Localization Algorithm, Approximate Point in Triangulation and DV-Hop.

Variance-based fingerprint distance adjustment algorithm for indoor localization

The multipath effect and movements of people in indoor environments lead to inaccurate localization. Through the test, calculation and analysis on the received signal strength indication （RSSI） and the variance of RSSI, we propose a novel variance-based fingerprint distance adjustment algorithm （VFDA）. Based on the rule that variance decreases with the increase of RSSI mean, VFDA calculates RSSI variance with the mean value of received RSSIs. Then, we can get the correction weight. VFDA adjusts the fingerprint distances with the correction weight based on the variance of RSSI, which is used to correct the fingerprint distance. Besides, a threshold value is applied to VFDA to improve its performance further. VFDA and VFDA with the threshold value are applied in two kinds of real typical indoor environments deployed with several Wi-Fi access points. One is a quadrate lab room, and the other is a long and narrow corridor of a building. Experimental results and performance analysis show that in indoor environments, both VFDA and VFDA with the threshold have better positioning accuracy and environmental adaptability than the current typical positioning methods based on the k-nearest neighbor algorithm and the weighted k-nearest neighbor algorithm with similar computational costs.

TOA-Based NLOS Error Mitigation Algorithm for 3D Indoor Localization

In the process of indoor localization,the existence of the non-line of sight(NLOS)error will greatly reduce the localization accuracy.To reduce the impact of this error,a 3 dimensional(3D)indoor localization algorithm named LMR(LLS-Minimum-Residual)is proposed in this paper.We first estimate the NLOS error and use it to correct the measurement distances,and then calculate the target location with linear least squares(LLS)solution.The final nodes location can be obtained accurately by NLOS error mitigation.Our algorithm can work efficiently in both indoor 2D and 3D environments.The simulation results show that the proposed algorithm has better performance than traditional algorithms and it can significantly improve the localization accuracy.

Ground target localization algorithm for semi-active laser terminalcorrection projectile

A target localization algorithm,which uses the measurement information from onboard GPS and onboard laser detector to acquire the target position,is proposed to obtain the accurate position of ground target in real time in the trajectory correction process of semi-active laser terminal correction projectile.A target localization model is established according to projectile position,attitude and line-of-sight angle.The effects of measurement errors of projectile position,attitude and line-of-sight angle on localization accuracy at different quadrant elevation angles are analyzed through Monte-Carlo simulation.The simulation results show that the measurement error of line-of-sight angle has the largest influence on the localization accuracy.The localization accuracy decreases with the increase in quadrant elevation angle.However,the maximum localization accuracy is less than 7 m.The proposed algorithm meets the accuracy and real-time requirements of target localization.

A Fuzzy Decision Based WSN Localization Algorithm for Wise Healthcare

Wise healthcare is a typical application of wireless sensor network(WSN), which uses sensors to monitor the physiological state of nursing targets and locate their position in case of an emergency situation. The location of targets need to be determined and reported to the control center,and this leads to the localization problem. While localization in healthcare field demands high accuracy and regional adaptability, the information processing mechanism of human thinking has been introduced,which includes knowledge accumulation, knowledge fusion and knowledge expansion. Furthermore, a fuzzy decision based localization approach is proposed. Received signal strength(RSS) at references points are obtained and processed as position relationship indicators, using fuzzy set theory in the knowledge accumulation stage; after that, optimize degree of membership corresponding to each anchor nodes in different environments during knowledge fusion; the matching degree of reference points is further calculated and sorted in decision-making, and the coordinates of several points with the highest matching degree are utilized to estimate the location of unknown nodes while knowledge expansion. Simulation results show that the proposed algorithm get better accuracy performance compared to several traditional algorithms under different typical occasions.

Immune evolutionary algorithms with domain knowledge for simultaneous localization and mapping

Immune evolutionary algorithms with domain knowledge were presented to solve the problem of simultaneous localization and mapping for a mobile robot in unknown environments. Two operators with domain knowledge were designed in algorithms, where the feature of parallel line segments without the problem of data association was used to construct a vaccination operator, and the characters of convex vertices in polygonal obstacle were extended to develop a pulling operator of key point grid. The experimental results of a real mobile robot show that the computational expensiveness of algorithms designed is less than other evolutionary algorithms for simultaneous localization and mapping and the maps obtained are very accurate. Because immune evolutionary algorithms with domain knowledge have some advantages, the convergence rate of designed algorithms is about 44% higher than those of other algorithms.

Analysis of Five Typical Localization Algorithms for Wireless Sensor Networks

In this paper, the self-localization problem is studied. It is one of the key technologies in wireless sensor networks (WSNs). And five localization algorithms: Centroid algorithm, Amorphous algorithm, DV-hop algorithm, APIT algorithm and Bounding Box algorithm are discussed. Simulation of those five localization algorithms is done by MATLAB. The simulation results show that the positioning error of Amorphous algorithm is the minimum. Considering economy and localization accuracy, the Amorphous algorithm can achieve the best localization performance under certain conditions.

Hybrid ToA and IMU indoor localization system by various algorithms

In this paper, we integrate inertial navigation system (INS) with wireless sensor network (WSN) to enhance the accuracy of indoor localization. Inertial measurement unit (IMU), the core of the INS, measures the accelerated and angular rotated speed of moving objects. Meanwhile, the ranges from the object to beacons, which are sensor nodes with known coordinates, are collected by time of arrival (ToA) approach. These messages are simultaneously collected and transmitted to the terminal. At the terminal, we set up the state transition models and observation models. According to them, several recursive Bayesian algorithms are applied to producing position estimations. As shown in the experiments, all of three algorithms do not require constant moving speed and perform better than standalone ToA system or standalone IMU system. And within them, two algorithms can be applied for the tracking on any path which is not restricted by the requirement that the trajectory between the positions at two consecutive time steps is a straight line.

A Semi-Supervised WLAN Indoor Localization Method Based on l1-Graph Algorithm

For indoor location estimation based on received signal strength( RSS) in wireless local area networks( WLAN),in order to reduce the influence of noise on the positioning accuracy,a large number of RSS should be collected in offline phase. Therefore,collecting training data with positioning information is time consuming which becomes the bottleneck of WLAN indoor localization. In this paper,the traditional semisupervised learning method based on k-NN and ε-NN graph for reducing collection workload of offline phase are analyzed,and the result shows that the k-NN or ε-NN graph are sensitive to data noise,which limit the performance of semi-supervised learning WLAN indoor localization system. Aiming at the above problem,it proposes a l1-graph-algorithm-based semi-supervised learning( LG-SSL) indoor localization method in which the graph is built by l1-norm algorithm. In our system,it firstly labels the unlabeled data using LG-SSL and labeled data to build the Radio Map in offline training phase,and then uses LG-SSL to estimate user's location in online phase. Extensive experimental results show that,benefit from the robustness to noise and sparsity ofl1-graph,LG-SSL exhibits superior performance by effectively reducing the collection workload in offline phase and improving localization accuracy in online phase.

ALGORITHM FOR ACOUSTIC PASSIVE LOCALIZATION WITH DUAL ARRAYS

Aiming at the problem of 3D target localization by time delay estimation, this paper proposes a new acoustic passive localization method, which can provide high precision localization estimation. The first step of the two-stage algorithm is to measure the azimuth angle and pitch angle at each single array, which can obtain high precision angle estimation but low precision range estimation. And in the second step, the location of acoustic source is calculated from the angles measured above and geometry position of the two arrays. Then the accuracy of localization estimation is discussed in theory, and the influence factors and localization error are analyzed by simulation. The simulation results validate the performance of the proposed algorithm, and show the precision of localization estimation with dual arrays is superior to single array.