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.

LSDA-APF:A Local Obstacle Avoidance Algorithm for Unmanned Surface Vehicles Based on 5G Communication Environment

In view of the complex marine environment of navigation,especially in the case of multiple static and dynamic obstacles,the traditional obstacle avoidance algorithms applied to unmanned surface vehicles(USV)are prone to fall into the trap of local optimization.Therefore,this paper proposes an improved artificial potential field(APF)algorithm,which uses 5G communication technology to communicate between the USV and the control center.The algorithm introduces the USV discrimination mechanism to avoid the USV falling into local optimization when the USV encounter different obstacles in different scenarios.Considering the various scenarios between the USV and other dynamic obstacles such as vessels in the process of performing tasks,the algorithm introduces the concept of dynamic artificial potential field.For the multiple obstacles encountered in the process of USV sailing,based on the International Regulations for Preventing Collisions at Sea(COLREGS),the USV determines whether the next step will fall into local optimization through the discriminationmechanism.The local potential field of the USV will dynamically adjust,and the reverse virtual gravitational potential field will be added to prevent it from falling into the local optimization and avoid collisions.The objective function and cost function are designed at the same time,so that the USV can smoothly switch between the global path and the local obstacle avoidance.The simulation results show that the improved APF algorithm proposed in this paper can successfully avoid various obstacles in the complex marine environment,and take navigation time and economic cost into account.

LOCAL STRUCTURE-PRESERVING ALGORITHMS FOR THE KLEIN-GORDON-ZAKHAROV EQUATION

In this paper, using the concatenating method, a series of local structure-preserving algorithms are obtained for the Klein-Gordon-Zakharov equation, including four multisymplectic algorithms, four local energy-preserving algorithms, four local momentumpreserving algorithms;of these, local energy-preserving and momentum-preserving algorithms have not been studied before. The local structure-preserving algorithms mentioned above are more widely used than the global structure-preserving algorithms, since local preservation algorithms can be preserved in any time and space domains, which overcomes the defect that global preservation algorithms are limited to boundary conditions. In particular, under appropriate boundary conditions, local preservation laws are global preservation laws.Numerical experiments conducted can support the theoretical analysis well.

Algorithms for Multicriteria Scheduling Problems to Minimize Maximum Late Work, Tardy, and Early

This study examines the multicriteria scheduling problem on a single machine to minimize three criteria: the maximum cost function, denoted by maximum late work (Vmax), maximum tardy job, denoted by (Tmax), and maximum earliness (Emax). We propose several algorithms based on types of objectives function to be optimized when dealing with simultaneous minimization problems with and without weight and hierarchical minimization problems. The proposed Algorithm (3) is to find the set of efficient solutions for 1//F (Vmax, Tmax, Emax) and 1//(Vmax + Tmax + Emax). The Local Search Heuristic Methods (Descent Method (DM), Simulated Annealing (SA), Genetic Algorithm (GA), and the Tree Type Heuristics Method (TTHM) are applied to solve all suggested problems. Finally, the experimental results of Algorithm (3) are compared with the results of the Branch and Bound (BAB) method for optimal and Pareto optimal solutions for smaller instance sizes and compared to the Local Search Heuristic Methods for large instance sizes. These results ensure the efficiency of Algorithm (3) in a reasonable time.

MULTI OBJECTIVE OPTIMIZATION USING GENETIC ALGORITHM WITH LOCAL SEARCH

In this paper,we propose a hybrid algorithm for finding a set of non dominated solutions of a multi objective optimization problem.In the proposed algorithm,a local search procedure is applied to each solution generated by genetic operations.The aim of the proposed algorithm is not to determine a single final solution but to try to find all the non dominated solutions of a multi objective optimization problem.The choice of the final solution is left to the decision makers preference.High search ability of the proposed algorithm is demonstrated by computer simulation.

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.

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.

Feature Extraction of Localized Scattering Centers Using the Modified TLS-Prony Algorithm and Its Applications

This paper presents an all-parametric model of radar target in optic region, in which the localized scattering center's frequency and aspect angle dependent scattering level, distance and azimuth locations are modeled as the feature vectors. And the traditional TLS-Prony algorithm is modified to extract these feature vectors. The analysis of Cramer-Rao bound shows that the modified algorithm not only improves the restriction of high signal-to-noise ratio(SNR)threshold of traditional TLS-Prony algorithm, but also is suitable to the extraction of big damped coefficients and high-resolution estimation of near separation poles. Finally, an illustrative example is presented to verify its practicability in the applications. The experimental results show that the method developed can not only recognize two airplane-like targets with similar shape at low SNR, but also compress the original radar data with high fidelity.

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.

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.

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.

A Hybrid Optimization Technique Coupling an Evolutionary and a Local Search Algorithm for Economic Emission Load Dispatch Problem

This paper presents an optimization technique coupling two optimization techniques for solving Economic Emission Load Dispatch Optimization Problem EELD. The proposed approach integrates the merits of both genetic algorithm (GA) and local search (LS), where it maintains a finite-sized archive of non-dominated solutions which gets iteratively updated in the presence of new solutions based on the concept of ε-dominance. To improve the solution quality, local search technique was applied as neighborhood search engine, where it intends to explore the less-crowded area in the current archive to possibly obtain more non-dominated solutions. TOPSIS technique can incorporate relative weights of criterion importance, which has been implemented to identify best compromise solution, which will satisfy the different goals to some extent. Several optimization runs of the proposed approach are carried out on the standard IEEE 30-bus 6-genrator test system. The comparison demonstrates the superiority of the proposed approach and confirms its potential to solve the multiobjective EELD problem.

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.

A New Genetic Algorithm Based on Niche Technique and Local Search Method

The genetic algorithm has been widely used in many fields as an easy robust global search and optimization method. In this paper, a new generic algorithm based on niche technique and local search method is presented under the consideration of inadequacies of the simple genetic algorithm. In order to prove the adaptability and validity of the improved genetic algorithm, optimization problems of multimodal functions with equal peaks, unequal peaks and complicated peak distribution are discussed. The simulation results show that compared to other niching methods, this improved genetic algorithm has obvious potential on many respects, such as convergence speed, solution accuracy, ability of global optimization, etc.

An Improved Real-Time Face Recognition System at Low Resolution Based on Local Binary Pattern Histogram Algorithm and CLAHE

This research presents an improved real-time face recognition system at a low resolution of 15 pixels with pose and emotion and resolution variations. We have designed our datasets named LRD200 and LRD100, which have been used for training and classification. The face detection part uses the Viola-Jones algorithm, and the face recognition part receives the face image from the face detection part to process it using the Local Binary Pattern Histogram (LBPH) algorithm with preprocessing using contrast limited adaptive histogram equalization (CLAHE) and face alignment. The face database in this system can be updated via our custom-built standalone android app and automatic restarting of the training and recognition process with an updated database. Using our proposed algorithm, a real-time face recognition accuracy of 78.40% at 15 px and 98.05% at 45 px have been achieved using the LRD200 database containing 200 images per person. With 100 images per person in the database (LRD100) the achieved accuracies are 60.60% at 15 px and 95% at 45 px respectively. A facial deflection of about 30° on either side from the front face showed an average face recognition precision of 72.25%-81.85%. This face recognition system can be employed for law enforcement purposes, where the surveillance camera captures a low-resolution image because of the distance of a person from the camera. It can also be used as a surveillance system in airports, bus stations, etc., to reduce the risk of possible criminal threats.