Cluster tree hierarchical wireless sensor network routing method with optimized energy efficiency

A wireless sensor network and layered network technology, applied in the field of wireless sensor network routing protocols, can solve the problems of inability to guarantee the distribution of cluster heads, fast energy loss of cluster heads, etc., to reduce communication costs, avoid premature death, The effect of enhancing scalability

CN103781143AInactive Publication Date: 2014-05-07SOUTHEAST UNIV
3 Cites 20 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Publication Date
2014-05-07
Estimated Expiration
Not applicable · inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention discloses a cluster tree hierarchical wireless sensor network routing method with the optimized energy efficiency. The method includes the first step of automatically and dynamically organiing clustering during a cluster construction period, the second step of carrying out random selection on cluster head nodes according to the energy balance principle through the consideration on node energy factors, the third step of utilizing a minimum spanning tree Prim algorithm to construct a cluster tree hierarchical network route, namely, points in the Prim algorithm correspond to the cluster head nodes selected in a wireless sensor network, and the weights of sides correspond to energy weighting distances between the cluster head nodes, and the fourth step of constructing the cluster head nodes to a multi-hop routing network structure. Through the protocol, the cluster heads are reasonably selected in the application of the wireless sensor network which is powered through the energy harvesting technology, and consequently effective utilization of energy can be achieved, the communication cost between the nodes is reduced, the problem of the premature death of the cluster head nodes due to long-distance communication is solved, and the prolonging of the lifetime of the whole network is facilitated; in addition, the application of the spanning tree algorithm enhances the expandability of the protocol.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to an Energy-Efficiency Clustering Tree Hierarchy (Optimized Energy-Efficiency Clustering Tree Hierarchy, OEECTH for short) wireless sensor network routing method, which belongs to the wireless sensor network routing protocol technology. Background technique

[0002] Wireless sensor network technology is the product of the combination of communication technology, computer technology, sensor technology and network technology. One of the most important technologies of the century. In recent years, energy-efficient wireless sensor networks have gradually become a research hotspot, and the idea of ​​low power consumption also echoes the concept of green environmental protection advocated today. Low Energy Adaptive Clustering Hierarchy (LEACH for short) is the first hierarchical routing protocol proposed in wireless sensor networks, and most of the subsequent hierarchical routing protocols are here developed on the basis of. The cor...

Examples

Embodiment Construction

[0031] The present invention will be further described below in conjunction with the accompanying drawings.

[0032] The present invention proposes two improvements and optimizations for the inadequacies of the LEACH protocol: one is to add energy harvesting and power supply considerations in the cluster head node election process, and give priority to nodes with greater energy to become cluster heads, which is more suitable for today In the popular green new energy WSN application; on the other hand, for the problem of excessive energy consumption of single-hop communication between the cluster head node, especially the node far away from the base station and the base station, the minimum spanning tree is used for reference. The Prim Algorithm (Prim for short) in the algorithm proposes an energy-efficient optimized cluster tree hierarchy routing protocol (Optimized Energy-Efficiency Clustering Tree Hierarchy, OEECTH for short). The protocol selects the cluster head reasonably...