A multi-node cooperative sensor network missing value reconstruction method
A sensor network, missing value technology, applied in network topology, network traffic/resource management, wireless communication, etc., can solve the problems of indistinguishable correlation, increased missing value error, no data support, etc., to achieve strong robustness, The effect of reducing errors and restoring high accuracy
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0018] Embodiment one, see figure 1 As shown, a multi-node cooperative sensor network missing value reconstruction method includes the following steps:
[0019] Step 1. According to the historical data sequence of the target node O, use the interpolation formula to obtain the restored value x′(O n+1 ), and correct the restored value x′ of the target node O according to the data sequence of the neighbor node A (O n+1 ), get the missing value x″(O n+1 ), calculate the missing value x″(O n+1 ) uncertainty u, belief b, and relative atomicity a, and get neighbor node A’s opinion on the missing value of target node O: the assertion of the missing value of target node O is x″(O n+1 ), the opinion is {b, u, a};
[0020] Step 2. According to the spatial correlation, integrate the current data of multiple neighbor nodes of the target node O to restore the missing value. If the neighbor nodes have the same assertion about the missing value of the target node O, then fuse the same ass...
Embodiment 2
[0022] Embodiment two, see figure 1 As shown, a multi-node cooperative sensor network missing value reconstruction method includes the following steps:
[0023] Step 1. According to the historical data sequence of the target node O, use the interpolation formula to obtain the restored value x′(O n+1 ), the restored value of the missing value of the target node O According to the historical data sequence of neighbor node A x(A 1 ),x(A 2 ),...,x(A n )reduction and with the real x(A n+1 ) for comparison, according to x′(A n+1 ) and x(A n+1 ) to modify x′(O n+1 ), get the missing value x″(O n+1 )=x'(O n+1 )+x′(A n+1 )-x(A n+1 ); Obtain the nth round data x(O n ') and x(A n ′), and respectively with the real value x(A n ) and x(O n ) to get c and d, the uncertainty u is And obtain belief b according to the formula: b=1-u; calculate neighbor node A data sequence x(A 1 ),x(A 2 ),...,x(A n ) and target node O data sequence x(O 1 ), x(O 2 ),...,x(O n ) to get ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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