PATENT CLAIM ANALYSIS

Application Number: 15959289
Application Type: Utility
Filing Date: 2018-04
Publication Date: 2018-08
Patent Classification: ["455", "456100"]

Abstract:
A node localization method and device are disclosed. The method includes: determining a first set of radio signal measurement values that can be received by each known-location node of at least one known-location node, and determining a second set of radio signal measurement values that can be received by a to-be-localized node; determining, according to the radio signal measurement values included in the first set that respectively correspond to each known-location node and the radio signal measurement values included in the second set, a weighting coefficient corresponding to each known-location node ( 101 ); and determining location information of the to-be-localized node according to the weighting coefficient corresponding to each known-location node and location information of each known-location node ( 102 ).

Claim (Index 14):
The device according to  claim 12 , wherein the radio signal measurement value is a radio signal strength value, and the first processing module is specifically configured to:\n determine that the weighting coefficient corresponding to each known-location node meets a requirement of the following formula: { \u2211 i = 1 M \ue89e \ue89e a i = 1 g min \ue8a0 ( a 1 , a 2 , \u2026 \ue89e , a M ) = \u2211 k = 1 N \ue89e \ue89e ( P k - \u2211 i = 1 M \ue89e \ue89e a i * P ki ) 2 + \u03bb \ue8a0 ( \u2211 i = 1 M \ue89e \ue89e a i - 1 ) , wherein P k  is a radio signal strength value of a radio signal that is sent by the k th  common node and that is received by the to-be-localized node, p ki  is a radio signal strength value of the radio signal that is sent by the k th  common node and that is received by the i th  known-location node, a i  is a weighting coefficient corresponding to the i th  known-location node, N is a quantity of common nodes, M is a quantity of known-location nodes, g min (a 1 , a 2 , a 3 , . . . , a M ) represents a value when P k  most closely approximates \u2211 i = 1 M \ue89e \ue89e a i * p ki , wherein k=1, 2, . . . , N, and \u03bb is a Lagrange coefficient.

Metadata:
- Claim Count in Document: 5.0
- Percentile: 91.0
- Lexical Diversity: 2.54902
- Patent Class: 455.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['15582373', '14771638', '12671674', '14295293', '15548651']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.7031451997672213
- 35 USC 102 Novelty (BERT): 0.4928889858676077
- Combined Prediction Score: 0.68211957837726
- Mean Citation Score: 182.569414
- Max Citation Score: 201.64973
- Similarity Product: 136.37843859805704

Labels:
- Claim Label 101: 0
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 0
- Combined Label: 0
- Label 101 Adjusted: 0

Dataset: test