Research On Multi-Sink Deployment And Routing Algorithms In Wireless Sensor Networks

The energy of sensor node in Wireless Sensor Network(WSNs)is very limited,and some nodes near Sink are overloaded with forwarding tasks.So their energy is used up in a very short period of time.As a result,there is imbalance in energy consumption in the whole network.Aiming at this phenomenon,this thesis proposes a clustering routing method based on fuzzification and the deployment of multiple nodes at the node location,which to balance the network energy consumption and extend the network life cycle.In this thesis,three factors affecting cluster head nodes are analyzed and calculated according to fuzzy processing so that cluster head nodes can be selected better.Meanwhile,multiple sink nodes are deployed to select the best location points from candidate locations.In order to reduce the distance from the node to the sink node and to achieve a balanced state of network energy consumption.The details of this article are as follows:First,a clustering routing method based on fuzzification is proposed.There are three influence factors that the residual energy(RE),the center of the node(NC)and the distance to the sink node(D_Sink)are considered synthetically selected cluster heads.Meanwhile,three influence factors are fuzzied,quantized and weighted to turn a specific value.This is called the eigenvalue of the node,which is compared to select the best cluster head.In the process of clustering,probability methods are integrated,and the threshold ensures the normal rotation of the cluster head nodes.Second,an energy-balanced multiple sink node deployment algorithm is proposed.The deployment of multiple sink nodes can directly reduce the distance from each node to the Sink node and reduce the data transmission energy consumption of the node.The implementation of the algorithm consists of two stages: the first stage is called sink candidate location selection.Firstly,a limited number of location points are selected as primary location points according to the network size and network distribution.Then a certain number of candidate positions are selected according to the location center of the primary position points and the distribution of the primary positions around them.The second stage is sink selection,which is to choose the optimal location point among the candidate location points.The number of these optimal location points is the same as the number of sink nodes.This article compares the network life cycle and the average energy consumption with other algorithms and concludes that the author's proposed algorithm improves the performance of the network.The proposed algorithm not only alleviates the energy imbalance of each node in the network,but also prolongs the network lifetime and optimizes the network performance.