Wireless sensor network routing method based on node redundancy and graph coloring algorithm

A wireless sensor and graph coloring technology, applied in network topology, wireless communication, advanced technology, etc., can solve the problems of short network life cycle and poor overall balance of energy consumption, and achieve both routing effectiveness, energy balance, and energy The effect of consuming the whole

Active Publication Date: 2017-09-15
ZHEJIANG UNIV OF TECH
View PDF4 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In order to overcome the disadvantages of poor overall energy consumption balance and short network life cycle of existing wireless sensor network routing methods, the present invention prov

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
  • Wireless sensor network routing method based on node redundancy and graph coloring algorithm
  • Wireless sensor network routing method based on node redundancy and graph coloring algorithm
  • Wireless sensor network routing method based on node redundancy and graph coloring algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

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

[0024] refer to Figure 1 ~ Figure 3 , a wireless sensor network routing selection method based on node redundancy and graph coloring algorithm, giving priority to redundant nodes to find the optimal path in the maximum feasible set, in the process of searching for the optimal routing, including the following steps:

[0025] The first step, first of all, look for redundant nodes in the network, and define the redundant nodes as being covered by surrounding nodes with a coverage rate of 90% or more; use the idea of ​​Monte Carlo to randomly select m in the area of ​​​​m×n area ×n points, the number of points falling in the area to be calculated is the area of ​​the required area. like figure 1 As shown, if you want to calculate the area covered by neighbor nodes B and C, you need to calculate the number of points that fall in the intersection area of ​​A and B, denote...

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 wireless sensor network routing method based on node redundancy and a graph coloring algorithm. The method comprises the following steps of S1, searching redundant nodes in a network and defining that the nodes covered by surrounding nodes with coverage rates 90% or above are the redundant nodes; through utilization of a monte carlo thought, randomly getting m*n points in a region with an area of m*n, wherein the number of the points falling into a to-be-calculated region is the area of the required region; S2, establishing a utility function as the basis for searching the maximum feasible set according to a graph theory, and through establishment of the utility function, striving to search the nodes with high residual energy, high link communication quality and short transmission distance as the nodes of a next hop; and S3, through utilization of a graph theory greedy algorithm, searching the maximum feasible set to determine a route. According to the method, the network energy balance and route effectiveness are taken into consideration, the energy consumption is integrally balanced, and the life cycle of the network is prolonged.

Description

technical field [0001] The present invention considers the connectivity of wireless sensor network nodes, channel quality and other aspects, uses the branch of topology—graph theory coloring greedy algorithm to calculate the weighted value of the path, and finds the maximum feasible transmission path of the sensor network on the basis of analyzing the network redundancy The invention belongs to the technical field of routing transmission in wireless communication technology. Background technique [0002] The application prospect of the Internet of Things is broad, and it has become a research hotspot that all walks of life pay attention to in recent years. The wireless sensor network is a multi-hop ad hoc network formed by a large number of sensor nodes deployed in various monitoring areas and communicates with each other. It is an important technical form of the underlying architecture of the Internet of Things. The research of wireless sensor network has mainly gone throu...

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/10H04W40/12H04W84/18
CPCH04W40/10H04W40/12H04W84/18Y02D30/70
Inventor 王丽李枫应颂翔卢为党沈迪
Owner ZHEJIANG UNIV OF TECH
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