Show simple item record

dc.contributor.advisorChaudhury, Kunal Narayan
dc.contributor.authorSanyal, Rajat
dc.date.accessioned2018-08-20T12:48:58Z
dc.date.accessioned2018-08-28T09:16:51Z
dc.date.available2018-08-20T12:48:58Z
dc.date.available2018-08-28T09:16:51Z
dc.date.issued2018-08-20
dc.date.submitted2017
dc.identifier.urihttp://etd.iisc.ac.in/handle/2005/3982
dc.identifier.abstracthttp://etd.iisc.ac.in/static/etd/abstracts/4870/G28604-Abs.pdfen_US
dc.description.abstractAdvancement 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.en_US
dc.language.isoen_USen_US
dc.relation.ispartofseriesG28604en_US
dc.subjectSensor Network Localizationen_US
dc.subjectRange Free Algorithmen_US
dc.subjectRange-based Algorithmen_US
dc.subjectSNL Algorithmen_US
dc.subjectADMM Algorithmen_US
dc.subjectRigid Registrationen_US
dc.subjectCliquesen_US
dc.subjectSemidefinite Program (SDP)en_US
dc.subject.classificationElectrical Engineeringen_US
dc.titleOn a Divide-and-Conquer Approach for Sensor Network Localizationen_US
dc.typeThesisen_US
dc.degree.nameMSc Enggen_US
dc.degree.levelMastersen_US
dc.degree.disciplineFaculty of Engineeringen_US


Files in this item

This item appears in the following Collection(s)

Show simple item record