A New Game Clustering In WSNs With Critical Nodes

With the development of WSNs(wireless sensor networks), routing technology in wireless sensor networks has been steadily progressing. Variety of new algorithms have been proposed, which not only enriches the content of wireless sensor networks, but constantly trying to solve the an important problem in WSNs-the of energy consumption of nodes. From the earliest method flood to clustering routing, during classic LEACH routing protocol, and the current Swarm Intelligence routing algorithms, game theory routing algorithms, they are trying to use a variety of methods to reduce node energy consumption, balance the entire wireless energy load.Flat Routing trying to find the optimal path routing protocol to reduce the data transmission hops and reduce energy consumption; clustering routing by changing the cluster head nodes each turn in order to achieve the purpose of energy balance to prolong the network lifetime. They are all play an important role on the development of wireless sensor networks.In wireless sensor networks, the energy consumption is not the only important issue in wireless sensor networks. In fact determination information from area in network is a important role in wireless sensor networks. For example, when the information of the network area has regional and randomness characteristics, information within one area will be greater change than in some other areas, the information that nodes received in these areas are frequency. The function of wireless sensor network is data monitoring, so in this case the importance of the nodes are different, the importance of nodes which received changed information are greater than the nodes receives steady information. Users may be only focus on the important nodes. Such as wireless sensor networks with monitoring will have to focus on certain areas and nodes, so they may be interested in certain area in network area, the user want the nodes in this area can do work as long as its can, so these nodes are important than others.But the routing algorithm of WSNs can not determine whether a node is important or not, neither can determine the measure of a node’s importance, these algorithms treated equally to all nodes (which is also the presupposition of balancing energy of network). Routing algorithm ignores the importance of the nodes will cause the nodes in important area of wireless sensor network can not survive at the end of life because of the death of a random algorithm, some important information can not be collected because the nodes in that area was death. To solve this problem, we propose the concept of wireless sensor network "critical nodes information", as an expression of those nodes during collecting information, and given each node the value in the network, used to represent the importance of node during delivering important information between each node in sensor networks. When the value of critical information node’s importance is higher to protect its energy for saving consumption. But the protection of critical information nodes means that they are difficult to become a cluster head, and in order to save their energy consumption, they will choose the closest node to become cluster head, which will disrupt the optimal topology of the original wireless sensor networks, resulting in waste of energy and quick demise of individual nodes, so in order to coordinate the problem, this paper proposes a new game routing algorithm based on critical information nodes, in the game nodes to make themselves equilibrium between energy consumption and the importance of nodes, the information gain from nodes proportional to the key information, the key information of the node which is accepted by the mutation information. So choose the best game strategy can do as much as possible to reduce network energy consumption while protecting critical information nodes. Furthermore, in this algorithm, information may be added to the selection algorithm of nodes routing, making the choice of routing in wireless sensor networks have the flexibility and efficiency, has a certain significance. Finally, we simulate wireless sensor networks by Matlab, through experimental we compared the general routing algorithm and improved game routing algorithms by node energy consumption of important area in wireless sensor networks, although with new methods in wireless sensor networks has increased energy consumption of some nodes, resulting in its short life, but it is a good energy saving method by the nodes in importance information area to enable them to be longer than the lifetime of the other nodes, and the energy consumption of the entire network with other algorithms little difference between the energy consumption, with a very significance.