Mesh Network Security via Random Token Validation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current sequencing solutions in mesh networks face limitations such as limited sequence number size, difficulty in maintaining global and relational node sequences, and vulnerability to attacks due to Time To Live (TTL) modifications, leading to security breaches and network congestion.
Innovation Solution
Implementing a method that generates a random token for query packets, which is validated and used to ensure only valid responses are relayed, eliminating the need for a Time To Live field and reducing header size, thereby enhancing network security and preventing packet looping.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If sequencing solutions are implemented to prevent packet replay attacks, then network security is improved, but sequence number size is limited and global sequence maintenance becomes difficult
Solution Approach 1:
The patent changes the parameter from traditional sequence numbers to random tokens. Each query packet contains a unique random token generated by the source node, which is stored by relay nodes and validated by destination nodes. This parameter change eliminates the need for global sequence counters and complex sequence management while maintaining security against replay attacks.
Solution Approach 2:
The patent segments the security function into distributed token validation at each node rather than relying on a centralized sequence number system. Each relay node independently stores and validates tokens from query packets, eliminating the need for global sequence synchronization and reducing the complexity of maintaining sequence state across the entire network.
2Productivity
If Time To Live field is used to prevent packet looping, then network congestion is reduced, but header size increases and security vulnerabilities remain
Solution Approach 1:
The random token serves multiple functions simultaneously: it prevents replay attacks by ensuring packet uniqueness, prevents packet looping through distributed validation at relay nodes, and eliminates the need for separate Time To Live fields. This multi-functionality reduces header size while maintaining network efficiency and security.
Solution Approach 2:
The patent extracts the packet looping prevention function from the Time To Live mechanism and integrates it into the random token validation system. Relay nodes validate tokens and discard packets with invalid or previously seen tokens, eliminating the need for separate TTL fields and reducing header complexity.
3Reliability
If global sequence counters are used for packet validation, then packet replay is prevented, but all nodes must track and synchronize sequence numbers leading to maintenance difficulties
Solution Approach 1:
The patent implements self-service through distributed token validation where each node independently generates, stores, and validates tokens without requiring global synchronization. Source nodes generate unique random tokens, relay nodes store and validate them locally, and destination nodes use them for response validation. This eliminates the need for global sequence counter maintenance and synchronization.
Solution Approach 2:
Instead of having nodes track and validate incoming sequence numbers from a global counter, the patent inverts the approach by having the source node generate unique random tokens that relay nodes store and validate. This inversion shifts the validation burden from global sequence tracking to local token storage and comparison, simplifying maintenance.
4Stability of the object's composition
If relational node sequences are implemented for each node pair, then packet ordering is maintained, but memory requirements increase significantly
Solution Approach 1:
The patent changes from maintaining relational sequence numbers for each node pair to using unique random tokens in query packets. Each token is stored once by relay nodes and validated against this single stored value, eliminating the need for multiple sequence counters per node pair and significantly reducing memory requirements while maintaining packet ordering through token validation.
Data Source
AI summary
A method of a mesh network involves generating by a source node a random token to be included in a query packet having a source ID and a query for a destination node; transmitting the query packet to the destination node through a relay node; receiving at the destination node the query packet; adding, by the destination node, the random token to a response packet for the source node; and transmitting the response packet including the random token to the source node through the relay node. Also disclosed are arrangements for a source node, a relay node and a destination node, as well as a mesh network.