Record Details

On a Divide-and-Conquer Approach for Sensor Network Localization

Electronic Theses of Indian Institute of Science

View Archive Info
 
 
Field Value
 
Title On a Divide-and-Conquer Approach for Sensor Network Localization
 
Creator Sanyal, Rajat
 
Subject Sensor Network Localization
Range Free Algorithm
Range-based Algorithm
SNL Algorithm
ADMM Algorithm
Rigid Registration
Cliques
Semidefinite Program (SDP)
Electrical Engineering
 
Description Advancement of micro-electro-mechanics and wireless communication have proliferated the deployment of large-scale wireless sensor networks. Due to cost, size and power constraints, at most a few sensor nodes can be equipped with a global positioning system; such nodes (whose positions can be accurately determined) are referred to as anchors. However, one can deter-mine the distance between two nearby sensors using some form of local communication. The problem of computing the positions of the non-anchor nodes from the inter-sensor distances and anchor positions is referred as sensor network localization (SNL).
In this dissertation, our aim is to develop an accurate, efficient, and scalable localization algorithm, which can operate both in the presence and absence of anchors. It has been demon-strated in the literature that divide-and-conquer approaches can be used to localize large net-works without compromising the localization accuracy. The core idea with such approaches is to partition the network into overlapping subnetworks, localize each subnetwork using the available distances (and anchor positions), and finally register the subnetworks in a single coordinate system. In this regard, the contributions of this dissertation are as follows:
We study the global registration problem and formulate a necessary “rigidity” condition for uniquely recovering the global sensor locations. In particular, we present a method for efficiently testing rigidity, and a heuristic for augmenting the partitioned network to enforce rigidity.
We present a mechanism for partitioning the network into smaller subnetworks using cliques. Each clique is efficiently localized using multidimensional scaling.
Finally, we use a recently proposed semidefinite program (SDP) to register the localized subnetworks. We develop a scalable ADMM solver for the SDP in question.
We present simulation results on random and structured networks to demonstrate the pro-posed methods perform better than state-of-the-art methods in terms of run-time, accuracy, and scalability.
 
Contributor Chaudhury, Kunal Narayan
 
Date 2018-08-20T12:48:58Z
2018-08-20T12:48:58Z
2018-08-20
2017
 
Type Thesis
 
Identifier http://etd.iisc.ernet.in/2005/3982
http://etd.iisc.ernet.in/abstracts/4870/G28604-Abs.pdf
 
Language en_US
 
Relation G28604