Graph Rigidity Application for Localization in WSN

Localization in WSN involves the global discovery of node coordinates. In a network topology, a few nodes are deployed to known nodal locations and remaining node nodal location information are dynamically estimated using with algorithms. The nodes of sensor network are of random type and the topology of network varied dynamically, as a result the most of the localization techniques fails in locating exact positions. The different solution’s that are already available succumbs to measure noise. We propose an algorithmic approach using the concept of graph rigidity, where a sensor graph is drawn to make use of network topology to form globally rigid subgraphs.