Study On Clustering-Based Routing Algorithm For Wireless Sensor Networks

As a new means of information collecting and processing, wireless sensor networks have been widely used in environmental monitoring, biological medicine, intelligent home furnishing and other fields. In wireless sensor network architecture, the network layer is responsible for routing discovery and maintenance, its routing protocol has an significant influence on the performance of the wireless sensor network. However, due to that the sensor nodes usually use micro battery whose energy is severely limited, plus that the deployment of sensor nodes is difficult to retrieve, so energy conservation is the most essential factor to consider in routing protocol design.The sensor nodes need to collaborate to sense data, and the adjacent nodes in the data area usually perceive similar data, the routing protocol that based on clustering technology can easily fuse within the cluster on data, which greatly save energy consumption and has a very good scalability, so the routing protocol based on clustering technology is an important subject of current research. This paper focuses on the clustering routing algorithm for wireless sensor networks with respect to the cluster head node selection mechanism, and the application of the game theory in wireless sensor networks.the main contents of this thesis are:(1) we have proposed a game-oriented algorithm for adaptively optimizing the routing in wireless sensor works. The game theory is introduced into clustering routing protocol in wireless sensor network research. First of all, by analyzing the communication model between nodes, which can adaptively choose communication strategy mutual communication between cluster heads; secondly, During the routing process, routing selection and routing forwarding algorithms are introduced so that our algorithm cannot only identify the most reliable next-hop node through pairwise game but also adaptively select the most energy-efficient means of communication. the proposed routing algorithm can effectively reduce communication energy consumption and prolong network lifetime.(2) A low energy consumption clustering algorithm for wireless sensor network has been proposed. We improved the cluster head selection strategy, in the selection of cluster head, we not only consider the residual energy of nodes, but also analyze the energy overhead for being a cluster head. Combined with the retreat mechanism, the nodes with low energy consumption when it completes for the cluster head have a greater probability of becoming cluster head node. Theoretical derivation and analysis proves that by setting reasonable parameters, cluster heads can be very evenly distributed in the network. Finally, the simulation results show the effectiveness of the algorithm.Wireless sensor network routing algorithm is complicated, the paper on the basis of predecessors’researches, incorporate the ideas of game theory into routing and routing forwarding, just made some analysis and exploration.