Cooperative Research Of WSN Nodes Based On Game Theory

The wireless sensor network contains thousands of sensor nodes that can sense,measure and collect information from the environment,and can transmit and forward sensing data based on their own resource conditions.However,the wireless sensor network is different from the traditional network.The energy of the wireless sensor network is limited,and the processing and computing resources are also limited.Due to the limited resources,the node could choose selfish behavior in the process of making the decision,which leads to the lack of cooperation between nodes,thus affecting the quality and performance of network communications,so how to ensure the quality of communication and improve network energy efficiency to extend the network life cycle is the focus of our research.In this paper,the following research work is made on the problem that the network resources are limited and the nodes choose the non-forwarding selfish behavior to save their own energy.(1)Due to the limited resources of wireless sensor network,a wireless sensor network clustering routing algorithm MPCC based on CLARANS clustering is proposed to improve the energy efficiency of the network and extend the network life cycle.Firstly,the K clusters are clustered by CLARANS clustering,and the position of the centroid nodes of each cluster and the position of the nodes farthest from the centroid of the cluster are obtained.After the cluster is completed,the node creates a neighbor table based on the received sink broadcast information.The table contains the location information of other nodes in the cluster.And then calculate the distance from the node to the centroid nodes and the distance to the sink node,so as to determine the value of cluster head measurement function.Considering the remaining energy of the node,the distance from the node to the sink node and the distance from the node to the centroid nodes,the cluster head node of each cluster is selected in the most reasonable way,thus avoiding the premature death of the cluster head node and extending the life cycle of the network.The simulation results show that the MPCC algorithm improves the network lifetime by 55.6% compared with the LEACH protocol,which is 27.3% higher than the DCHS protocol.(2)In this paper,the game theory is introduced into the decision of node behavior,and the behavior of hierarchical network nodes is regulated by repeated game theory,which is based on the problem of selfish behavior.An unlimited repetitive game models based on data transmission reliability are established in the network.The selfish behavior of the nodes in the hierarchical routing occurs mainly at the cluster head node,the model is based on whether the cluster head node forwards the data of the cluster nodes.Based on the node's self-rational preference analysis and the connectivity in the multi-hop range,the payoff function of the game is determined.According to the selfish behavior of the node,the punishment mechanism of the optimal penalty degree is introduced,which not only ensured the selfish node cooperation,but also avoided the premature death of selfish nodes which subjected to excessive punishment.The simulation results show that there is an optimal value for the penalty degree of the nodes.When the optimal value is exceeded,the life cycle and network utility of the network could fall.The penalty strategy with the optimal penalty wheel can guarantee the minimum of the network life cycle,but also improve the overall efficiency of the network about 22.82%.