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

Abstract

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.

Game theory-based Routing for Wireless Sensor Networks: A Comparative Survey

“…To determine optimal routing paths using signal-to-interference and noise ratio (SINR), Jamin et al designed a game theory-based routing protocol in [37] for WSNs. The game was modeled to be a noncooperative, dynamic, and incomplete information game.…”

“…The utility function was formulated to facilitate a balance between delay and energy consumption. The authors of [37] demonstrated that the Nash equilibrium was self-imposed if the players played their best response strategy.…”

“…The designed routing game in [37] considered the SINR and channel capacity between two communicating nodes. The objective of this routing scheme was to find out a route that could jointly decrease the energy consumption and delay.…”

“…According to the performance study in [37], the delivery latency was improved in the designed protocol, and its energy consumption was considerably less than that of the destination-sequenced distance vector routing [1], AODV [55], and DSR [1]. This protocol claimed to outperform the two very popular routing protocols of AODV and DSR in terms of energy efficiency only.…”

“…The inter-cluster routing algorithm for WSNs [39] is really a crucial protocol because it is interoperable between WSNs and mobile networks. A routing framework based on energy and delay conservation in [37] was designed and implemented in a scenario where all the nodes were static. COMO [38] is the only routing protocol that has considered end-to-end throughput instead of energy as a routing metric among the routing protocols that exploit noncooperative games.…”