A Neighborhood Grid Clustering Algorithm for Solving Localization Problem in WSN Using Genetic Algorithm

Algorithm 1

Algorithm for the neighborhood grid clustering approach.

(i)	Input:-Total number of nodes, -Side length of the grid, -Cluster center, -Network area, -Communication radius, -Neighborhood grid density.
(ii)	Output: Neighborhood grid clustered network .
(1)	To partition the grid network region into equal square shaped clusters, the transmission radius should be known
(2)	Using which denotes the grids length on each side, is computed using (8)
(3)	Each grid is considered as a single cluster with density level analyzed in (11)
(4)	With known network area , the number of grid clusters can be calculated using
(5)	One node is elected as to transmit data to other neighbors in the grid
(6)	The number of grid clusters is evaluated using
(7)	All node sends data towards their in the grid