scholarly journals Toward Collinearity-Avoidable Localization for Wireless Sensor Network

2015 ◽  
Vol 2015 ◽  
pp. 1-16 ◽  
Author(s):  
Xiaoyong Yan ◽  
Aiguo Song ◽  
Jimin Yu ◽  
Zhong Yang

In accordance with the collinearity problem during computation caused by the beacon nodes used for location estimation which are close to be in the same line or same plane, two solutions are proposed in this paper: the geometric analytical localization algorithm based on positioning units and the localization algorithm based on the multivariate analysis method. The geometric analytical localization algorithm based on positioning units analyzes the topology quality of positioning units used to estimate location and provides quantitative criteria based on that; the localization algorithm based on the multivariate analysis method uses the multivariate analysis method to filter and integrate the beacon nodes coordinate matrixes during the process of location estimation. Both methods can avoid low estimation accuracy and instability caused by multicollinearity.

2018 ◽  
Vol 2018 ◽  
pp. 1-8 ◽  
Author(s):  
Xiaoyang Liu ◽  
Chao Liu

With the rapid development of wireless sensor network (WSN) technology and its localization method, localization is one of the basic services for data collection in WSN. The localization accuracy often depends on the accuracy of distance estimation. Because of the constraint in size, power, and cost of sensor nodes, the investigation of efficient location algorithms which satisfy the basic accuracy requirement for WSN meets new challenges. This paper proposes a novel intelligent node localization algorithm in WSN based on beacon nodes to improve the precision in location estimation. Firstly, system model of WSN node localization is constructed according to the WSN environment. Then traditional WSN node localization methods such as DV-HOP, GA, and PSO are studied. Localization algorithm of WSN is proposed by using dynamic mathematics modeling. And the result of simulation, which is compared to the traditional algorithm, indicated that this algorithm is better to improve the accuracy and coverage of WSN. The simulation results show that the performance of the proposed WSN location algorithm is better than the traditional localization algorithms.


2018 ◽  
Vol 7 (2.26) ◽  
pp. 25
Author(s):  
E Ramya ◽  
R Gobinath

Data mining plays an important role in analysis of data in modern sensor networks. A sensor network is greatly constrained by the various challenges facing a modern Wireless Sensor Network. This survey paper focuses on basic idea about the algorithms and measurements taken by the Researchers in the area of Wireless Sensor Network with Health Care. This survey also catego-ries various constraints in Wireless Body Area Sensor Networks data and finds the best suitable techniques for analysing the Sensor Data. Due to resource constraints and dynamic topology, the quality of service is facing a challenging issue in Wireless Sensor Networks. In this paper, we review the quality of service parameters with respect to protocols, algorithms and Simulations. 


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Iram Javed ◽  
Xianlun Tang ◽  
Kamran Shaukat ◽  
Muhammed Umer Sarwar ◽  
Talha Mahboob Alam ◽  
...  

In a wireless sensor network (WSN), node localization is a key requirement for many applications. The concept of mobile anchor-based localization is not a new concept; however, the localization of mobile anchor nodes gains much attention with the advancement in the Internet of Things (IoT) and electronic industry. In this paper, we present a range-free localization algorithm for sensors in a three-dimensional (3D) wireless sensor networks based on flying anchors. The nature of the algorithm is also suitable for vehicle localization as we are using the setup much similar to vehicle-to-infrastructure- (V2I-) based positioning algorithm. A multilayer C-shaped trajectory is chosen for the random walk of mobile anchor nodes equipped with a Global Positioning System (GPS) and broadcasts its location information over the sensing space. The mobile anchor nodes keep transmitting the beacon along with their position information to unknown nodes and select three further anchor nodes to form a triangle. The distance is then computed by the link quality induction against each anchor node that uses the centroid-based formula to compute the localization error. The simulation shows that the average localization error of our proposed system is 1.4 m with a standard deviation of 1.21 m. The geometrical computation of localization eliminated the use of extra hardware that avoids any direct communication between the sensors and is applicable for all types of network topologies.


Location estimation in Wireless Sensor Network (WSN) is mandatory to achieve high network efficiency. Identifying the positions of sensors is an uphill task as monitoring nodes are involved in estimation and localization. Clustered Positioning for Indoor Environment (CPIE) is proposed for estimating the position of the sensors using a Cluster Head (CH) based mechanism. The CH estimates the number of neighbor nodes in each floor of the indoor environment. It sends the requests to the cluster members and the positions are estimated based on the Received Signal Strength Indicators (RSSIs) from the members of the cluster. The performance of the proposed scheme is analyzed for both stable and mobile conditions by varying the number of floors. Experimental results show that the propounded scheme offers better network efficiency and reduces delay and localization error


Sign in / Sign up

Export Citation Format

Share Document