PATENT CLAIM ANALYSIS

Application Number: 15994643
Application Type: Utility
Filing Date: 2018-05
Publication Date: 2019-03
Patent Classification: ["370", "311000"]

Abstract:
An improved method of dynamically scheduling clustering operations in a network includes determining if one or more conditions for reclustering are met before deciding to perform the next reclustering operation. Therefore, to achieve load balancing for a network, the method of dynamically scheduling clustering operations schedules reclustering operations only at required times. This may be based on various factors such as remaining node energy, node movements, the number of nodes in the clusters, and/or other conditions of the nodes in the network. Therefore, by, tuning the reclustering time dynamically, the method effectively controls the clustering overhead throughout the network lifetime and handles the mobility of nodes.

Claim (Index 15):
The method of  claim 1 , wherein the determination of whether the one or more conditions are met is made by at least one of a central authority or one or more nodes of the plurality of nodes in the network.

Metadata:
- Claim Count in Document: 21.0
- Percentile: 93.0
- Lexical Diversity: 1.71014
- Patent Class: 370.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['15994515', '12621045', '15716100', '09727926', '12425914']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.553560332997973
- 35 USC 102 Novelty (BERT): 0.486597831957725
- Combined Prediction Score: 0.5468640828939483
- Mean Citation Score: 170.256958
- Max Citation Score: 188.75525
- Similarity Product: 129.61925143159922

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

Dataset: test