Geometric range‐free distance estimation using reference anchor in wireless sensor networks

2016 ◽  
Vol 52 (1) ◽  
pp. 79-81
Author(s):  
Hyunjae Woo ◽  
Chaewoo Lee
Sensors ◽  
2019 ◽  
Vol 19 (21) ◽  
pp. 4665 ◽  
Author(s):  
Zhaoyang Wang ◽  
Xuebo Jin ◽  
Xiaoyi Wang ◽  
Jiping Xu ◽  
Yuting Bai

Reliable and accurate localization of objects is essential for many applications in wireless networks. Especially for large-scale wireless sensor networks (WSNs), both low cost and high accuracy are targets of the localization technology. However, some range-free methods cannot be combined with a cooperative method, because these range-free methods are characterized by low accuracy of distance estimation. To solve this problem, we propose a hard decision-based cooperative localization method. For distance estimation, an exponential distance calibration formula is derived to estimate distance. In the cooperative phase, the cooperative method is optimized by outlier constraints from neighboring anchors. Simulations are conducted to verify the effectiveness of the proposed method. The results show that localization accuracy is improved in different scenarios, while high node density or anchor density contributes to the localization. For large-scale WSNs, the hard decision-based cooperative localization is proved to be effective.


2021 ◽  
Vol 2 (4) ◽  
pp. 171-176
Author(s):  
Pasumpon Pandian A

Wireless sensor networks (WSN) consists of a huge number of nodes that are positioned randomly to obtain information regarding the environment and communicate with each other. On detection of an event, obtaining information regarding the geographical location of the sensor is beneficial in most applications. Range-free and range-based localization schemes are the major categories of localization algorithms available. Range-free localization algorithms utilize the connectivity information to provide a cost efficient localization solution. On the other hand, range-based localization schemes use radio signal strength and distance from anchor nodes for estimating the unknown node location. Several swarm intelligence algorithms are used for reducing the noise while optimizing localization and distance estimation while using these schemes. In this paper, we propose an enhanced swarm intelligence scheme that provides better performance when compared to the existing algorithms in terms of noise level, signal strength, number of anchors, number of nodes, radio signal strength and localization error. Surrogate based optimization (SBO), firefly algorithm (FA), butterfly optimization algorithm (BOA), genetic algorithm (GA) and particle swarm optimization (PSO) algorithm are compared with the proposed scheme.


Author(s):  
Rekha Goyat ◽  
Mritunjay Kumar Rai ◽  
Gulshan Kumar ◽  
Hye-Jin Kim ◽  
Se-Jung Lim

Background: Wireless Sensor Networks (WSNs) is considered one of the key research area in the recent. Various applications of WSNs need geographic location of the sensor nodes. Objective: Localization in WSNs plays an important role because without knowledge of sensor nodes location the information is useless. Finding the accurate location is very crucial in Wireless Sensor Networks. The efficiency of any localization approach is decided on the basis of accuracy and localization error. In range-free localization approaches, the location of unknown nodes are computed by collecting the information such as minimum hop count, hop size information from neighbors nodes. Methods: Although various studied have been done for computing the location of nodes but still, it is an enduring research area. To mitigate the problems of existing algorithms, a range-free Improved Weighted Novel DV-Hop localization algorithm is proposed. Main motive of the proposed study is to reduced localization error with least energy consumption. Firstly, the location information of anchor nodes is broadcasted upto M hop to decrease the energy consumption. Further, a weight factor and correction factor are introduced which refine the hop size of anchor nodes. Results: The refined hop size is further utilized for localization to reduces localization error significantly. The simulation results of the proposed algorithm are compared with other existing algorithms for evaluating the effectiveness and the performance. The simulated results are evaluated in terms localization error and computational cost by considering different parameters such as node density, percentage of anchor nodes, transmission range, effect of sensing field and effect of M on localization error. Further statistical analysis is performed on simulated results to prove the validation of proposed algorithm. A paired T-test is applied on localization error and localization time. The results of T-test depicts that the proposed algorithm significantly improves the localization accuracy with least energy consumption as compared to other existing algorithms like DV-Hop, IWCDV-Hop, and IDV-Hop. Conclusion: From the simulated results, it is concluded that the proposed algorithm offers 36% accurate localization than traditional DV-Hop and 21 % than IDV-Hop and 13% than IWCDV-Hop.


2011 ◽  
Vol 2011 ◽  
pp. 1-6 ◽  
Author(s):  
M. Keshtgary ◽  
M. Fasihy ◽  
Z. Ronaghi

Knowledge of nodes' locations is an important requirement for many applications in Wireless Sensor Networks. In the hop-based range-free localization methods, anchors broadcast the localization messages including a hop count value to the entire network. Each node receives this message and calculates its own distance with anchor in hops and then approximates its own location. In this paper, we review range-free localization methods and evaluate the performance of two methods: “DV-hop” and “amorphous” by simulation. We consider some parameters like localization accuracy, energy consumption, and network overhead. Recent papers that evaluate localization methods mostly concentrated on localization accuracy. But we have considered a group of evaluation parameters, energy consuming, and network overhead in addition to the location accuracy.


Sign in / Sign up

Export Citation Format

Share Document