CN116708601A - Data transmission method based on intelligent ammeter and concentrator - Google Patents

Data transmission method based on intelligent ammeter and concentrator Download PDF

Info

Publication number
CN116708601A
CN116708601A CN202310747413.5A CN202310747413A CN116708601A CN 116708601 A CN116708601 A CN 116708601A CN 202310747413 A CN202310747413 A CN 202310747413A CN 116708601 A CN116708601 A CN 116708601A
Authority
CN
China
Prior art keywords
information
code
inverse
original
level
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202310747413.5A
Other languages
Chinese (zh)
Other versions
CN116708601B (en
Inventor
李磊
孙彦海
陈志瑞
李秀珍
祁莲
卢荣荣
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ningxia LGG Instrument Co Ltd
Original Assignee
Ningxia LGG Instrument Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Ningxia LGG Instrument Co Ltd filed Critical Ningxia LGG Instrument Co Ltd
Priority to CN202310747413.5A priority Critical patent/CN116708601B/en
Priority claimed from CN202310747413.5A external-priority patent/CN116708601B/en
Publication of CN116708601A publication Critical patent/CN116708601A/en
Application granted granted Critical
Publication of CN116708601B publication Critical patent/CN116708601B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
    • H04L9/0863—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving passwords or one-time passwords
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
    • Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
    • Y04S40/00—Systems for electrical power generation, transmission, distribution or end-user application management characterised by the use of communication or information technologies, or communication or information technology specific aspects supporting them
    • Y04S40/20—Information technology specific aspects, e.g. CAD, simulation, modelling, system security

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Health & Medical Sciences (AREA)
  • Computing Systems (AREA)
  • General Health & Medical Sciences (AREA)
  • Medical Informatics (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

The application discloses a data transmission method based on an intelligent ammeter and a concentrator, which comprises the following steps: step 1: the method comprises the steps that a sender converts original information to be sent into binary codes, and divides two binary code bits into a group to obtain a plurality of code groups; step 2: compressing the information of the coded group; step 3: dividing the compressed information into information groups with arbitrary lengths to obtain encrypted information; step 4: when transmitting information, a transmitter transmits low-level information of original code level duration for original code 0 and high-level information of original code level duration for original code 1; step 5: the receiving side receives the encrypted information and converts it into the original information. The application provides a data transmission method based on the intelligent ammeter and the concentrator, which can reduce the quantity of interaction information among the intelligent ammeter, the concentrator and the server.

Description

Data transmission method based on intelligent ammeter and concentrator
Technical Field
The application relates to the technical field of ammeter data transmission, in particular to a data transmission method based on a smart ammeter and a concentrator.
Background
Frequent communication is required among the intelligent ammeter, the concentrator and the server of the power supply company to complete the transmission of the power consumption data of the user. When information is transmitted among the three, the phenomenon of communication blockage is very easy to occur. The reason for this phenomenon is that the amount of information exchanged between the three is too large, and too much bandwidth and communication resources are occupied, so that the phenomenon of communication blockage frequently occurs. Aiming at the problems of information blockage among the intelligent ammeter, the concentrator and the server, the communication time is increased and the communication times are increased by increasing the power of the communication module, so that the signal smoothness among the three is ensured. However, this approach does not essentially solve the problem that the amount of information exchanged between the three is too large, occupying too much bandwidth and communication resources.
In summary, there is a lack of a data transmission method based on the smart meter and the concentrator, which can significantly reduce the bandwidth and communication resources occupied by the large amount of interaction information among the smart meter, the concentrator and the server.
Disclosure of Invention
The summary of the application is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. The summary of the application is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
In order to solve the technical problems mentioned in the background section above, some embodiments of the present application provide a data transmission method based on a smart meter and a concentrator, including the following steps:
step 1: the method comprises the steps that a sender converts original information to be sent into binary codes, and divides two binary code bits into a group to obtain a plurality of code groups;
step 2: compressing the information of the encoded group, wherein
00, compressing to 0, and marking it as original code;
11, compressing to 1, and marking it as original code;
01, when the previous bit is coded as 1, the compression is 0 and marked as an inverse code, when the previous bit is coded as 0, the compression is 1 and marked as an inverse code, and when the previous bit is coded as the first code group, the compression is 0 and marked as an inverse code;
10, when the previous bit is encoded to be 0, the compression is 1 and marked as an inverse code, when the previous bit is encoded to be 1, the compression is 0 and marked as an inverse code, and when the previous bit is encoded to be the first code group, the compression is 1 and marked as an inverse code;
step 3: dividing the compressed information into information groups with arbitrary lengths to obtain encrypted information;
step 4: when transmitting information, a transmitter transmits low-level information of original code level duration for original code 0 and high-level information of original code level duration for original code 1; for 0 of the inverse code, transmitting low level information of the inverse code level duration, and for 1 of the inverse code, transmitting high level information of the inverse code level duration;
step 5: the receiving party receives the encrypted information and determines the position corresponding to the original code in each information group according to the received high level or low level duration time when the identification bit of the encrypted information is received; then, the encrypted information is converted into the original information according to the compression rule of the original code.
The original information sent among the intelligent ammeter, the concentrator and the server is binary code; for this purpose, in this scheme, these binary codes are grouped into two-bit groups, which are then compressed and converted into the original code and the inverse code. For the original code, since no additional flag needs to be set, the information represented by the original code is compressed by half, and for the inverse code, although one-bit flag information is added, the overall information length of the inverse code is not increased. Thus, under the scheme, the most original information can be effectively compressed. Compared with the prior art, the compression mode has wider application range and aims at the information transmission format at the bottommost layer, so that the data can be compressed by adopting the scheme after being compressed to the lowest by adopting the rest compression modes, and the situation that too much bandwidth is occupied during signal transmission can be effectively avoided.
Further, in step 3, the number of each information group is 8-bit binary coding.
Each information group is the same number of binary codes so that the receiving party can know the information node sent by the sending party. It is convenient to add some marking information between the information sets. For example, if several bits of flag information are added at the end of each information group, the receiving side knows that the next several binary codes are flag information after receiving 8 binary codes.
Further, in step 2:
00, compressing to 1, and marking it as original code;
11, compressing to 0, and marking it as original code;
01, when the previous bit is coded as 1, the compression is 0 and marked as an inverse code, when the previous bit is coded as 0, the compression is 1 and marked as an inverse code, and when the previous bit is coded as the first code group, the compression is 0 and marked as an inverse code;
10, when the previous bit is encoded as 0, the compression is 1 and marked as an inverse, when the previous bit is encoded as 1, the compression is 0 and marked as an inverse, and when it is the first encoded group, the compression is 1 and marked as an inverse.
By adopting the mode to compress the original information, the situation that when the original code and the opposite code are adjacent, the original code and the opposite code cannot generate the same code, so that when the information is transmitted, a continuous high level is generated, and the adjacent original code and the adjacent opposite code cannot be distinguished, and which bit is the opposite code. For example, in code "11", the first bit is the original code and the second bit is the inverse code, and the receiving side receives a high level of one original code period and a high level of one inverse code period, which occur continuously, so that it cannot be recognized at all whether the first bit is the original code or the second bit is the original code. However, in this scheme, the situation that the original code 1 and the inverse code 1 are continuously present does not occur, and only the situation that the inverse code 1 and the original code 1 are continuously present exists. It is directly known that the first bit is the inverse code and the second bit is the original code when high levels of two different periods occur consecutively, where only one possibility exists.
Further, in step 3, the flag information of the code reversal is added to each information group, the compression rule is used for marking the code reversal in each information group, the code reversal flag of the code group of 01 is 0, the code reversal flag of the code group of 10 is 1, and the transmission is performed according to the duration of the original code level.
The compression rule of the code reversal is marked by using only 1-bit code by marking information, so that the original information of the code reversal is 2-bit binary code, the code reversal is compressed to be 1-bit binary code, and then the binary code of the 1-bit mark information is added, so that the total information amount of the code reversal is not increased, but the original code is compressed by one bit, and the effect of compressing the information can be achieved.
Further, in step 3, each information group is separately transmitted.
The information group is sent independently, so that the original information can be sent in a segmented mode.
Further, the step 4 specifically includes the following steps:
the marker information is transmitted after the information group with the original code level duration.
Further, step 5 includes the steps of:
step 51: receiving encryption information and analyzing each information group independently;
step 52: analyzing the number N of the bit positions of the inverse code in the information group, and taking the original code information of N bits behind the information group as marking information;
step 53: determining compressed information according to the original code level duration and the inverse code level duration of information in the same information group, wherein the inverse code information is replaced by x;
step 54: the compression information of each of the inverse codes x is determined using the flag information.
In the scheme, when the receiver analyzes the encrypted information, one information group can be decrypted; according to the information sending rule of the sender, the receiver can know that a plurality of binary codes exist in 8 binary codes of one information group when receiving all information of the information group, so that the information group is known that the following mark information is a plurality of bits, and then the starting position of the next information group is known; the whole analysis process can be continuously carried out, and no much useless marking information is introduced.
Further, the duration of the inverse code level is greater than the duration of the original code level, and when the continuous level exceeds the inverse code level, the calculated duration is several times the duration of the original code level, and the first bit is the inverse code and the remaining bits are the original code if there is a remainder.
Further, the compressed data of the information of the encoded group is transmitted first according to the rule, and the marking information is transmitted again according to the duration of the original code level.
To sum up: the application provides the data transmission method based on the intelligent electric meter and the concentrator, which can remarkably reduce the occupation of too much bandwidth and communication resources due to too large quantity of interaction information among the intelligent electric meter, the concentrator and the server.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application, are incorporated in and constitute a part of this specification. The drawings and their description are illustrative of the application and are not to be construed as unduly limiting the application.
In addition, the same or similar reference numerals denote the same or similar elements throughout the drawings. It should be understood that the figures are schematic and that elements and components are not necessarily drawn to scale.
In the drawings:
fig. 1 is a diagram of a data transmission method based on a smart meter and a concentrator according to the present application.
Fig. 2 is a flow chart of an information set from a sender to a receiver provided by the present application.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete. It should be understood that the drawings and embodiments of the present disclosure are for illustration purposes only and are not intended to limit the scope of the present disclosure.
It should be noted that, for convenience of description, only the portions related to the present application are shown in the drawings. Embodiments of the present disclosure and features of embodiments may be combined with each other without conflict.
The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Referring to fig. 1 and 2, the data transmission method based on the smart meter and the concentrator can adopt the scheme to perform data transmission, so that the smart meter can be used as a sender or a receiver, and the corresponding concentrator can be used as a sender or a receiver. The data transmission method based on the intelligent ammeter and the concentrator comprises the following steps:
step 1: the sender converts the original information to be sent into binary codes, and divides two binary code two-bit bits into a group to obtain a plurality of code groups.
Whether wired or wireless, the original information transmitted is binary information, with a period of high level as 1 and a period of low level as 1. So in step 1 the conversion of the original information into binary codes is described, which is simply the final original information to be transmitted, expressed in binary.
For example: the sender needs to send the electricity of 10 degrees to the receiver, and the bottom storage mode of the information in the sender is binary code, so that the original information is converted into binary code, and the storage format of the bottom binary code of the original information to be sent is actually read out.
For example, for a piece of original information, the binary code is 1011111000111111, and after being divided into the following code groups can be obtained: 10. 11, 10, 00, 11.
Step 2: step 2: compressing the information of the encoded group, wherein
00, compressing to 0, and marking it as original code;
11, compressing to 1, and marking it as original code;
01, when the previous bit is coded as 1, the compression is 0 and marked as an inverse code, when the previous bit is coded as 0, the compression is 1 and marked as an inverse code, and when the previous bit is coded as the first code group, the compression is 0 and marked as an inverse code;
10, when the previous bit is encoded as 0, the compression is 1 and marked as an inverse, when the previous bit is encoded as 1, the compression is 0 and marked as an inverse, and when it is the first encoded group, the compression is 1 and marked as an inverse.
For example: for the original information being 1011111000111111 binary coded, after grouping it, the following coded groups are obtained: 10/11/11/10/00/11/11/11. So according to the compression rule "10" in the first set is compressed to 1, which "1" is marked as an inverse code. The "11" in the second set is compressed to 1, which is marked as the original code. The "11" in the third group is compressed to 1, labeled as the original code. The fourth group of "10", compressed to 0, marked as the inverse … …, and so on, the information resulting from the final compression is: 11100111.
it is either a continuous 1 or a continuous 0 that does not occur for the inverse code. Thus, when a string of original information is compressed, and a segment is a continuous 1 or a continuous 0, the rest of the continuous 1 and the continuous 0 are necessarily original codes except the first bit. For example: some compressed information is "01111", in this information, there are 4 consecutive 1 s, and according to the compression rule, the first "1" may be the original code or the inverse code, but the latter three "1 s" may only be the original code.
So when transmitting the string of "01111", if only the high level of 4 periods is transmitted with the original code level duration, these 4 "1" s must all be the original code. If the high level is transmitted with 1 code-bar level duration and the high level is transmitted with 3 code-bar level durations, the first is the code bar and the rest are all code bars. Therefore, under the compression rule of the scheme, for continuous 1 and continuous 0, whether the codes are original codes or reverse codes can be effectively distinguished.
Step 3: dividing the compressed information into information groups with arbitrary lengths to obtain encrypted information.
In step 3, the number of each information group is 8-bit binary coding. In this scheme, the binary codes in each information group are set to 8, and in the rest of the embodiments, the rest of the binary codes may also be set to the rest of the numbers. In addition, in order to facilitate the analysis of the information groups by the receiver, the length of binary codes in each information group is the same, and the receiver is also convenient to identify the information groups.
In step 3, the information sets are further added with the sign information of the inverse code, the compression rule is used for marking the inverse code in each information set, the inverse code of the coding set of 01 is marked as 0, and the inverse code of the coding set of 10 is marked as 1.
For example, assume that a string of already compressed information is 11100111: this string of information is just 8 binary codes, so it can be used as one information set, and of these 8 binary codes, the first bit is the inverse code, which is compressed by "10"; the fourth bit is also the inverse code, which is compressed by "10".
Therefore, there are two inverses in the 8 binary codes, so that two bits of flag information need to be added at the end of this information set. Because the "inverse code of the code group of 10 is marked 1, the inverse code of the code group of 01 is marked 0", this information group plus the marking information is finally: 1110011111. the first 8 binary codes are the information to be transmitted, and the second 2 binary codes are used to mark the preceding binary codes.
Step 4: the method comprises the steps that a sender and a receiver preset an original code level duration and an inverse code level duration, when the sender sends information, low-level information of the original code level duration is sent for 0 of an original code, and high-level information of the original code level duration is sent for 1 of the original code; for 0 of the inverse code, low level information of the inverse code level duration is transmitted, and for 1 of the inverse code, high level information of the inverse code level duration is transmitted.
In step 4, the high level of the transmission original code level duration for the flag information is 1 and the low level of the transmission original code level duration for the flag information is 0.
In step 4, the original code level duration is 0.9us, and the inverse code level duration is 1us.
In step 4, the compressed data of the information group is transmitted first according to the rule, and the marking information is transmitted again according to the duration of the original code level. That is, the information of the information group and the marking information are alternately transmitted, the information of one information group is transmitted first, then the marking information corresponding to the information group is transmitted, then the information of the next information group is transmitted, then the marking information of the next information group is transmitted, and so on.
For example, in the information group "11100111" illustrated previously, the first and fourth bits are the inverse codes, and the flag information is 11, so the sender will send 1110011111 information when sending the information group, and the second two bits are the added flag information.
Wherein a "1" of the first bit transmits a high level of 1 us;
the "1" of the second bit sends a high level of 0.9 us;
the "1" of the third bit sends a high level of 0.9 us;
the "0" of the fourth bit sends a low level of 1 us;
the "0" of the fifth bit sends a low level of 0.9 us;
the "1" of the sixth bit transmits a high level of 0.9us
The "1" of the seventh bit transmits a high level of 0.9 us;
the "1" of the eighth bit transmits a high level of 0.9 us;
until now, the information of the information group has been transmitted, and then the tag information is continued to be transmitted:
the "1" transmission of the ninth bit transmits a high level of 0.9 us;
the "1" of the tenth bit transmits a low level of 0.9 us.
Therefore, in the above manner, all the information in the information group and the information for marking the inverse code in the information group can be transmitted to the receiving side.
Step 5 comprises the following steps:
step 51: the encrypted information is received and each information set is parsed separately.
Step 52: and analyzing the number N of the anti-code bits in the information group, and taking the original code information of N bits behind the information group as the marking information.
For example, in the information group "11100111" illustrated previously, the first and fourth bits are the inverse codes, and the flag information is 11, so the sender will send 1110011111 information when sending the information group, and the second two bits are the added flag information.
The receiver, upon receiving the string of information, can determine from the pulse signal, a total of several anti-codes, and which bits are anti-codes. Taking the previous three bits as an example: when the receiving side receives the first three high level signals, the receiving side receives continuous 2.8us high level information, and according to the calculation result, the receiving side can directly determine that the receiving side is formed by 1 code reversal and 2 codes, and then according to the compression rule, the receiving side can deduce that when the receiving side has the code reversal and has continuous 1 or continuous 0, only the first bit is the code reversal. Therefore, the receiving side can determine what number of bits are encoded as the inverse code after receiving the electric signal of the previous 8-bit binary code.
Accordingly, since it is known what number of bits are in the 8-bit binary code, and what number of bits are in each case, the number of bits of the flag information is naturally clear, and after the number of bits of the flag information is known, the start bit of the next information group is known.
Step 53: and determining the compressed information according to the original code level duration and the anti-code level duration by dividing the rest information of the marking information in the same information group, wherein the anti-code information is replaced by x.
In step 53, the original code "1" is decompressed to "11", the original code "0" is decompressed to "00", and the inverse code is marked with x. Therefore, the receiving side can directly decompress the original code into the original information at the time of reception.
In step 53, for low levels where a plurality of original code level durations and inverse code level durations occur in succession, the first bit is parsed into an inverse code; for high levels where multiple original code level durations and inverse code level durations occur consecutively, the first bit is resolved to the inverse code.
Since it is certain that the first bit is an inverse code when consecutive 0 s and consecutive 1 s occur, it may be directly marked in step 53.
Step 54: the compression information of each of the inverse codes x is determined using the flag information.
In step 54, when the first flag information is 1 for the flag information of one information group, the first code in the information is decompressed to 10. When the first flag information is 0, then the first code in the information is decompressed to 01. So on.
In the information group "11100111" exemplified previously, the first and fourth bits are the inverse codes, and the flag information is 11, so when the sender sends the information group, the sender will send 1110011111 information, and the second two bits are the added flag information.
The receiving party receives the following information: the high level of 2.8us is received first, then the low level of 1.9us is received, and then the high level of 4.5us is received.
Therefore, when receiving a high level of 2.8us, since 3 original codes are impossible and otherwise there should be a high level of 2.7us, it can be determined that there are a high level of 1 inversion code and a high level of 2 original codes, since the first bit must be an inversion code if there is an inversion code in consecutive 1 s, the first bit is first noted as x and the second two bits are directly decompressed as 1111, so that the receiving side will obtain the original information of x1111 when receiving a high level of 2.8 us.
When receiving the low level of 1.9us, it can be determined that the low level of the inverse code is received first and then the low level of the original code is received, so the fourth bit received by the receiving party is the inverse code, the fifth bit is 0 of the original code and then the decompression is 00, and the information received by the receiving party is x1111x00 at this time.
Upon receipt of a high level of 4.5us it can be determined that it is made up of a high level duration of 5 original codes, while each information set has only 8 binary codes, the high level duration of the next 2 original codes representing the anti-code tag information of the information set. Thus, the sixth bit is the original code 1, the seventh bit is the original code 1, and the eighth bit is the original code 1, so that the information received by the receiver at this time is: x1111x00111111, then resolving the first bit of the code reversal and the fourth bit of the code reversal based on the ninth bit and tenth bit of the flag information, the ninth bit of the flag information is 1, so the first bit of the code reversal is resolved to 10, the tenth bit of the flag information is 1, so the fourth bit of the code reversal is resolved to 10, so the information of the information group ""11100111"" which is finally resolved is: 1011111000111111.
the foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by those skilled in the art that the scope of the application in the embodiments of the present disclosure is not limited to the specific combination of the above technical features, but encompasses other technical features formed by any combination of the above technical features or their equivalents without departing from the spirit of the application. Such as the above-described features, are mutually substituted with (but not limited to) the features having similar functions disclosed in the embodiments of the present disclosure.

Claims (10)

1. The data transmission method based on the intelligent ammeter and the concentrator is characterized by comprising the following steps of:
step 1: the method comprises the steps that a sender converts original information to be sent into binary codes, and divides two binary code bits into a group to obtain a plurality of code groups;
step 2: compressing the information of the encoded group, wherein
00, compressing to 0, and marking it as original code;
11, compressing to 1, and marking it as original code;
01, when the previous bit is coded as 1, the compression is 0 and marked as an inverse code, when the previous bit is coded as 0, the compression is 1 and marked as an inverse code, and when the previous bit is coded as the first code group, the compression is 0 and marked as an inverse code;
10, when the previous bit is encoded to be 0, the compression is 1 and marked as an inverse code, when the previous bit is encoded to be 1, the compression is 0 and marked as an inverse code, and when the previous bit is encoded to be the first code group, the compression is 1 and marked as an inverse code;
step 3: dividing the compressed information into information groups with arbitrary lengths to obtain encrypted information;
step 4: the method comprises the steps that a sender and a receiver preset an original code level duration and an inverse code level duration, when the sender sends information, low-level information of the original code level duration is sent for 0 of an original code, and high-level information of the original code level duration is sent for 1 of the original code; for 0 of the inverse code, transmitting low level information of the inverse code level duration, and for 1 of the inverse code, transmitting high level information of the inverse code level duration;
step 5: the receiving party receives the encrypted information and determines the position corresponding to the original code in each information group according to the received high level or low level duration time when the identification bit of the encrypted information is received; then, the encrypted information is converted into the original information according to the compression rule of the original code.
2. The data transmission method based on the smart meter and the concentrator according to claim 1, wherein: in step 3, the number of each information group is 8-bit binary coding.
3. The data transmission method based on the smart meter and the concentrator according to claim 1, wherein: in step 2:
00, compressing to 1, and marking it as original code;
11, compressing to 0, and marking it as original code;
01, when the previous bit is coded as 1, the compression is 0 and marked as an inverse code, when the previous bit is coded as 0, the compression is 1 and marked as an inverse code, and when the previous bit is coded as the first code group, the compression is 0 and marked as an inverse code;
10, when the previous bit is encoded as 0, the compression is 1 and marked as an inverse, when the previous bit is encoded as 1, the compression is 0 and marked as an inverse, and when it is the first encoded group, the compression is 1 and marked as an inverse.
4. The data transmission method based on the smart meter and the concentrator according to claim 1, wherein: in step 3, the information sets are further added with the sign information of the inverse code, the compression rule is used for marking the inverse code in each information set, the inverse code of the coding set of 01 is marked as 0, and the inverse code of the coding set of 10 is marked as 1.
5. The data transmission method based on the smart meter and the concentrator according to claim 1, wherein: in step 3, each information group is transmitted separately.
6. The data transmission method based on the smart meter and the concentrator according to claim 1, wherein: the tag information is transmitted using the original code level duration.
7. The data transmission method based on the smart meter and the concentrator according to claim 1, wherein: step 5 comprises the following steps:
step 51: receiving encryption information and analyzing each information group independently;
step 52: analyzing the number N of the bit positions of the inverse code in the information group, and taking the original code information of N bits behind the information group as marking information;
step 53: dividing the rest information of the mark information in the same information group, and determining compressed information according to the original code level duration and the inverse code level duration, wherein the inverse code information is replaced by x;
step 54: the compression information of each of the inverse codes x is determined using the flag information.
8. The data transmission method based on the smart meter and the concentrator according to claim 1, wherein: in step 53, for low levels where a plurality of original code level durations and inverse code level durations occur in succession, the first bit is parsed into an inverse code; for high levels where multiple original code level durations and inverse code level durations occur consecutively, the first bit is resolved to the inverse code.
9. The data transmission method based on the smart meter and the concentrator according to claim 1, wherein: the duration of the inverse code level is longer than that of the original code level, when the continuous level time exceeds the inverse code level time, the calculated duration is several times of the duration of the original code level, the first bit is the inverse code if the remainder exists, and the rest bits are the original code.
10. The data transmission method based on the smart meter and the concentrator according to claim 1, wherein: the compressed data of the information group is transmitted firstly according to the rule, and the marking information is transmitted again according to the duration of the original code level.
CN202310747413.5A 2023-06-25 Data transmission method based on intelligent ammeter and concentrator Active CN116708601B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310747413.5A CN116708601B (en) 2023-06-25 Data transmission method based on intelligent ammeter and concentrator

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310747413.5A CN116708601B (en) 2023-06-25 Data transmission method based on intelligent ammeter and concentrator

Publications (2)

Publication Number Publication Date
CN116708601A true CN116708601A (en) 2023-09-05
CN116708601B CN116708601B (en) 2024-07-12

Family

ID=

Similar Documents

Publication Publication Date Title
RU2008101649A (en) FAST PAGING CHANNEL WITH A REDUCED PROBABILITY OF PAGE MESSAGE LOSS
CN101039374B (en) Image lossless compression method
CN1283938A (en) Data transmitting and receiving appts, and method of dogital mobile transceiver
CN116781420B (en) Electronic file secure transmission encryption method and system
CN101017574A (en) Huffman decoding method suitable for JPEG code stream
CN109660527B (en) Compression transmission method for printer data
WO2009158456A3 (en) Compression scheme for interval data
CN107666372B (en) Multilink cooperative transmission method and device based on rateless coding
CN116708601B (en) Data transmission method based on intelligent ammeter and concentrator
CN103209044A (en) Transmission method, device and system of messages with data to be transmitted
KR100635794B1 (en) Transmission system using a variable length encoder
CN116708601A (en) Data transmission method based on intelligent ammeter and concentrator
CN103365814B (en) A kind of serial data transmission method and system thereof
CN108259138A (en) A kind of safe transmission method repeatedly fed back using fountain codes
CN115632661B (en) Efficient compression transmission method for network security information
CN111447427B (en) Depth data transmission method and device
CN103178968A (en) Encryption method of data transmission threshold scheme based on Huffman compression
CN112328373B (en) Distributed simulation-oriented automatic discovery method for data distribution service DDS
CN106603081B (en) Universal arithmetic coding method and decoding method thereof
CN114626338A (en) Character encoding method, character decoding method, character encoding system, character decoding system, character encoding device, character decoding device, and storage medium
CN116668882A (en) Data differential transmission method based on intelligent ammeter and concentrator
CN108551366B (en) Visible light communication method based on LED and mobile phone camera
CN101764672B (en) Checking system for data communication of electromagnetic oven and application method thereof
CN113923262A (en) Data communication real-time dynamic compression method based on cache
CN201054155Y (en) A Huffman decoding device suitable for JPEG

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant