Telecommunication Frame Encoding Using Hash Code Node Identification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Low-speed M2M communication networks face challenges in reducing frame size to optimize bit rate, channel occupancy, and energy consumption, as existing methods do not effectively exploit information redundancy between data frames and rely heavily on large headers and unambiguous decompression, leading to inefficient use of spectral resources.
Innovation Solution
A method that involves encrypting data frames, generating a hash code, and using a database to identify the transmitting node, allowing for truncated address transmission and adaptive transmission parameter adjustment, thereby reducing frame size and optimizing network operation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If frame size is reduced to optimize bit rate and channel occupancy, then spectral resource efficiency improves, but node identification reliability deteriorates due to truncated addresses
Solution Approach 1:
The patent introduces a hash code as an intermediary element that mediates between the truncated address (which provides only partial identification) and the need for reliable node identification. The hash code is generated from the complete address and encrypted data, serving as a verification key that enables reliable identification without transmitting the complete address, thus resolving the contradiction between frame size reduction and identification reliability
Solution Approach 2:
The patent creates a cryptographic copy (hash code) of the complete address information that can be verified without transmitting the original complete address. This copy contains sufficient information to verify node identity while occupying minimal space in the transmitted frame, allowing reliable identification with reduced frame size
2Measurement precision
If complete address is transmitted for reliable node identification, then identification accuracy improves, but frame size increases reducing network capacity
Solution Approach 1:
The patent extracts only the essential identification information (truncated address) from the complete address for transmission in the frame, while using the hash code verification mechanism to ensure accurate node identification. This extraction approach transmits minimal data (improving network capacity) while maintaining identification accuracy through cryptographic verification
Solution Approach 2:
The patent changes the parameter of address representation from complete binary address to truncated address plus hash code verification. This parameter transformation enables accurate node identification with significantly reduced transmission data, thereby increasing network capacity while maintaining identification precision
3Reliability
If unambiguous decompression is provided for each frame element, then decoding reliability improves, but frame overhead increases
Solution Approach 1:
The patent merges multiple functions into the hash code element: it serves as both an integrity verification mechanism and a node identification verification mechanism. This consolidation provides reliable decoding verification without requiring separate overhead fields for each function, thus maintaining decoding reliability while reducing overall frame overhead
Data Source
Figure 1A
Figure 1B
Figure 1C
AI summary
The invention relates to a method for receiving a data frame emitted by a node, using a database containing records about said nodes and at least one hash code contained in said frame in order to decode said frame.