Research On Clustering Routing Protocol Based On Fixed Partition In Wireless Sensor Network

Currently, wireless sensor networks have become one of the hot spots in thecommunication field. However, the energy of sensor nodes are limited, in general theenergy can not be added, and wireless communication consumes the most energy.Therefore, designing or modifying a routing protocol which is more suitable forwireless sensor network to reduce the energy consumption of nodes and prolong thenetwork lifetime is crucial.Based on the detailed analysis of the most typical clustering routing protocol inwireless sensor networks----LEACH protocol, it points out the existing problems ofLEACH. For the existing problems in choosing cluster head, forming cluster andtransmitting data of LEACH protocol, this thesis proposes a network model based onfixed partition, and then according to the model, it proposes a clustering routingprotocol based on fixed partition (CRBOFP).In CRBOFP protocol, the network is divided into partitions according to thenetwork model based on fixed partition, and then it select the cluster head nodeseparately in each partition. When choosing cluster heads in each partition, first of all,it chooses the candidate cluster head based on the residual energy of nodes, the timesthat the nodes have been cluster heads and the times that the nodes have been therelaying nodes. Then it chooses the final cluster head from the candidate cluster headcollection based on the degree of the candidate cluster head node. In order to reducethe number of duplication select the cluster head, it needs to compare the residualenergy of cluster head node and the average energy within the cluster to determinewhether to re-select the cluster head from the second round. In clustering stage, itintroduces node residual energy level and clustering factor. The clustering factor isrelated with the distance between non-cluster head nodes and the cluster head and theresidual energy of the cluster head, and non-cluster head nodes join the cluster withthe lowest node residual energy level or the largest clustering factor. From the secondround, it also needs to compare the residual energy of cluster head node and theaverage energy within the cluster to determine whether to re-cluster. During theinter-cluster communication, it introduces communication weights. Cluster heads useDijkstra algorithm to select the optimal path to the base station based oncommunication weights, and then it forwards the data to the base station along theoptimal path. To ensure the reliability of data transmission, the node sends a query message to the destination node before sending the data to make sure whether thedestination node can receive data correctly.Finally, it uses NS2network simulation software to simulate CRBOFP protocoland LEACH protocol. The simulation results show in terms of the energyconsumption of nodes, the number of surviving nodes and the reliability of protocol,CRBOFP protocol is better than LEACH protocol.