An Algorithmic Approach to Wireless Sensor Networks Localization Using Rigid Graphs

Abstract EN

In this work estimating the position coordinates of Wireless Sensor Network nodes using the concept of rigid graphs is carried out in detail.

The range based localization approaches use the distance information measured by the RSSI, which is prone to noise, due to effects of path loss, shadowing, and so forth.

In this work, both the distance and the bearing information are used for localization using the trilateration technique.

Rigid graph theory is employed to analyze the localizability, that is, whether the nodes of the WSN are uniquely localized.

The WSN graph is divided into rigid patches by varying appropriately the communication power range of the WSN nodes and then localizing the patches by trilateration.

The main advantage of localizing the network using rigid graph approach is that it overcomes the effect of noisy perturbed distance.

Our approach gives a better performance compared to robust quads in terms of percentage of localizable nodes and computational complexity.