Localization Algorithm For Sensor Networks Research Articles

Dingo optimization influenced arithmetic optimization – Clustering and localization algorithm for underwater acoustic sensor networks

Underwater acoustic sensor networks (UASNs) are quickly being used in environmental monitoring, marine life observation, and underwater resource research. This paper introduces the Dingo Optimisation Influenced-Arithmetic Clustering and Localisation Algorithm. The proposed method was developed due to the above considerations. DOIAO-CLA combines Dingo Optimisation (DO) and Arithmetic Optimisation (AO), two powerful optimisation methods. DOIAO-CLA uses DO's robust exploration and exploitation features to group sensor nodes with similar propagation characteristics. It also optimises cluster formation and reduces distance discrepancies using AO. DOIAO-CLA also enables reliable localization by merging distance- and angle-based methods. DO optimises node localization by using distance and angle of arrival data. This integration enhances UASN node localization accuracy and reliability. The DOIAO-CLA was tested against other clustering and localization algorithms like Archimedes Optimisation Algorithm (AOA), Squirrel Search Algorithm (SSA), Hybrid Cat Cheetah Optimisation Algorithm (HCCOA), Ant Colony Optimisation Algorithm (ACOA), Grey Wolf Optimisation Algorithm (GWOA), and Particle Swarm Optimisation Algorithm. According to the results, DOIAO-CLA taps alternatives for network robustness, data aggregation, and localization precision. Finally, DOIAO-CLA solves the UASN clustering and localization problem in a novel and effective way.

Analysis of improved particle swarm algorithm in wireless sensor network localization

Abstract Among the various WSN technologies, node localization technology is one of the core parts of WSN applications and an important component and key technology, which is also a hot spot and focus of research at this stage. In this paper, firstly, we propose a classical ion swarm localization algorithm for wireless sensor network localization, randomly assigning appropriate velocity and position to each particle in the population in order to find the global optimum in the iterative process. Based on this, a network node localization model is established to convert the functional optimization problem with constraints into an unconstrained optimization problem to solve. At the same time, the space is searched using a chaotic search strategy, which greatly improves the search efficiency. Next, the particle swarm algorithm is further optimized, and simulation experiments are set up using MATLAB software to do comparison experiments on the PSOAPF algorithm and other algorithms. The experimental results show that when the density of beacon nodes is 40%, the average localization error of the PSOAPF algorithm is 14.26%, with the smoothest decreasing trend. When the percentage of anchor nodes is 10%, the localization error is reduced by 6.89%, and the localization accuracy of the PSOAPF algorithm is also higher than other models. This study shows that the improved particle swarm algorithm can effectively improve the localization accuracy, reduce error and accelerate the convergence speed in wireless sensing network localization.

Localization algorithm for anisotropic wireless sensor networks based on the adaptive chaotic slime mold algorithm

Localization algorithm for anisotropic wireless sensor networks based on the adaptive chaotic slime mold algorithm

MOANS DV-Hop: An anchor node subset based localization algorithm for wireless sensor networks

Several applications have exploited wireless sensor networks (WSNs), and localization is a key WSN technology. The range-free localization technique is substantially less expensive than conventional range-based localization strategies since it does not require distance or angle measurements between the anchor and unknown nodes. The Distance Vector-Hop (DV-Hop) technique is a widespread localization solution for WSNs because of its straightforward theory and minimal cost. The coordinate estimating precision of the classic DV-Hop algorithm needs further improvement due to its large localization error. In this paper, a DV-Hop-based method utilizing modified optimum anchor node subset (MOANS DV-Hop) is proposed to improve the localization performance of the DV-Hop algorithm. A strategy for anchor node deployment is proposed. An objective function is formulated to minimize the error in estimating coordinates of unknown nodes. With the MOANS DV-Hop algorithm, each anchor node first uses other anchor nodes to locate itself, then uses the Scaled General Learning Equilibrium Optimizer (SGLEO) algorithm to create an optimal subset made up of anchor nodes other than itself. The anchor node then updates its average hop size using the anchor node subset and broadcasts both the updated hop size and the anchor node subset to the nearby unknown nodes. An unknown node then determines its location using the Equilibrium Optimizer (EO) algorithm, the anchor node subset, and the updated hop size received from the closest anchor node. Simulation findings show that MOANS DV-Hop algorithm has a greater level of localization accuracy in coordinate estimation than both the classical and other improved DV-Hop methods.

Application of multi-target positioning algorithm in basketball teaching system and injury prevention

In today's era, the rapid spread of information and the rise of major network platforms provide good conditions for online learning and at the same time provide a new development idea for basketball teaching. The establishment of modern multimedia teaching theory provides theoretical support for the research and development of this subject. Construct and apply the online learning system of basketball basic technology, provide high-quality education, and can accommodate a large number of basketball fans to study and exchange together, and improve the physical fitness of young people. This thesis combines the multi-target localization algorithm in wireless sensor networks, first introduces the related concepts and basic theories of UWSNs, and then summarizes the related theories of node localization technology. In the course of basketball teaching, the advantages and disadvantages of the wireless sensor network multi-target positioning algorithm and the research direction are introduced. Aiming at the problem of low positioning accuracy and high complexity of the basketball motion prediction positioning algorithm, a multi-target positioning algorithm improved by backtracking search is proposed. The MBSA algorithm improves the positioning accuracy of anchor points, and uses cooperation mechanisms and basketball mobility to locate nodes for unknown actions. An improved BSA algorithm, namely the KLBSA-LoT algorithm, is proposed. The KLBSA-LoT algorithm accurately locates the anchor point and uses a cooperative mechanism to predict the position information of unknown nodes in basketball. Applying this algorithm to basketball teaching can greatly improve the accuracy of its positioning training. Sports teaching provides new methods.

Modified Rat Swarm Optimization Based Localization Algorithm for Wireless Sensor Networks

Modified Rat Swarm Optimization Based Localization Algorithm for Wireless Sensor Networks

Improved 3D localization algorithm for large scale wireless sensor networks

AbstractAs localization represents the main core of various wireless sensor network applications, several localization algorithms have been suggested in wireless sensor network research. In this article, we put forward an iterative bounding box algorithm enhanced by a Kalman filter to refine the unknown node’s estimated position. In fact, several research efforts are currently in progress to extend the 2D positioning algorithm in WSNs to 3D that reflects reality and the most practical applications. Subsequently, we replace a large number of GPS-equipped anchors with a single mobile anchor. In our studies, we consider the type of range-free sensor network exploiting the wireless sensors connectivity. We assess the performance of our algorithm using exhaustive experiments on several isotropic and anisotropic topologies. Our proposed algorithm can fulfill the joint goals of algorithm transparency and accuracy for various scenarios by evaluating parameters such as localization accuracy whilst changing other simulation parameters such as the effect of communication range, mobile anchor node position and sensor node deployment topology. It has been proven by the results of the experiments that the proposed algorithm effectively reduces the location error without requiring more equipment or increasing the communication cost.

Bearing-only distributed localization for multi-agent systems with complex coordinates

This paper addresses the bearing-only distributed localization, which is more accurate and more reliable than traditional localization technologies. A new bearing-only distributed localization framework is proposed to solve localization problems for both static sensor networks and mobile multi-agent systems (MASs). Based on the complex coordinate representation, a novel bearing-only distributed localization algorithm for sensor networks is proposed. The algorithm combines the orientation estimation and the position estimation to solve the orientation alignment problem, which makes the compasses no longer needed for the localized networks. The localization for the mobile MASs is also studied and the corresponding localization algorithm is designed, which is more general and more challenging. The key to obtaining positions of moving agents, is the velocity estimator in the proposed localization algorithm which makes the estimated positions and velocities converge to the true value simultaneously. A distinctive advantage of the localization framework proposed in this paper is that the bearing-only localization algorithms can be applied to more general systems, such as sensor networks and MASs. Simulations and experiment are presented to verify the proposed algorithms.

Mobile Anchor Assisted Effective Node Localization Algorithm for Wireless Sensor Networks

Wireless Sensor Network (WSN) is collection of thousands of randomly, spatially distributed low-cost Sensor Nodes (SN) deployed normally in harsh environments. These deployed SNs collects data and delivers to Base Station (BS) located in a remote region. In a sensor network it is necessary to know about the location of sensor node and data collected by that node as it has a strong impact on overall performance of the WSN. An algorithm to transfer data using energy efficient mobile anchor based localization mechanism is presented in this paper. Firstly, the distance between anchor node and unknown node is determined using Received Signal Strength (RSS) and then using Trilateration method location of the unknown node is identified. Proposed algorithm aims to decrease the consumable energy that improves life of the network. Simulation results are compared with the existing localization technique to evaluate performance of the proposed algorithm in terms of energy consumption, packet delivery ratio and control overheads. The proposed scheme performs better than the existing Mobile Anchor Assisted Localization algorithm based on Regular Hexagon (MAALRH) for WSNs

A Performance Analysis of an Enhanced Graded Precision Localization Algorithm for Wireless Sensor Networks

Ad hoc wireless sensor networks are composed of many tiny, low-energy, low-capacity sensors that communicate ad hoc. A significant amount of research has been conducted on localization in wireless sensor networks (WSNs). In WSNs, localization or positioning is the process of determining the physical coordinates of sensor nodes, and it is an important factor in determining the origin of events in modern communication systems. Localization methods vary based on the time-critical requirements for different applications. For improving localization accuracy, several algorithms have been proposed. In the proposed scheme, a sensor node is located in a region bounded by a network of anchor nodes. Lower bound accuracy is found and an analytical framework is provided to localize the sensor. Extensive repeatable tests on numerous networks are used to illustrate the usefulness of the suggested approach. The key advantage of the proposed algorithm is independent of the environmental irregularities.

Improved Wireless Sensor Network Localization Algorithm Based on Selective Opposition Class Topper Optimization (SOCTO)

One of the most important challenges in wireless sensor networks is the issue of localization. Furthermore, it is critical to monitor and evaluate the data gathered. With the aid of a collection of constructed nodes known as beacons, the localization technique can measure node location. For a variety of factors, such as upkeep, lifespan, and breakdown, the fixed density of these beacons may be increased or decreased. Because of its robustness, flexibility, and economic viability, a well-known technique for locating wireless sensor network nodes is the distance vector-hop (DV-Hop) algorithm. As a result, researchers continue to look for ways to develop it. Based on a proposed selective opposition class topper optimization (SOCTO), an enhanced DV-Hop localization algorithm is developed. It also focuses on an optimised formulation to compute the average hop-size with weight of beacon nodes in order to reduce the localization error within the estimated distance between the beacon and the dumb node, due to improved localization accuracy. The range-free localization algorithm in uniform multi-hop wireless sensor networks is the subject of a recent study. The results show that our proposed method outperforms the DV-Hop technique and related techniques in terms of average localization error (\(0.05\%\)) versus random beacon node deployment, average localization error (\(0.04\%\)) versus circular beacon node deployment, and average localization error (\(0.08\%\)) versus spiral beacon node deployment.

A Trust Assessment-Based Distributed Localization Algorithm for Sensor Networks Under Deception Attacks

Dear Editor, This letter is concerned with the distributed localization issue for wireless sensor networks subject to deception attacks. It is assumed that malicious nodes randomly launch attacks to tamper the ranging information between sensors. In order to accommodate the effects of deception attacks, a trust assessment-based distributed localization algorithm is proposed. Combined with data fusion of barycentric coordinates, our algorithm can achieve accurate localization. Finally, numerical simulations are given to validate the effectiveness of the proposed localization algorithm.

A novel predictive localization algorithm for underwater wireless sensor networks

A novel predictive localization algorithm for underwater wireless sensor networks

A localization algorithm for DV-Hop wireless sensor networks based on manhattan distance

A localization algorithm for DV-Hop wireless sensor networks based on manhattan distance

Cuboid-based Wireless Sensor Network Localization Algorithm

Localization is one of the key technologies in wireless sensor networks (WSNs), since it provides fundamental support for many location-aware protocols and applications. Constraints on cost and power consumption make it infeasible to equip each sensor node in the network with a global position system (GPS) unit, especially for large-scale WSNs. A promising method to localize unknown nodes is to use anchor nodes, which are equipped with GPS units among unknown nodes and broadcast their current locations to help nearby unknown nodes with localization. In this paper we can proposed a novel algorithm of cuboid localization with the help of central point precision method. Simulation shows that the results are far better then existing cuboid methods and gain accuracy of up to 83% with a localization error of 1.6m and standard deviation of 2.7.

Node localization algorithm for wireless sensor networks based on static anchor node location selection strategy

To better solve the contradiction between the localization accuracy, localization coverage, and the location of anchor nodes in wireless sensor networks, a node localization algorithm for wireless sensor networks based on static anchor node location selection strategy is proposed in this paper. Firstly, collect the signal strength between wireless sensor network nodes, judge whether there is a connection between nodes according to the set signal strength threshold, and convert the node distribution diagram into the node connection relationship diagram, that is, the topology diagram. Then, the closeness centrality value of each node is calculated by using the closeness centrality algorithm, and the obtained closeness centrality values are sorted in descending order, the node with the largest closeness centrality value is the first anchor node, the closeness centrality values are traversed at equal intervals, and the optimal equal interval is selected by using the quick sort algorithm, and the selected nodes are used as the other anchor nodes. Finally, other unknown nodes in the network are located according to the location of anchor nodes. Simulation results show that the proposed algorithm is superior to the existing typical algorithms in localization accuracy and localization coverage.

Node Localization Algorithm Based on Modified Archimedes Optimization Algorithm in Wireless Sensor Networks

Node localization information plays an important role in wireless sensor networks (WSNs). To solve the problem of low localization accuracy of distance vector hop (DV-Hop) localization algorithm in wireless sensor networks, an improved localization algorithm called MAOADV-Hop based on the modified Archimedes optimization algorithm (MAOA) and DV-Hop is proposed, which can achieve the balance between the localization speed and the localization precision. Firstly, tent chaotic mapping and particle swarm optimization (PSO) algorithm are introduced into Archimedes optimization algorithm to improve the initial population diversity and change the update rules of density and volume, which improve the global convergence ability and convergence speed of the algorithm. Secondly, the MAOA is used to replace the least square part of the DV-Hop localization algorithm to improve the localization accuracy of the algorithm. Finally, MAOADV-Hop is verified through four different network environments and compared with DE_DV-Hop, BOA_DV-Hop, and DV-Hop. The simulation results show that the localization speed of the proposed approach is faster than that of DE_DV-Hop and BOA_DV-Hop, and the localization error is less than that of DV-Hop, DE_DV-Hop, and BOA_DV-Hop.

Addressing the Directionality Challenge through RSSI-Based Multilateration Technique, to Localize Nodes in Underwater WSNs by Using Magneto-Inductive Communication

The deployment and efficient use of wireless sensor networks (WSNs) in underwater and underground environments persists to be a difficult task. In addition, the localization of a sensor Rx node in WSNs is an important aspect for the successful communication with the aforementioned environments. To overcome the limitations of electromagnetic, acoustic, and optical communication in underwater and underground wireless sensor networks (UWSNs), magneto-inductive (MI) communication technology emerged as a promising alternative for usage in UWSNs with a wide range of applications. To make the magneto-inductive underwater wireless sensor networks (MI-UWSNs) more efficient, recently, various research studies focused on the optimization of the physical layer, MAC layer, and routing layer, but none of them has taken into account the effect of directionality. Despite the directionality issue posed by the physical nature of a magnetic field, the unique qualities of MI communication open up a gateway for several applications. The directionality issue of MI sensors is a critical challenge that must be taken into account while developing any WSN protocol or localization algorithm. This paper highlights and discusses the severity and impact of the directionality issue in designing a localization algorithm for magneto-inductive wireless sensor networks (MI-WSNs). A received signal strength indicator (RSSI)-based multilateration localization algorithm is presented in this paper, where a minimum of 2 and maximum of 10 anchor Tx nodes are used to estimate the position of the sensor Rx nodes, which are deployed randomly in a 15 m × 15 m simulation environment. This RSSI-based multilateration technique is the most suitable option that can be used to quantify the impact of directionality on the localization of a sensor Rx node.

Advanced localization algorithm for wireless sensor networks using fractional order class topper optimization

Advanced localization algorithm for wireless sensor networks using fractional order class topper optimization

Low beacon node localization algorithm in sensor networks based on multi-space key distribution algorithm

Low beacon node localization algorithm in sensor networks based on multi-space key distribution algorithm