scholarly journals Hard Decision-Based Cooperative Localization for Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (21) ◽  
pp. 4665 ◽  
Author(s):  
Zhaoyang Wang ◽  
Xuebo Jin ◽  
Xiaoyi Wang ◽  
Jiping Xu ◽  
Yuting Bai
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Low Cost ◽  
Distance Estimation ◽  
Wireless Sensor ◽  
Cooperative Localization ◽  
Localization Accuracy ◽  
Range Free ◽  
Hard Decision

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.

scholarly journals Performance Evaluation of Hop-Based Range-Free Localization Methods in Wireless Sensor Networks

2011 ◽  
Vol 2011 ◽  
pp. 1-6 ◽  
Author(s):  
M. Keshtgary ◽  
M. Fasihy ◽  
Z. Ronaghi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Hop Count ◽  
Localization Accuracy ◽  
Energy Consuming ◽  
Network Overhead ◽  
Entire Network ◽  
Evaluation Parameters ◽  
Range Free

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.

Advanced Sequence-Based Localization Algorithm in Wireless Sensor Networks

2014 ◽  
Vol 651-653 ◽  
pp. 387-390 ◽  
Author(s):  
Fu Bin Zhou ◽  
Shao Li Xue
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Measuring Devices ◽  
Localization Algorithms ◽  
Positioning Algorithm ◽  
Range Free

As an important application of Internet of Things , Wireless Sensor Networks utilized in surveillance and other case.Localization of nodes in wireless sensor networks is the prerequisite and base of target tracking in some surveillance applications, so localization error of sensor nodes is a key. However, due to limited energy, unreliable link and limited communication ranges of sensor nodes, high accurate positioning is difficult to achieve, which made it hot and full of challenging for wireless sensor nodes to localize without any auxiliary facilities. Range-based localization algorithm , could achieve good accuracy but require measuring devices, thus it is not appropriate for large-scale wireless sensor networks.So range-free localization algorithms are more popular.This paper analyses the algorithms in range-free localization,and proposed Advanced Sequence-Based Localization algorithm to improve the performance of positioning algorithm in wireless sensor network.

Range-Free Node Localization Schemes for Wireless Sensor Networks

2012 ◽  
Vol 457-458 ◽  
pp. 825-833
Author(s):  
Qin Qin Shi ◽  
Jian Ping Zhang ◽  
Yun Xiang Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Node Localization ◽  
Free Node ◽  
Localization Accuracy ◽  
Network Connection ◽  
Original Scheme ◽  
Node Position ◽  
Range Free

Two range-free node localization schemes modified from the conventional DV-Hop scheme are presented in this work. Different node position derivation algorithms are used to enhance the localization accuracy of DV-Hop. The principle of the algorithms and the improvement approach are illustrated. Simulation shows that the modified schemes outperform the original scheme in terms of the localization accuracy as the network connection topology varies.

scholarly journals A Three-Tier Architecture of Large-Scale Wireless Sensor Networks for Big Data Collection

2020 ◽  
Vol 10 (15) ◽  
pp. 5382 ◽  
Author(s):  
Ado Adamou Abba Ari ◽  
Asside Christian Djedouboum ◽  
Abdelhak Mourad Gueroui ◽  
Ousmane Thiare ◽  
Alidou Mohamadou ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Smart Cities ◽  
Low Cost ◽  
Memory Storage ◽  
Wireless Sensor ◽  
Communication Model ◽  
High Loss ◽  
Technological Advances

In recent years, technological advances and the ever-increasing power of embedded systems have seen the emergence of so-called smart cities. In these cities, application needs are increasingly calling for Large-Scale Wireless Sensor Networks (LS-WSN). However, the design and implementation of such networks pose several important and interesting challenges. These low-cost, low-power devices are characterized by limited computing, memory storage, communication, and battery power capabilities. Moreover, sensors are often required to cooperate in order to route the collected data to a single central node (or sink). The many-to-one communication model that governs dense and widely deployed Wireless Sensor Networks (WSNs) most often leads to problems of network overload and congestion. Indeed, it is easy to show that the closer a node is geographical to the sink, the more data sources it has to relay. This leads to several problems including overloading of nodes close to the sink, high loss rate in the area close to the sink, and poor distribution of power consumption that directly affects the lives of these networks. In this context, we propose a contribution to the problem of LS-WSN energy consumption. We designed a hierarchical 3-tier architecture of LS-WSNs coupled with a modeling of the activities of the different sensors in the network. This architecture that is based on clustering also includes a redeployment function to maintain the topology in case of coverage gaps. The results of the performed simulations show that our architecture maximizes the lifetime than compared solutions.

scholarly journals A Mobile Anchor Assisted Localization Algorithm Based on Regular Hexagon in Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Guangjie Han ◽  
Chenyu Zhang ◽  
Jaime Lloret ◽  
Lei Shu ◽  
Joel J. P. C. Rodrigues
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Regular Hexagon ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Location Aware ◽  
Mobile Anchor ◽  
Monitoring Area

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 of 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 several mobile anchors which are equipped with GPS units moving among unknown nodes and periodically broadcasting their current locations to help nearby unknown nodes with localization. This paper proposes a mobile anchor assisted localization algorithm based on regular hexagon (MAALRH) in two-dimensional WSNs, which can cover the whole monitoring area with a boundary compensation method. Unknown nodes calculate their positions by using trilateration. We compare the MAALRH with HILBERT, CIRCLES, and S-CURVES algorithms in terms of localization ratio, localization accuracy, and path length. Simulations show that the MAALRH can achieve high localization ratio and localization accuracy when the communication range is not smaller than the trajectory resolution.

Sign in / Sign up

Export Citation Format

Share Document