Energy efficient coverage of static sensor nodes deciding on mobile sink movements using game theory

This paper
¹
deals with the movement pattern of mobile sinks in Wireless Sensor Network for efficient gathering of information by the mobile sensor nodes. We propose a mobility model for the sink to move in the network and cover the whole network area based on a game theoretic approach. A finite game model is generated for all the mobile sink nodes, and the game is played in a cooperative manner. Multiple mobile sinks act as players in the game, and try to achieve an optimal pay-off function by playing coordination game. The common goal is to cover the entire network by minimising the number of moves. The data collection process by the mobile sinks is based on consensus decision making, which in turn is self energy optimised in nature. The performance of our proposed algorithm is studied based on the metric like energy consumption by the static sensor nodes and network life time.