Improved LEACH clustering hierarchical routing algorithm
A hierarchical and routing technology, applied in the field of LEACH routing communication and wireless sensor network, it can solve the problems of unreasonable cluster head election and single clustering method in the LEACH clustering hierarchical routing algorithm, and achieve the effect of reducing energy consumption and prolonging the life cycle.
Inactive Publication Date: 2020-05-19
ANHUI UNIV OF SCI & TECH
View PDF6 Cites 6 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
[0005] The present invention mainly solves the characteristics of the traditional LEACH clustering hierarchical routing algorithm that the cluster head election is unreasonable and the clustering method is too single, so an improved algorithm based on the LEACH protocol is proposed to solve the problems existing in the prior art
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment Construction
[0040] In order to make the purpose, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and simulations. It should be understood. The specific implementations described here are only used to explain the present invention, not to limit the present invention.
[0041] The LEACH algorithm is the first hierarchical routing algorithm that defines "rounds". The election of the cluster head is a random election according to periodic rules. The election rule is that the node randomly generates a random number from zero to one. If the number is less than the threshold formula, the node is elected as the cluster head. The threshold calculation formula is as follows:
[0042]
[0043] Among them, p is the percentage of the number of cluster heads and the total number of nodes in the network, r is the number of current rounds, and G is the set of nodes that ar...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More PUM
Login to View More Abstract
The invention discloses an improved LEACH algorithm. The algorithm comprises the following steps: firstly, initializing a wireless sensor network node, evaluating the influence on cluster head election by comprehensively considering the dynamic relation between the node residual energy and the data transmission distance, carrying out the weighted calculation, and obtaining a threshold value A(n) for cluster head election; determining whether cluster heads are selected or not by judging node energy and a threshold value (if the node energy is smaller than the cluster heads, the cluster heads are selected), enabling cluster head distribution to be uniform, making judgment according to a formula, removing the cluster heads unreasonably distributed for secondary screening, and comparing the cluster heads with the threshold value formula again to supplement the number of the cluster heads; performing screening for three times according to a node set among the candidate cluster heads, and determining a final cluster head node; after cluster head election is finished, enabling each cluster head to begin to broadcast signals to the nodes in the cluster to wait for clustering requests of other nodes in the cluster; and finally, enabling each common node to receive the signal and selectively add the signal according to a nearest cluster head principle to finally form an intra-cluster node. If some common nodes are close to the aggregation node, the nodes directly transmit data with the aggregation node. And after data transmission is completed, existing clusters are disintegrated.
Description
technical field [0001] The invention relates to the field of wireless sensor networks and belongs to the technical field of LEACH routing communication. Background technique [0002] With the rapid development of Internet of Things technology, Wireless Sensor Networks (Wireless Sensor Networks, WSN) has gradually become a hot topic in the field of Internet research, mainly including sink nodes (Sink nodes), cluster heads and ordinary nodes. As a brand-new technology, it soon received widespread attention and was given a high evaluation. It is considered to be one of the top ten technologies affecting the 21st century. Wireless sensor networks have the characteristics of low cost and ad hoc networks, and the emergence of mobile wireless sensor networks (MWSN) highlights the advantages of WSN. [0003] Routing protocol is one of the key technologies of wireless sensor network, it has the function of guiding data from source node to target node. The LEACH protocol is a WSN lo...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More Application Information
Patent Timeline
Login to View More Patent Type & Authority Applications(China)
IPC IPC(8): H04W4/38H04W40/04H04W40/10
CPCH04W40/04H04W40/10H04W4/38Y02D30/70
Inventor 王创张旭马世杰王修驹王鹏宇
Owner ANHUI UNIV OF SCI & TECH