PATENT CLAIM ANALYSIS

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

Abstract:
An improved method of clustering wireless sensor networks includes selecting cluster heads in the network based on a score calculated for each node. The score is calculated based on one or more predetermined criteria of each node and determines which node is selected as a cluster head among one or more nodes in the vicinity of each other. As a result, the score of each cluster head node at the time of its selection is higher than or the same as its cluster node members. Moreover, the cluster heads may be selected such that they are not located in close proximity to each other and are fairly distributed in the environment. The duration of this decentralized clustering process is finite and predetermined and does not depend on the number of nodes and the size of the network.

Claim (Index 17):
A node in a wireless network having at least a first node and a second node, the node comprising:\n a processing unit; and a memory readable by the processing unit and comprising instructions stored thereon to cause the processing unit to:\n calculate a waiting time for the first node; \n set a cluster head field for the first node to empty; \n determine if a message is received over the wireless network and at the first node during at least one of a clustering period or the waiting time of the first node; \n upon receiving the message over the wireless network and at the first node, determine if the message is a cluster head message from the second node; \n upon receiving a cluster head message from the second node of the wireless network, store in the memory information contained in the cluster head message from the second node into the cluster head field; \n determining if the cluster head field is empty after the end of the waiting time of the first node; \n upon determining that the cluster head field is empty after the end of the waiting time of the first node, send a cluster head message to the second node and set the first node as a cluster head; and \n upon determining that the cluster head field of the first node is not empty at an end of a clustering period, set the first node as a regular member of a cluster in the wireless network.

Metadata:
- Claim Count in Document: 50.0
- Percentile: 93.0
- Lexical Diversity: 1.89474
- Patent Class: 370.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15994643', '11412825', '13873101', '14170408', '13855825']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.531620089439812
- 35 USC 102 Novelty (BERT): 0.4898669003284443
- Combined Prediction Score: 0.5274447705286752
- Mean Citation Score: 187.914684
- Max Citation Score: 212.04343
- Similarity Product: 146.1433366069704

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

Dataset: test