A game theoretic routing framework based on energy-delay conservation in WSNs

Efficient energy consumption and management are very crucial in wireless sensor networks (WSNs) because the sensor nodes are typically resource constrained. Proper designs of various network functions are important not only to prolong the life of a node but also to enable the network to deliver the necessary services with some assurance. In this paper, we use game theory to propose an efficient routing scheme in a WSN that consider the signal-to-interference and noise ratio (SINR) to determine the most optimal paths. The game is modeled as a dynamic, non-cooperative, and incomplete information game with the static sensor nodes as the players in the network. We define a utility function that strikes a balance between energy consumption and delay. We show that Nash equilibrium is obtained for the net utility under certain conditions. Moreover, we show that the Nash equilibrium is self-imposed when the nodes play their best response strategy. Through simulation experiments, we study the performance of the network based on the utility functions. Results reveal that the proposed routing scheme performs better than traditional ones.