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 1):
A method for scheduling a reclustering operation in a network including a plurality of nodes, the method comprising:\n determining if a first one of the plurality of nodes is a cluster head, the determination being made by the first one of the plurality of nodes in the network; upon determining that the first one of the plurality of nodes is a cluster head, determining, via the first one of the plurality of nodes, if one or more conditions for reclustering are met; having the first one of the plurality of nodes to continue functioning as a cluster head as long as the one or more conditions for reclustering are not met; and upon determining that the one or more conditions for reclustering are met, notifying, via the first one of the plurality of nodes, one or more other nodes of the plurality of nodes that the reclustering operation should be performed at an upcoming determined reclustering time; wherein the one or more conditions for reclustering are determined as met if a cluster scheduling message has been received from a second one of the plurality of nodes or at least one of the one or more conditions are met for the first one of the plurality of nodes.

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

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5225091305153603
- 35 USC 102 Novelty (BERT): 0.4902533175293148
- Combined Prediction Score: 0.5192835492167558
- Mean Citation Score: 170.256958
- Max Citation Score: 188.75525
- Similarity Product: 121.71939969985186

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