Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Node scheduling optimization method for random heterogeneous sensor network

A sensor node and sensor network technology, applied in the field of sensor networks, can solve problems such as uneven node deployment, low network coverage efficiency, and high node density

Active Publication Date: 2020-02-25
JIANGNAN UNIV
View PDF9 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] In order to solve the current problem of extremely uneven deployment of nodes in the region due to high node density and randomness of deployment, resulting in low network coverage efficiency, the present invention provides a node scheduling optimization method for random heterogeneous sensor networks , the method includes:

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
  • Node scheduling optimization method for random heterogeneous sensor network
  • Node scheduling optimization method for random heterogeneous sensor network
  • Node scheduling optimization method for random heterogeneous sensor network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0057] This embodiment provides a node scheduling optimization method for random heterogeneous sensor networks based on virtual nodes and Delaunary subdivision, which uses the force of the triangle equilibrium point on the node to speed up the update of the initial state of the node; defines the triangle key point to the node It enhances the local search ability of nodes and makes the deployment of nodes more accurate; uses virtual nodes to construct binary codes of key points, and processes edge nodes to avoid invalid coverage of nodes outside the boundary. The algorithm can effectively adjust the topology of network nodes, maximize the use of node coverage capabilities, and strive to achieve full coverage of the network.

[0058] Specifically, considering the heterogeneity of nodes in the sensor network, necessary simplification of the network scene model is required. In this application, without loss of generality, the following assumptions are made about network scenarios ...

Embodiment 2

[0129] This embodiment provides an application of the node scheduling optimization method for random heterogeneous sensor networks based on virtual nodes and Delaunary subdivision described in Embodiment 1 in the monitoring of cyanobacteria in Taihu Lake;

[0130] To monitor cyanobacteria, it is first necessary to spread the sensors on the water surface. After a period of water fluctuations, the positions of the sensors will change randomly. At this time, the random pair based on virtual nodes and Delaunary subdivision described in the first embodiment is used. The node scheduling optimization method SAVSH of the heterogeneous sensor network re-deploys the sensors, which can achieve the effect of optimizing the coverage of the water surface area.

[0131] In order to verify the advantages of the method proposed in this application, a simulation experiment is carried out as follows: The default configuration of the main network parameters is shown in Table 2:

[0132] Table 2 N...

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 node scheduling optimization method for a random heterogeneous sensor network, and belongs to the technical field of sensor networks. According to the method, binary codes are established for a node set through four virtual nodes which can communicate with one another and are established at corners of a target area, and border-crossing nodes are effectively identified; meanwhile, a node set and virtual nodes are combined to construct Delaunary triangulation, the convergence speed is increased in the early stage of algorithm execution by means of triangular balance points, the node deployment position is optimized in the later stage of execution through key points of the triangular balance points, and the deployment precision of the nodes is improved; meanwhile, nomatter in a network with sparsely distributed nodes or a network with high-density deployment of the nodes, the nodes can be reorganized. The number of neighbor nodes and the number of Delaunary triangles formed by taking the nodes as vertexes are far less than the number N of deployment nodes, so that the algorithm complexity is reduced while the network coverage rate is ensured.

Description

technical field [0001] The invention relates to a node scheduling optimization method for a random heterogeneous sensor network, belonging to the technical field of sensor networks. Background technique [0002] Mobile Wireless Sensor Networks (WSNs) are widely used in various modern applications due to their adaptability to network conditions and high flexibility. The node coverage efficiency in WSNs directly affects the network service quality, and a large number of sensor nodes are placed in the target monitoring area by means of scattering. Due to the high density of nodes and the randomness of deployment, the deployment of nodes in the target monitoring area is extremely uneven and the network coverage is low. [0003] The research on the coverage of mobile sensor networks makes up for the adverse effects of random deployment of nodes on the network. A reasonable node movement strategy can complete the deployment of network node locations with a short moving distance, ...

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
Patent Type & Authority Applications(China)
IPC IPC(8): H04W16/18H04W24/02H04W84/18
CPCH04W16/18H04W24/02H04W84/18
Inventor 秦宁宁金磊
Owner JIANGNAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com