Novel cluster head election method for wireless sensor networks

A wireless sensor and cluster head election technology, applied in network topology, wireless communication, advanced technology, etc., can solve problems such as single consideration factor and imperfect algorithm, achieve uniform distribution, scientific and reasonable factors considered, and reduce energy consumption. Effect

Active Publication Date: 2014-10-08
NORTHEAST DIANLI UNIVERSITY
View PDF5 Cites 23 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although the HEED algorithm proposes a new cluster head selection probability, combined with the method of LEACH random cluster selection, the algorithm considers a single factor when selecting a cluster

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 more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Novel cluster head election method for wireless sensor networks
  • Novel cluster head election method for wireless sensor networks
  • Novel cluster head election method for wireless sensor networks

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0015] The present invention will be further described below using the drawings and specific embodiments.

[0016] refer to figure 1 with figure 2 , a new method of cluster head election for a wireless sensor network of the present invention, according to the pseudo code of the new method for election of a wireless sensor network cluster head, the initialization stage is mainly the calculation of the optimal number of cluster heads, the calculation of the node degree, and the minimum achievable energy consumption of the node The calculation of node clustering probability, and the initialization of candidate node table, final node table and routing table, etc. The calculation of node clustering probability is the core of the algorithm. Nodes will calculate the probability of node clustering based on their own remaining energy consumption, maximum energy storage value, energy consumption of the last round of nodes, and average energy consumption. The formula is expressed as fo...

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

No PUM Login to view more

Abstract

The invention discloses a novel cluster head election method for wireless sensor networks. The method is characterized in that during cluster head election, a probability iteration method is used; in a probability iteration formula, node residual energy is considered, and a node energy consumption speed factor Eavecons/Econsume, a node degree factor Dnbr/Nalive, a node-to-aggregation-node distance factor dtoSINK_MAX-dtoSINK/dtoSINK_MAX-dtoSINK_MIN and the like are introduced. A mechanism of optical cluster head election can be improved to a certain degree, considered factors of cluster head election are more scientific, more reasonable and more comprehensive, uniform distribution of cluster head nodes is achieved, energy consumption of the nodes can be reduced, the life cycle of the networks is prolonged, and the novel cluster head election method can be widely applied to the wireless sensor networks.

Description

technical field [0001] The invention belongs to the technical field of wireless sensor networks, and relates to a new method for electing a cluster head of a wireless sensor network. Background technique [0002] Maximizing the lifetime of wireless sensor networks is one of the research hotspots in the field of wireless sensor networks. The routing protocols of wireless sensor networks are generally divided into planar routing and hierarchical routing. The characteristics of planar routing are simple, peer-to-peer, and easy network expansion. However, many problems such as information overlap, conflict, and self-destruction will occur during information transmission. , causing serious energy loss in the network, and the routing table of the nodes is too large, which is difficult to maintain and causes information delay problems. Hierarchical routing elects some nodes to do specific tasks, such as collecting common node data, merging and compressing data, packing and encapsu...

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
no application Login to view more
IPC IPC(8): H04W40/24H04W52/02H04W84/18
CPCY02D30/70
Inventor 李建坡陈晓娟霍俊元曲朝阳李楠赵立权
Owner NORTHEAST DIANLI UNIVERSITY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap