Research On Routing Protocols Of Wireless Sensor Network Based On Game Theory

With the high-speed development of intelligent information technology in recent years,the Internet of things,such as artificial intelligence technology in our society,plays a more and more important role,some related techniques have been widely used in our daily life.As an important device for information collection of the Internet of things,sensors play a vital role.Therefore,the research on wireless sensor network is of great significance in the current society.The wireless sensor network consists of a large number of small sensors.Because of the structural features of the sensor itself,the energy is very limited and cannot be charged,so the energy consumption problem is a key point of wireless sensor network research.In this paper,the overall architecture of wireless sensor network,sensor node composition and communication energy consumption model are briefly introduced,and the classical routing protocol is analyzed.LEACH agreement as the first put forward the routing protocol based on clustering,plane routing protocol compared to a great extent,save the network energy consumption,after the agreement is essentially targeted developed on the basis of LEACH agreement.In this paper,the algorithm of LEACH protocol is analyzed and studied,and the deficiency of this protocol is summarized through model simulation.And the specific optimization scheme is proposed for the deficiency.The details are as follows.(1)the communication path of common nodes in the network is circuitous.In order to solve this problem,we let the node communication,to compare the first node to the base station and cluster heads to the base station distance,if the node distance closer to the base station,directly make nodes communicate with the base station,in this way,the communication path to improve the node in a roundabout.(2)the selection of cluster heads does not consider the residual energy of the nodes.To solve this problem,we introduce the multiplicative factor,the residual energy is used to choose a cluster constraints formula of threshold value judgment in the nodes of the current selected cluster residual energy as a reference.(3)the cluster density is not taken into account when the cluster is established,i.e.the number of nodes in the cluster and the coverage area.We introduce the multiplicative factor based on cluster density,which is used to constrain the threshold decision formula,and the cluster density is taken into account when selecting the cluster.Role to the one at the same time,we introduce the history record node factors governing the threshold judgment formula selection of cluster heads,the sentence by the new threshold selection formula of temporary cluster heads for the league game laid a foundation.When the league game is played,the temporary cluster head will choose to cooperate with other competitors in order to gain a large profit,and finally make a redistribution of the overallincome of the alliance through Shapley value.Shapley value describes the participants' benefits and it is directly proportional to the pay,namely,the more you pay,the more benefits,in the end we revenue according to each node,in the end,choose gains little temporary cluster head is elected as the communication of cluster nodes.Finally we use MATLAB to the original agreement and the optimized are simulated,based on the related performance index analysis,validate the optimization solution in balance the network load and the feasibility of the prolong the network life cycle.