Clustering Routing Algorithm for Wireless Sensor Network Based on Mixed Strategy Game Theory

Abstract

We propose a clustering routing algorithm for wireless sensor networks (WSNs) based on mixed strategy game theory (CR-MSGT), which simulates the behavior of sensor nodes in a network through the mixed strategy model, so as to determine whether sensor nodes participate in the election of candidate cluster heads (CHs). The sensor nodes are randomly selected as CHs or common nodes according to their residual energy and the average energy of the network. Games are continuously played between nodes until the revenue function is maximized to reach the game equilibrium, thus proving the existence of the Nash equilibrium. Experimental results show that CR-MSGT can effectively extend the survivability of a network and mitigate the energy consumption of nodes.