IP Library Granted Patent US 12,284,297
Granted Patent B2
US 12,284,297 · App. 18/078,553 · Granted Apr 22, 2025

Method and system for blockchain-driven communication using encapsulated virtual chains

Inventor: Zisis Tsiatsikas (Salonika, GR)
Assignee: ATOS PUBLIC SAFETY, LLC.
H04L9/50H04L9/3221H04W4/90H04L2209/463
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,284,297
App. No.
18/078,553
Granted
Apr 22, 2025
Kind
B2
Abstract

A method and system for blockchain-driven communication using encapsulated virtual chains can facilitate blockchain-driven inter-PSAP communication using encapsulated virtual chains. Embodiments can be generalized for any context (e.g. not only for the specific examples of the Next Generation 9-1-1 and 1-1-2 (NG9-1-1/NG1-1-2) architectures).

Claims (43)

1. A method for blockchain-driven communication using encapsulated virtual chains, comprising:

determining, by a consensus scheme, a node as a leader node which is able to create a new block within a specific predetermined time period t, the leader node comprising a computer device having a processor connected to a non-transitory computer readable medium;

performing, by the leader node, a search in the blockchain to find a transaction of a block with context to an incident also present at the leader node, wherein context comprises a piece of information referring to an incident;

retrieving, by the leader node, the transaction found in the search;

performing, by the leader node, an analysis of the retrieved transaction to identify possible predict capacity needs for future tasks related to this context and distribution of the future tasks among neighbor nodes; and

checking, by the leader node, whether new local context is present at the leader node, and, in case no new local context is found, ending the block creation process of the leader node and repeating execution of the method by determining another node as a leader node.

2. The method according to claim 1 , wherein when the new local context is found during the checking, the method also comprises:

correlating, by the leader node, the new local context with that context analyzed in the performing of the analysis of the retrieved transaction;

creating, by the leader node, a new block comprising the new local context together with the correlations of existing blocks identified in the performing of the analysis of the retrieved transaction;

sending, by the leader node, the created new block to the other nodes of the blockchain for validation;

checking, by each of the other nodes of the blockchain, whether the created block comprises context to an incident to that which is handled by one of the other nodes of the blockchain;

validating, by the other nodes, the created new block and adding the created new block to the blockchain, in case there is no context to an incident also present among the other nodes of the blockchain; and

sending, by the leader node, a notification about the validation result to the other nodes.

3. The method of claim 2 , wherein there is context to an incident also present among at least one of the other nodes of the blockchain, and the method also comprises:

sending, by the at least one other node of the blockchain which exhibits context to an incident also present among at least one of the other nodes of the blockchain, a negative validation result to the leader node in case this correlation was not added to the created new block; and

receiving, by the leader node, the negative validation result and reshaping, by the leader node, the created new block to comprise also the correlation between the blocks, then sending, by the leader node, the reshaped created new block to the other nodes of the blockchain for validation.

4. The method of claim 3 , wherein context to an incident also present among at least one of the other nodes of the blockchain is found and the correlation has been added in the reshaped created new block, the method further comprising:

comparing, by the leader node, the states of the context;

alerting, by the leader node, nodes with context to an incident also present among at least one of the other nodes of the blockchain, for similarity-in context;

initializing, by the leader node, a communication between the nodes with context to an incident also present among at least one of the other nodes of the blockchain;

exchanging, by the nodes with context to an incident also present among at least one of the other nodes of the blockchain, information regarding context handling;

validating, by the other nodes, the created block and adding the created block to the blockchain, if the validation result is positive; and

sending, by the leader node, a notification about the validation result to the other nodes.

5. The method of claim 3 , further comprises;

marking, by the leader node or any other node or validator, the similar context automatically as related, in case the communication is not possible between the nodes with context to an incident also present among at least one of the other nodes of the blockchain.

6. The method of claim 1 , wherein the node and the leader node of the blockchain is one or more of a Public Safety Answering Point (PSAP) element, a computer, a server, or an element of an entity of critical infrastructure.

7. The method of claim 1 , wherein the analysis of the retrieved transactions to identify possible predict capacity needs for future tasks related to this context and distribution of the future tasks among neighbor nodes identifies one or more of the neighbor nodes receiving multiple transactions that exceed or meet a pre-defined threshold, the method further comprising:

performing, by the leader node, a resource check with respect to the capacity, and preparing the resources needed on a primary PSAP, a secondary PSAP, and/or on a first responders' end.

8. The method of claim 1 , wherein the blockchain is a Public blockchain, a Private blockchain, a Consortium blockchain or a hybrid blockchain.

9. The method of claim 1 , wherein the predetermined time period t is 30 seconds, 22 seconds or 15 seconds.

10. A system for blockchain-driven communication using encapsulated virtual chains, comprising:

a leader node communicatively connectable to at least one other node, the leader node comprising a computer device having a processor connected to a non-transitory computer readable medium;

the leader node configured to:

create a new block of a blockchain within a specific predetermined time period t,

perform a search in the blockchain to find a transaction of a block with context to an incident also present at the leader node, wherein context comprises a piece of information referring to an incident;

retrieve the transaction found in the search;

perform an analysis of the retrieved transaction to identify possible predict capacity needs for future tasks related to this context and/or distribution of the future tasks among neighbor nodes to which the leader node is connectable; and

check whether new local context is present at the leader node, and, in case no new local context is found, ending the block creation process of the leader node to initiate selection of a new leader node.

11. The system according to claim 10 , wherein the at least one other node comprises: one or more nodes connected to each other within a blockchain system having a blockchain that includes one or more transactions, one or more blocks capable of keeping a set of transactions which is distributed to all nodes in the network, a chain of blocks in a specific order, and/or one or more virtual chain which are chained by their context and are encapsulated in the chain,

the at least one other nodes including one or more validator nodes.

12. The system of claim 11 , the at least one other node comprising one or more nodes configured to implement at least one pre-defined consensus algorithm.

13. The system according to claim 12 , wherein the at least one pre-defined consensus algorithm is one or more of proof of authority (PoAuth), proof of stake (POS), delegated proof of stake (DPOS), leased proof of stake (LPoS), proof of elapsed time (PoET), practical Byzantine fault tolerance (PBFT), simplified Byzantine fault tolerance (SBFT), delegated Byzantine fault tolerance (DBFT), directed acyclic graphs (DAG), proof of activity (PoA), proof of importance (PoI), proof of capacity (PoC), proof of burn (PoB), multi-signature and/or proof of weight (PoWeight).

14. The system according to claim 10 , wherein the system comprises a Master Node.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 27, 2023
From: UNIFY PATENTE GMBH & CO KG; UNIFY GMBH & CO KG
To: ATOS PUBLIC SAFETY LLC
Reel/Frame 065048/0934 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 8, 2023
From: TSIATSIKAS, ZISIS
To: UNIFY PATENTE GMBH & CO. KG
Reel/Frame 062916/0871 →
Priority Claims (1)
EP 22 151 386 · Jan 13, 2022 · regional
Continuity (1)
Related Publication 20230224175A1 · Jul 13, 2023
References Cited (6)
US 20200134760A1 · Messerges et al. · 2020 [cited by applicant]
US 20200296111A1 · Karame · 2020 [cited by examiner]
US 20210044420A1 · Lee · 2021 [cited by examiner]
GB 2577751A · 2020 [cited by applicant]
Extended European Search Report for European Application No. 22151386.4 dated Jun. 24, 2022. [cited by applicant]
“Practical Byzantine Fault Tolerance and Proactive Recovery” by Miguel Castro and Barbara Liskov, ACM Transactions on Computer Systems, vol. 20, No. 4, Nov. 2002, pp. 398-461. [cited by applicant]