Sparse node positioning algorithm

A node positioning and sparse technology, which is used in positioning, transmission monitoring, measurement devices, etc., can solve the problems that the positioning accuracy of the MAP algorithm is easily affected by the chord azimuth accuracy, the HADO algorithm has a large amount of calculation, and the moving path has a high level. To achieve the effect of convenience, improved reliability, and simple positioning

Inactive Publication Date: 2013-09-25
HARBIN ENG UNIV
View PDF3 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Among them, the RSSI-based positioning algorithm requires additional ranging equipment; the HADO algorithm has a large amount of calculation and has high requirements for the moving path of the mobile beacon; the positioning accuracy of the MAP algorithm is easily affected by the accuracy of the chord azimuth

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
  • Sparse node positioning algorithm
  • Sparse node positioning algorithm
  • Sparse node positioning algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0070] refer to Figure 5 , Figure 6 , 1000 common nodes are randomly distributed in a square area of ​​100m×100m. The communication radius of all ordinary nodes and beacon nodes in the area is 20m, and the maximum moving speed of the beacon node is 20m / s, and its moving path follows the RWP model. Among them, the algorithm divides the node sensing area into a grid of 15×15, and the signal strength P t =-40dBm, the signal-to-noise ratio is 20dB. When the number of beacon points perceived by the node is less than 8, M takes the actual number of beacon points; when it is greater than or equal to 8, take the 8 beacon points with the strongest signal strength for positioning, that is to say, M=8 . In the algorithm, the beacon node is set to broadcast a beacon signal every 1 second, broadcasting 400 times (the following simulation experiment parameters are the same as this parameter). Figure 5 and Figure 6 Respectively described in the ideal environment ( image 3 ) and i...

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 provides a sparse node positioning algorithm. According to the algorithm, through a grid sensing area, a node positioning problem is transformed into a sparse signal reconstruction problem. Then a pretreatment method of LU decomposition is employed, the preprocessing of an observation matrix is carried out, and a restricted isometry condition is effectively satisfied. Finally, aiming at a problem that a determined sparse signal is an approximate sparse signal in a sparse positioning model, a centroid algorithm is employed to improve the positioning performance of the algorithm. According to the algorithm, the compressed sensing theory is introduced, through the grid sensing area, the node positioning problem is effectively converted into an N-dimensional vector reconstruction problem with sparsity of 1, and the characteristics of a node is effectively excavated to complete the node self-positioning.

Description

technical field [0001] The invention relates to a positioning method of a static wireless sensor network node based on a mobile beacon node, specifically a sparse node positioning algorithm. Background technique [0002] Wireless sensor network is a distributed network formed rapidly through self-organization. Due to the limitation of network resources and cost, the nodes in the network cannot all rely on GPS to complete the positioning. However, the coverage, layout and target positioning of sensors in the network must depend on the location of nodes. Therefore, self-localization of nodes in wireless sensor networks is crucial. With the continuous in-depth study of sensor network node location technology, the node location method based on mobile beacons has attracted more and more attention. Typical algorithms include RSSI-based positioning algorithms, HADO algorithms, and MAP algorithms. Among them, the RSSI-based positioning algorithm requires additional ranging equip...

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): H04W64/00H04B17/00G01S5/00
Inventor 赵春晖许云龙黄辉王桐陈春雨
Owner HARBIN ENG UNIV
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