Game Theoretical Computation Based Energy Efficient Routing for Wireless Sensor Networks

Abstract

The paper aims to provide an energy efficient routing algorithm for Wireless Sensor Networks (WSNs). Clustering is a technique widely adopted in WSNs. It divides the network into clusters and the cluster heads are responsible for forwarding the aggregated data to the sink. There are many algorithms for forwarding the data to the sink. In this paper, a Game theory based Energy efficient Routing Algorithm (GERA) is proposed. As a clustering algorithm GERA adopts game theory and set a utility function based on the benefit and energy consumption of the node. Cluster heads are selected based on the utility function of the node iteratively. The cluster formation is done based on the cost function of the node in the network. Also an intra-cluster and multi-hop inter-cluster routing algorithms are designed and the simulation results shows that cluster heads are evenly distributed. The proposed routing algorithm consumes less energy than other existing algorithms such as Low Energy Adaptive Clustering Hierarchy (LEACH) and Density-based Energy-efficient Game-theoretic Routing Algorithm (DEGRA). Also the network lifetime is largely prolonged.

Wireless Sensor Networks Optimization with Localization-Based Clustering using Game Theory Algorithm

“…Sensor nodes in a network that consume different energies need to use some rational energy use scheme to regulate network connectivity and function. Pitchai et al (2019) proposed a game theory based energy-efficient routing algorithm (GERA). They adopted game theory and set a utility function based on the benefit and energy consumption of the node in the clustering mechanism.…”

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

“…All the routing protocols that will be discussed in this section are listed in this figure. RCFR [35] Assignment game approach [34] GERA [33] Energy aware trust derivation scheme [32] COMO [38] Routing framework based on energy and delay conservation [38] Intercluster routing algorithm for WSN [39] Noncooperative game Resource allocation strategy for clustering based WSN [36] EEREG [41] GBRA [43] GTEB [40] GEEC [42] ERG [45] PRGT [44] WSNs are energy constrained and they require energy-efficient routing protocols for a fading environment. Many of the state-of-the-art works utilized a multi-input multi-output (MIMO) scheme to increase energy efficiency in a fading environment.…”

“…Selecting a CH in a cluster is a difficult task and should be handled carefully, as selecting a node with a lower energy level as the CH may result in network malfunction. In their paper, Pitchai et al [33] designed a game theory-based energy-efficient routing algorithm (GERA). It is a clustering algorithm that adopts game theory, in which CHs are optimally selected based on a utility function of the node.…”

“…In this protocol, the total energy consumption of a node is defined as the amount of energy consumed by a node while performing its role in routing. It is the summation of the energy required for sensing the data, aggregating the data, and transmitting the data in [33]. In this protocol, the packet delivery ratio is considered as packets delivered by the node in the network for a certain number of rounds.…”

“…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. Conversely, GERA [33] was designed to enhance the LEACH protocol by limiting the cluster size. Table 9 summarizes the qualitative comparison of the routing protocols based on the evolutionary and reputation-based games.…”