Growing ramification in WSN contemplations are not restricted to routing, construction of protocols, dynamic of mobile nodes and infrastructure of the network. Although transcended to geometric level demonstrated as computational and dynamical geometries in spite of graph theory. In this paper we present step forward recognition features of a network devoted to solve the problem of reconstructing the disconnected network by connecting any disconnected chains. It considers geometrical properties of random depletion nodes deviated from unit grid. Number of chains and number of nodes in each chain are calculated with the average number of connections to a total nodes and longest chain. Histogram represented number of chains and numbers of nodes for each chain are used to show fragmentation of the network. Algorithm included a method to translate adjacent matrix to chain matrix and vice versa to check the agreement of initial case with the results. The amount of chain deviation and average connections per node for longest connected chain and for the total network are drawn as bar charts and conduct interpretations.