Volume 9, Number 13, November 2019

Finding Maximal Localizable Region in Wireless Sensor Networks by Merging Rigid Clusters

  Authors

Saroja Kanchi, Kettering University, USA

  Abstract

Localization of Wireless Sensor Network (WSN) is the problem of finding the geo-locations of sensors in a sensor network deployed in various applications. Given the prolification of sensors in various applications, the localization and tracking of sensors have received considerable attention. Properties of rigidity and flexibility of the underlying graph of the WSN have been studied as a means of determining the localizability of the nodes in the WSN. In this paper, we present a new 3-merge technique for merging three rigid clusters of a network graph, into larger rigid cluster and we use this algorithm for finding maximal localizable regions within the WSN. We provide simulation results on random deployments of WSN to prove that this technique outperforms previously known algorithms for finding maximal localizable subregions. Moreover, simulation results show that the number of anchors needed to localize the entire WSN decreases due to finding large localizable regions.

  Keywords

Wireless Sensor Network, localization, rigidity, cluster, merging

Conference Proceedings