A novel algorithm for clustering and routing is proposed based on grid structure in wireless sensor networks. According to the size of the area and transmission range, a suitable grid size is calculated and a virtual grid structure is constructed. A cluster head is selected in each grid based on the nearest distance to the midpoint of grid. A localized single path strategy is followed in order to forward data within a grid. To forward aggregate data from cluster head to the Sink, angular inclination based combinational routing model is implemented. The simulation results show that the algorithm performs better in terms of improving the network lifetime and scalability compared to recent and relevant existing algorithms.

+More

single path strategy algorithms scalability virtual grid structure clustering and routing network lifetime algorithm sink angular inclination based combinational routing model wireless sensor networks

Siba K. Udgata,K. Lalitha,R. Thangarajan,C. Poongodi,Ambika Prasad Sahu,.GCCR: An Efficient Grid Based Clustering and Combinational Routing in Wireless Sensor Networks. (),1–21.

Siba K. Udgata, et al."GCCR: An Efficient Grid Based Clustering and Combinational Routing in Wireless Sensor Networks"

Siba K. Udgata,K. Lalitha,R. Thangarajan,C. Poongodi,Ambika Prasad Sahu,"GCCR: An Efficient Grid Based Clustering and Combinational Routing in Wireless Sensor Networks"