DisLoc: A Convex Partitioning Based Approach for Distributed 3-D Localization in Wireless Sensor Networks

Abstract

Abstract-Accurate localization in wireless sensor networks (WSNs) is fundamental to many applications, such as geographic routing and position-aware data processing. This, however, is challenging in large scale 3D WSNs due to the irregular topology, such as holes in the path, of the network. The irregular topology may cause overestimated Euclidean distance between nodes as the communication path is bent, and accordingly introduces severe errors in 3D WSN localization. As an effort towards the issue, this work develops a distributed algorithm to achieve accurate 3D WSN localization. Our proposal is composed of two steps, segmentation and joint-localization. In specific, the entire network is first divided into several subnetworks by applying the approximate convex partitioning. A spatial convex node recognition mechanism is developed to assist the network segmentation which relies on the connectivity information only. After that, each subnetwork is accurately localized by using the multi-dimensional scaling (MDS) based algorithm. The proposed localization algorithm also applies a new 3D coordinate transformation algorithm, which helps reduce the errors introduced by coordinate integration between subnetworks and improve the localization accuracy. Using extensive simulations, we show that our proposal can effectively segment a complex 3D sensor network and significantly improve the localization rate in comparison with existing solutions.

Localization of Large-Scale Wireless Sensor Networks Using Niching Particle Swarm Optimization and Reliable Anchor Selection

“…Centralized computation is used to estimate positions of sensor nodes, which imposes heavy communication burden on WSNs. MDS can also be applied by each sensor nodes itself in a distributed scheme [11], but the distributed version requires a procedure of local maps combination to determine the entire layout, which increases complexity and is impossible to complete combination if there are many disjoint patches in a given WSN [10]. DV-hop [12] consists of two message flooding phases to determine average hop length between two anchors, and an unknown node estimates its position by trilateration when it receives at least three anchor messages.…”

“…if is an anchor max { (̂,̂)} , if B i is localized by Algorithm 4 or 5 (11) where (̂,̂) is the estimated location of to localize .…”

“…We investigate the unknown node with low localization accuracy and find that these sensor nodes are often localized at the symmetric positions of their true coordinates, which is ← TRUE, = 1, 2, ⋅ ⋅ ⋅ , (8) for ← 1 to do (9) for ← 1 to do (10) if then (11) Update particles of group (12) Re-evaluate the fitness of these particles (13) Update and (14) if ( ) < then (15) return…”

An Analytical Model of Trilateration Localization Error

“…For example, in many applications of Internet of things (IoT) and wireless sensor networks (WSN), data are ascribed to the locations from where these are gathered. For this to be possible, a randomly deployed sensor or IoT node should be able to estimate its position [1], [2] using a localization algorithm [3]. Location information can also be used to improve quality of service and reliability in communication systems.…”

Device-Free Wireless Localization Using Artificial Neural Networks in Wireless Sensor Networks

“…These sensor nodes are connected through wireless communication to finish the tasks of sensing, recognizing, and monitoring in a cooperative manner. With the abilities of sensing, computing, and communicating, WSNs have been widely used in various fields, for example, indoor fire detection, object tracking, survivor sensing, and building safety monitoring [4]. In these applications, localization in WSNs plays an essential and important role [5].…”