A dv-hop node localization method based on weighted iteration and double selection

A node positioning and dv-hop technology, applied in the direction of advanced technology, climate sustainability, sustainable communication technology, etc., can solve the problem of low positioning accuracy, achieve the effect of reducing potential errors, reducing errors, and reducing energy consumption

Active Publication Date: 2022-06-03
HENAN UNIVERSITY OF TECHNOLOGY
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] Aiming at the low positioning accuracy of existing DV-Hop positioning methods and the technical problems that potential errors cannot be eliminated when using the least square method to solve unknown node coordinates, the present invention proposes a DV-Hop node positioning method based on weighted iteration and double selection, using The weighted iteration method is used to obtain the optimal average hop distance of the anchor node, and the coordinates of the unknown node are obtained by using the double selection strategy, which reduces the error of the average hop distance of the anchor node and the distance error between nodes, and further improves the accuracy of the coordinates of the unknown node , which improves the positioning accuracy

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
  • A dv-hop node localization method based on weighted iteration and double selection
  • A dv-hop node localization method based on weighted iteration and double selection
  • A dv-hop node localization method based on weighted iteration and double selection

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0064] Below in conjunction with the accompanying drawings in the embodiments of the present invention, the technical solutions in the embodiments of the present invention will be clearly and completely

[0072]

[0076]

[0080]

[0083]

[0085] The square of the reciprocal of the error value of each hop between anchor nodes is used as a weight, which can reflect the pair of anchor nodes.

[0087]

[0091]

[0103] S1: Using the distance from different anchor nodes to the unknown node, give priority to the anchor closest to the unknown node

[0104] Since the anchor node is farther away from the unknown node, the corresponding minimum hop value is larger, then the unknown node reaches the anchor node.

[0105] S2: In order to eliminate the inherent error of the least squares method, the anchor node set ANSET

[0109] S31: Obtain the estimated distance from the unknown node to each anchor node:

[0111]

[0114]

[0115] The above equations can be expressed in the matrix form of GX...

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 present invention proposes a DV-Hop node positioning method based on weighted iteration and double selection, the steps are: first, use the weighted method to iteratively calculate the average hop distance of the anchor node, and compare the average hop distance error obtained each time, The average hop distance when the error is the smallest is used as the optimal average hop distance of the anchor node; then, the calculation steps in the standard DV-Hop are reduced, and the optimal average hop distance of the anchor node is used to obtain the estimation between the unknown node and the anchor node distance; finally, the anchor nodes are grouped according to how far they are from the unknown nodes, and the potential errors of the least squares method are eliminated by transforming the reference nodes. Calculate the optimal unknown node coordinates of each anchor node group, and then select the coordinate with the smallest error as the final coordinate of the unknown node. The invention can improve the accuracy of the average hop distance of the anchor node and the distance from the unknown node to the anchor node, and has better node positioning accuracy and positioning stability.

Description

A DV‑Hop Node Localization Method Based on Weighted Iteration and Double Selection technical field The present invention relates to the technical field of node location in wireless sensor network, especially relate to a kind of based on weighted iteration and the double-selected DV‑Hop node localization method. Background technique As a new information acquisition and processing technology, wireless sensor networks (WSNs) have been widely used. In many fields, such as: military reconnaissance, medical and health, urban transportation, precision agriculture and forest fire monitoring and so on. for Most of the applications of wireless sensor networks need to know the specific location of the event in order to make corresponding processing. therefore, It is very important to obtain the precise location information of sensor nodes. [0003] The research directions of node positioning technology can be mainly divided into two categories: positioning methods based on ra...

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 Patents(China)
IPC IPC(8): H04W64/00
CPCH04W64/00H04W64/006Y02D30/70
Inventor 陈天飞侯帅鑫孙丽君牛海旭赵志鹏赵攀
Owner HENAN UNIVERSITY OF TECHNOLOGY
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