The Inter-Cluster Routing Algorithm in Wireless Sensor Network Based on the Game Theory

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.…”

“…Link quality and node residual energy are two key factors to be considered in routing. Xin et al designed a routing protocol based on game theory taking into consideration these two key factors [39]. They developed a game model based on the quality of service (QoS) and node residual energy.…”

“…The assumed network in the protocol [39] had sensor nodes with limited energy. A hexagonal cluster topology identical to a cellular network was deployed.…”

“…The clustering algorithm designed in [39] can be regarded as a compromise between the network QoS and energy consumption. From the perspective of game theory, it was a game between the QoS and energy consumption of the nodes.…”

“…• The protocol is supposed to suffer from an energy hole problem. As CHs aggregate data to the sink node through cooperation, the CHs that are lying in the vicinity of the sink node will deplete energy faster; • The authors of [39] claimed to reach Nash equilibrium point using certain conditions. Their calculations were not sufficient to prove their claim on finding the equilibrium point; Applications:…”