| Sensor nodes form WSNs in the monitoring area through self-organization,and are used to monitor data in the area.The detected data is transmitted to the destination through multi-hop and wireless communication between nodes.Therefore,the routing algorithm in WSNs is crucial to the establishment of data transmission paths.The PEGASIS algorithm is widely used in common routing algorithms.It has the characteristics of low communication overhead between two adjacent nodes,data transmission and reception using data fusion to reduce the number of communications,thereby reducing energy consumption,but there are also excessive links formed in the network caused by The large data transmission delay and the large amount of data transmitted by the cluster head in the chain become the defects of the network bottleneck.(1)In order to solve the problem that the nodes in the PEGASIS algorithm take turns acting as cluster heads without considering the remaining energy and communication energy consumption of the nodes themselves,this paper designs an improved cluster head election routing algorithm based on PEGASIS.This algorithm is different from the PEGASIS algorithm.The election of cluster head nodes is based on the ratio of the energy consumption of a single node communicating with the base station and the average energy consumption of the entire network node communicating with the base station,which is compared with the remaining energy of a single node and the entire network node.The ratio of the average remaining energy to the appropriate cluster head node can be selected,which improves the energy consumption of the traditional PEGASIS algorithm when the cluster head is elected in turn,and makes the survival time of WSNs longer.(2)In order to solve the problems of too long links formed by the PEGASIS algorithm,too much energy consumption,and long data transmission time,this paper designs a sub-regional tree-type multi-chain WSNs routing algorithm.By dividing WSNs into several regions,the nodes in each region are connected into a chain according to the distance and angle between them.If there is a cross chain,delete the longer chain in the cross chain.Then connect the isolated nodes generated in the chaining process with the nodes that have already been chained.Finally,the chain heads of the sub-chains are connected to form a main chain.This algorithm can avoid the formation of long chains,reduce the time of data transmission in the network,reduce unnecessary energy consumption in the network,and make the survival time of WSNs longer.This paper analyzes the routing algorithm based on PEGASIS's improved cluster head election through theoretical analysis,and concludes that the cluster head elected by this algorithm reduces the communication energy consumption of the cluster head elected by the traditional PEGASIS algorithm node in turn.Through the energy consumption model,the tree-type multi-chain WSNs routing algorithm is analyzed,and it is concluded that the energy consumption of data packets is reduced in the link formed by the algorithm,which can theoretically reduce the overall energy consumption of WSNs.At the same time,the simultaneous data transmission of multiple sub-chains can reduce the time delay of data transmission in the network,and is beneficial to the maintenance and management of the network.Through experimental simulation comparison,the results show that the improved PEGASIS-based cluster head election algorithm is located at(50,200)at the base station,and when k=150,the network life cycle is extended by 100 rounds compared with the traditional PEGASIS algorithm;sub-regional tree The life cycle of the multi-chain WSNs routing algorithm network is longer than that of the traditional PEGASIS algorithm by 180 rounds.To a certain extent,the survival time of WSNs becomes longer.At the same time,the transmission delay of data packets is also reduced.So this algorithm is better... |
PDF Full Text Request