Clustering Routing Protocol For Large-scale Wireless Sensor Networks Based On Multi-hop Method

It is a great challenge for designing a routing protocol to maximize the survival time of Wireless Sensor Network,due to the limited energy of sensor node.Wireless sensor network routing protocols contains Hierarchical routing protocols and Flatting routing protocols.Hierarchical routing protocol can effectively extend the network lifetime than flatting routing protocols.Hierarchical routing protocol assumes that all nodes can communicate with SINK node directly.As the scale of WSN increases,the average distance between cluster head node and Base Station node increases that results in increasing of energy consumption of network,because Multipath fading model.With the expansion of WSN scale,the average distances between cluster head node and Base Station increase significantly in Hierarchical network,that result in much more communication energy cost.Therefore,it is significantly to propose a routing protocol for large scale of Wireless Sensor Network.This paper introduces current routing.protocol for large-scale of Wireless Sensor Network.It mainly contains two aspects:the selection of cluster head and the multi-hop between cluster head nodes.We proposed three kinds of improved routing protocol based on these two aspects.(1)Traditional methods selected cluster head node randomly that resulting in uneven distribution and unbalance of cluster.Lower residual energy of node can becomes cluster head node by random elections.So,we adopt the method that residual energy of node as an indicator to elect cluster head node,while merging the neighbor clusters.(2)Although,we adopted method that residual energy of node as an indicator to elect cluster head node are still have some drawbacks.So,we proposed a new mechanism of cluster head competition that the density and the residual energy of node as a competitive factor.This method can ensure uniform distribution and balance of cluster.(3)As the scale of WSN increases,the average distance between cluster head node and Base Station node increases.Traditional methods construct multi-hop between clusters by global information of cluster head nodes.Then,it is hard to get global information of cluster head nodes because it is costs a lot of energy.So,we proposed a new method that the square of the distance as an indicator to build weighted tree based on local information of cluster head node.Experimental results show that the merge neighboring clusters and build multi-hop between clusters by Pythagorean Theorem can effectively reduce energy consumption and prolong the lifetime of the network.It has guiding significance for building network topology and application of the large-scale WSN.However,the competition of cluster head and build weighted tree between clusters heads and Base Station according to the local information of cluster head.In the case of homogeneous energy setting,experimental results show that the lifetime of WTCC is much better than other routing protocols.