Parametric Loop Division for 3D Localization in Wireless Sensor Networks

Wireless Sensor Network-Based Rigid Body Localization for NLOS Parameter Estimation

In wireless sensor network (WSN)-based rigid body localization (RBL) systems, the non-line-of-sight (NLOS) propagation of the wireless signals leads to severe performance deterioration. This paper focuses on the RBL problem under the NLOS environment based on the time of arrival (TOA) measurement between the sensors fixed on the rigid body and the anchors, where the NLOS parameters are estimated to improve the RBL performance. Without any prior information about the NLOS environment, the highly non-linear and non-convex RBL problem is transformed into a difference of convex (DC) programming, which can be solved by using the concave-convex procedure (CCCP) to determine the position of the rigid body sensors and the NLOS parameters. To avoid error accumulation, the obtained NLOS parameters are utilized to refine the localization performance of the rigid body sensors. Then, the accurate position and the orientation of the rigid body in two-Dimensional space are obtained according to the relative deflection angle method. To reduce the computational complexity, the singular value decomposition (SVD) method is employed to solve the problem in three-Dimensional space. Simulation results show that the proposed method can effectively improve the performance of the rigid body localization based on the wireless sensor network in NLOS environment.

A Particle Shift Prior Information Fusion Localization Algorithm for the Autonomous Internet of Vehicles

Ensuring that a vehicle can obtain its real location in a high-precision prebuilt map is one of the most important tasks of the Autonomous Internet of Vehicles (AIoV). In this work, we show that the resampling of the particle filter (PF) algorithm is optimized by using the prior information of particles that shift real localizations to improve vehicle localization accuracy without changing the existing PF process, i.e., the particle shift filter (PSF). The number of particles is critical to their convergence efficiency. We perform quantitative and qualitative analyses of how to improve particle localization accuracy while ensuring timeliness, without increasing the number of particles. Moreover, the cumulative error of the particles increases with time, and the localization accuracy and robustness decrease. Our findings show that the initial particle density is 159 particles/m3, and the cumulative variance of the PSF particles is improved by 27%, 29%, and 82% at the x-, y-, and z-axes, respectively, under the same conditions as the PF algorithm, while the calculation time only increases by 10.6%. Moreover, the cumulative mean error is reduced by 0.74 m, 0.88 m, and 0.68 m at the x-, y-, and z-axes, respectively, indicating that the localization error of the PSF changes less with time. All experiments were performed using open-source software and datasets.

An Enhanced DV-Hop Localization Scheme Based on Weighted Iteration and Optimal Beacon Set

Node localization technology has become a research hotspot for wireless sensor networks (WSN) in recent years. The standard distance vector hop (DV-Hop) is a remarkable range-free positioning algorithm, but the low positioning accuracy limits its application in certain scenarios. To improve the positioning performance of the standard DV-Hop, an enhanced DV-Hop based on weighted iteration and optimal beacon set is presented in this paper. Firstly, different weights are assigned to beacons based on the per-hop error, and the weighted minimum mean square error (MMSE) is performed iteratively to find the optimal average hop size (AHS) of beacon nodes. After that, the approach of estimating the distance between unknown nodes and beacons is redefined. Finally, considering the influence of beacon nodes with different distances to the unknown node, the nearest beacon nodes are given priority to compute the node position. The optimal coordinates of the unknown nodes are determined by the best beacon set derived from a grouping strategy, rather than all beacons directly participating in localization. Simulation results demonstrate that the average localization error of our proposed DV-Hop reaches about 3.96 m, which is significantly lower than the 9.05 m, 7.25 m, and 5.62 m of the standard DV-Hop, PSO DV-Hop, and Selective 3-Anchor DV-Hop.

Artificial Bee Colony Reinforced Extended Kalman Filter Localization Algorithm in Internet of Things with Big Data Blending Technique for Finding the Accurate Position of Reference Nodes

In recent years, the growth of internet of things (IoT) is immense, and the observations of their evolution need to be carried out effectively. The development of the IoT has been broadly adopted in the construction of intelligent environments. There are various challenging IoT issues such as routing messages, addressing, Localizing nodes, data blending, etc. Formerly learning eloquent information from big data systems to construct a data-gathering setup in an IoT environment is challenging. Among many viable data sources, the IoT is a rich big data source: Various IoT nodes produce a massive quantity of data. Localization is one of the crucial problems that make a significant impact inside the IoT system. It needs to be engaged with proper and effective procedures to collect all sorts of data without noise. Numerous localization procedures and schemes have been initiated by deploying the IoT sensor with wireless sensor networks for both interior and outside environments. To accomplish higher localization accuracy, with less cost for the large volume of data, it is considered a hectic task in the IoT sensor environment. By viewing the nature of the IoT, the merging of different technologies such as the internet, WiFi, etc., can aid diverse ways to acquire information about various objects' locations. Location-based service is an exceptional service of the IoT, whereas localization accuracy is a significant issue. The data generated from the sensor are available in both static and dynamic forms. In this article, a sophisticated accuracy localization scheme for big data is proposed with an optimization approach that can effectively produce proper and effective outcomes for IoT environments. The theme of the article is to develop an enriched Swarm Intelligence algorithm based on Artificial Bee Colony by using the EKF (Extended Kalman Filter) data blend technique for improving Localization in IoT for the unsuspecting environment. The performance of the proposed algorithm is evaluated by using communication consumption and Localization accuracy and its comparative advantage.

Green Communication for Underwater Wireless Sensor Networks: Triangle Metric Based Multi-Layered Routing Protocol

In this paper, we propose a non-localization routing protocol for underwater wireless sensor networks (UWSNs), namely, the triangle metric based multi-layered routing protocol (TM2RP). The main idea of the proposed TM2RP is to utilize supernodes along with depth information and residual energy to balance the energy consumption between sensors. Moreover, TM2RP is the first multi-layered and multi-metric pressure routing protocol that considers link quality with residual energy to improve the selection of next forwarding nodes with more reliable and energy-efficient links. The aqua-sim package based on the ns-2 simulator was used to evaluate the performance of the proposed TM2RP. The obtained results were compared to other similar methods such as depth based routing (DBR) and multi-layered routing protocol (MRP). Simulation results showed that the proposed protocol (TM2RP) obtained better outcomes in terms of energy consumption, network lifetime, packet delivery ratio, and end-to-end delay.

Social Network Analysis Based Localization Technique with Clustered Closeness Centrality for 3D Wireless Sensor Networks

In this paper, we proposed a new wireless localization technique based on the ideology of social network analysis (SNA), to study the different properties of networks as a graph. Centrality is a main concept in SNA, so we propose using closeness centrality (CC) as a measurement to denote the importance of the node inside the network due to its geo-location to others. The node with highest degree of CC is chosen as a cluster heads, then each cluster head can form its trilateration process to collect data from its cluster. The selection of closest cluster based on CC values, and the unknown node’s location can be estimated through the trilateration process. To form a perfect trilateration, the cluster head chooses three anchor nodes. The proposed algorithm provides high accuracy even in different network topologies like concave shape, O shape, and C shape as compared to existing received signal strength indicator (RSSI) techniques. Matlab simulation results based on practical radio propagation data sets showed a localization error of 0.32 m with standard deviation of 0.26 m.

An Anonymous Channel Categorization Scheme of Edge Nodes to Detect Jamming Attacks in Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are vulnerable to various security threats. One of the most common types of vulnerability threat is the jamming attack, where the attacker uses the same frequency signals to jam the network transmission. In this paper, an edge node scheme is proposed to address the issue of jamming attack in WSNs. Three edge nodes are used in the deployed area of WSN, which have different transmission frequencies in the same bandwidth. The different transmission frequencies and Round Trip Time (RTT) of transmitting signal makes it possible to identify the jamming attack channel in WSNs transmission media. If an attacker jams one of the transmission channels, then the other two edge nodes verify the media serviceability by means of transmitting information from the same deployed WSNs. Furthermore, the RTT of the adjacent channel is also disturbed from its defined interval of time, due to high frequency interference in the adjacent channels, which is the indication of a jamming attack in the network. The simulation result was found to be quite consistent during analysis by jamming the frequency channel of each edge node in a step-wise process. The detection rate of jamming attacks was about 94% for our proposed model, which was far better than existing schemes. Moreover, statistical analyses were undertaken for field-proven schemes, and were found to be quite convincing compared with the existing schemes, with an average of 6% improvement.

Noise Reduction Scheme for Parametric Loop Division 3D Wireless Localization Algorithm Based on Extended Kalman Filtering

Thanks to IEEE 802.15.4 defining the operation of low-rate wireless personal area networks (LR-WPANs), the door is open for localizing sensor nodes using tiny, low power digital radios such as Zigbee. In this paper, we propose a three-dimensional (3D) localization scheme based on well-known loop invariant for division algorithm. Parametric points are proposed by using the reference anchor points bounded in an outer region named as Parametric Loop Division (PLD) algorithm. Similar to other range-based localization methods, PLD is often influenced by measurement noise which greatly degrades the performance of PLD algorithm. We propose to adopt extended Kalman filtering (EKF) to refine node coordinates to mitigate the measurement noise. We provide an analytical framework for the proposed scheme and find the lower bound for its localization accuracy. Simulation results show that compared with the existing PLD algorithm, our technique always achieves better positioning accuracy regardless of network topology, communication radius, noise statistics, and the node degree of the network. The proposed scheme PLD-EKF provides an average localization accuracy of 0.42 m with a standard deviation of 0.26 m.