Virtual Grid Based Energy Efficient Mobile sink Routing Algorithm for WSN

In Wireless Sensor Network, sensor nodes are low powered and small devices mainly deployed in critical regions. Due to their energy constraint issues, many routing algorithms have been developed for efficient forwarding of data for minimizing energy consumption. Considering the static sink, nodes near the sink will have more load for routing data, therefore sink has been made as mobile. Now the sink can itself moves to the sensor node or leader node for collecting data as sink can be charged with high energy. Moreover sensor nodes deployed in battlefields, hills and similar risky areas are difficult to monitor for their energy issues. So the concept of grid arises. Now the sensor network can be constructed as logical grids of uniform size and data aggregation can be done using energy efficient routing. The proposed algorithm is an enhanced form of VGDRA algorithm which is grid based routing algorithm but lacks the concept of estimating energy on the basis of distance. In the proposed algorithm, sensor network is divided into logical grids of k-cells and a Cell Header (CH) is elected among each cell that acts as leader to cluster. The algorithm proves to be efficient in terms of energy by minimizing route construction cost considering shortest distance to sink.