CN117896778A - Power consumption data transmission method based on Beidou short message - Google Patents
Power consumption data transmission method based on Beidou short message Download PDFInfo
- Publication number
- CN117896778A CN117896778A CN202410288862.2A CN202410288862A CN117896778A CN 117896778 A CN117896778 A CN 117896778A CN 202410288862 A CN202410288862 A CN 202410288862A CN 117896778 A CN117896778 A CN 117896778A
- Authority
- CN
- China
- Prior art keywords
- sub
- packet
- packets
- consumption data
- message
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 61
- 230000005540 biological transmission Effects 0.000 title claims abstract description 36
- 238000004891 communication Methods 0.000 claims abstract description 26
- 230000008569 process Effects 0.000 claims abstract description 24
- 238000012795 verification Methods 0.000 claims abstract description 18
- 230000005611 electricity Effects 0.000 claims abstract description 12
- 230000001502 supplementing effect Effects 0.000 claims description 15
- 230000000295 complement effect Effects 0.000 claims description 8
- 238000001514 detection method Methods 0.000 claims description 7
- 238000012856 packing Methods 0.000 claims description 4
- 206010034719 Personality change Diseases 0.000 claims description 2
- 230000009286 beneficial effect Effects 0.000 abstract description 2
- 238000007906 compression Methods 0.000 description 5
- 230000006835 compression Effects 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000008521 reorganization Effects 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 230000002457 bidirectional effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013144 data compression Methods 0.000 description 1
- 230000006837 decompression Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
- H04W28/065—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information using assembly or disassembly of packets
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/1851—Systems using a satellite or space-based relay
- H04B7/18513—Transmission in a satellite or space-based system
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/04—Error control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/12—Messaging; Mailboxes; Announcements
- H04W4/14—Short messaging services, e.g. short message services [SMS] or unstructured supplementary service data [USSD]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/04—Large scale networks; Deep hierarchical networks
- H04W84/06—Airborne or Satellite Networks
-
- 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
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- General Physics & Mathematics (AREA)
- Aviation & Aerospace Engineering (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a power consumption data transmission method based on Beidou short messages, which comprises the following steps: compressing electricity data to generate a message, splitting the message with byte length exceeding single communication capacity into a plurality of sub-packets, adding a corresponding identification packet header for each sub-packet, and sending the sub-packet to a receiving end; acquiring a plurality of sub-packets sent by a sending end, and checking whether the sub-packets are lost or not in the sending process according to the identification packet heads of the sub-packets; if the verification is yes, the receiving end feeds back the supplementary packet information to the transmitting end, the transmitting end transmits the corresponding sub-packet again according to the supplementary packet information, and the operation of the verification result of yes is repeated until the verification result of no; if the checking result is no, the receiving end executes the package assembling operation. The invention has the beneficial effects that: the problem that the length of a single communication message in a civil Beidou communication link is limited and no communication receipt exists is solved, the success rate of long message communication of Beidou short messages is improved, and the transmission efficiency based on Beidou short message communication is improved.
Description
Technical Field
The invention belongs to the field of data communication, and particularly relates to a power consumption data transmission method based on Beidou short messages.
Background
Along with population growth and industry development, the demand of human society for energy is also increasing, and the smart electric meter is a digital electric energy meter, can accurately measure the electric energy consumed and can provide more additional information than traditional electric energy meter, and in addition, the smart electric meter is a key component part of smart electric network, and can realize bidirectional and real-time communication between consumers and suppliers, reduce the whole energy consumption, and the power consumption information of modern telecommunication network system is generally uploaded to a concentrator near the electric meter by 485 communication mode or power carrier line and then transmitted to a main station.
At present, the power system generally adopts communication technologies such as optical fiber communication, GPRS, power line carrier and the like, however, remote mountain areas have the problems of poor wireless network signals, higher wired network laying cost and the like, so the communication technologies cannot meet the demands, the Beidou short message communication technology is adopted as a transmission mode, has the characteristics of long transmission distance, no blind area, safety, reliability and the like, is a feasible scheme, and in addition, the transmission efficiency can be improved by adopting data segmentation transmission, compression transmission and data merging transmission, but the data transmission capacity of a single message is limited, and packet transmission is required to be carried out on message data; the method is influenced by various factors such as equipment communication grade, use environment and the like, and packet loss can be caused by low communication success rate; the low frequency of service results in low transmission efficiency.
At present, a data compression transmission method is generally adopted, if lossless compression is adopted, constraint conditions such as uniform data, repeated data and the like and different adaptation scenes are needed, and the algorithm is complex and low in efficiency; if lossy compression is used, a certain degree of data loss can result; the packet transmission method causes data loss due to packet loss caused by low communication success rate; if the multi-transmission strategy is adopted, the disadvantages of low efficiency and resource waste exist.
Disclosure of Invention
In view of the above, the present invention aims to provide a power consumption data transmission method based on Beidou short messages, so as to solve at least one of the above technical problems.
In order to achieve the above purpose, the technical scheme of the invention is realized as follows:
a power consumption data transmission method based on Beidou short messages comprises the following steps:
compressing electricity data to generate a message, splitting the message with byte length exceeding single communication capacity into a plurality of sub-packets, adding a corresponding identification packet header for each sub-packet, and sending the sub-packet to a receiving end;
acquiring a plurality of sub-packets sent by a sending end, and checking whether the sub-packets are lost or not in the sending process according to the identification packet heads of the sub-packets;
if the verification is yes, the receiving end feeds back the supplementary packet information to the transmitting end, the transmitting end transmits the corresponding sub-packet again according to the supplementary packet information, and the operation of the verification result of yes is repeated until the verification result of no;
if the checking result is no, the receiving end executes the package assembling operation.
Further, in the process of splitting the message into a plurality of sub-packets, counting the total number of sub-packets after splitting the current message, and sequentially setting sub-packet sequence numbers for the sub-packets according to the sequence in the splitting process;
and after the splitting is finished, the task number, the total number of the sub-packets and the sub-packet serial number of the message are used as the identification packet heads of the corresponding sub-packets.
Further, in the process of executing the packet grouping operation, the receiving end checks whether the number of currently received sub-packets is the same as the number of sub-packets recorded in the identification packet header;
if the two are the same, continuing to reorganize; if the two types of the packet data are different, the packet supplementing information is fed back to the sending end.
Further, in the process of executing the packet grouping operation, the receiving end sequentially sorts the plurality of sub-packets according to the sub-packet sequence numbers in the identification packet header;
verifying whether the sequence numbers of the sub-packets are consistent, whether the first bit of the sequence numbers of the sub-packets is 1, and whether the last bit of the sequence numbers of the sub-packets is the same as the total number of the sub-packets;
if the results of the three verification of the sub-packet serial numbers are all yes, performing packet grouping operation according to the sub-packet serial numbers;
if any one of the three verification results of the sub-packet sequence numbers is negative, the receiving end feeds back the supplementary packet information.
Further, the sending end sends all sub-packets to enter waiting time, and if the sending end receives the complementary packet information before the waiting time reaches a waiting threshold value, the waiting time is reset, and corresponding sub-packets are sent according to the complementary packet information;
and if the sending end does not receive the packet supplementing information or the waiting time exceeds the waiting threshold value, sending the next group of messages.
Further, the receiving end enters the receiving time when receiving the sub-packet for the first time, and after the receiving time exceeds a receiving threshold value, the receiving end detects whether the sub-packet is lost or not;
if the detection result is yes, feeding back the supplementary package information;
if the detection result is negative, performing a packing operation;
if the feedback times of the packet supplementing information exceeds the packet supplementing threshold value and the detection result is yes, relevant data of the current message are discarded, and the receiving time is reset.
Further, the process of compressing the electricity data to generate the message includes:
establishing a search buffer area to traverse electricity consumption data and recording the electricity consumption data into a history buffer area;
comparing whether the character strings which are the same as the character strings in the history buffer exist in the search buffer;
if the same character string exists, outputting the position and the length of the character string;
if the same character string does not exist, outputting the current character;
the traversal method is binary tree traversal.
Further, the search buffer zone uses a binary tree traversal method to traverse the power consumption data, and according to the character change in the search buffer zone, the offset of each node in the binary tree is updated, and the nodes with offset less than 1 are deleted and new nodes are inserted.
Further, the process of deleting the node with the offset smaller than 1 includes:
the deleted node has no child node and is directly deleted;
the deleted node only has one of left leaf node or right leaf node, the relation between the deleted node and the corresponding root node and leaf node is disconnected, and the relation between the corresponding root node and leaf node is established;
the deleted node has a left leaf node and a right leaf node at the same time, and the left-most node in the right subtree of the deleted node to which the deleted node is replaced.
Compared with the prior art, the power consumption data transmission method based on the Beidou short message has the following beneficial effects:
the long message reliability transmission scheme is designed, the 'unpacking', 'packing' and the 'packet supplementing' operation based on the waiting timeout mechanism are carried out on the long message exceeding the threshold byte, the problems that the length of a single communication message in a civil Beidou communication link is limited and no communication receipt exists are solved, and the communication success rate of the long message of the Beidou short message is improved; the compression algorithm is constructed to compress the data, the compression effect is good, and the transmission efficiency based on Beidou short message communication is improved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the invention. In the drawings:
fig. 1 is a flow chart of a power consumption data transmission method based on a Beidou short message according to an embodiment of the invention.
Detailed Description
It should be noted that, without conflict, the embodiments of the present invention and features of the embodiments may be combined with each other.
The invention will be described in detail below with reference to the drawings in connection with embodiments.
A power consumption data transmission method based on Beidou short messages comprises the following steps: the transmitting end compresses the power consumption data to generate a message, splits the message with byte length exceeding single communication capacity into a plurality of sub-packets, adds a corresponding identification packet header for each sub-packet and transmits the sub-packet to the receiving end; wherein the sum of byte lengths of each sub-packet and the corresponding identification packet header is not higher than the single communication capacity;
the receiving end acquires a plurality of sub-packets sent by the sending end, and checks whether the sub-packets are lost or not in the sending process according to the identification packet heads of the sub-packets; if the verification is yes, the receiving end feeds back the supplementary package information to the transmitting end, the transmitting end transmits the corresponding sub-package again according to the supplementary package information, and the operation of the verification result of yes is repeated until the verification result of no; if the checking result is that the receiving end is not the receiving end, the receiving end executes the packing operation.
The length of the single communication message of the beidou IC card used in the embodiment is not more than 78.5 bytes, and the information acquired in the electricity consumption information acquisition system is more than 78.5 bytes, so that the long message is unpacked into a plurality of sub-packets with the length not more than 78.5 bytes and then sent.
In the process of splitting the message into a plurality of sub-packets, marking the current message by using a unique task number, counting the total number of sub-packets after splitting the current message, sequentially setting sub-packet serial numbers for the sub-packets according to the sequence in the splitting process, and taking the task number, the total number of the sub-packets and the sub-packet serial numbers as the identification packet heads of the corresponding sub-packets after splitting is finished;
the task number (SEQ), the total number of subpackets (Num) and the sequence number (Rank) of the subpacket header occupy 1 byte; the task numbers of a plurality of sub-packets split from the same long message are the same, and a receiving end divides the sub-packets with the same task numbers into a group and reorganizes the sub-packets when the sub-packets are grouped; the total number of the sub-packets is the total number of the sub-packets with the same task number; the sub-packet sequence number is the sequence number of a plurality of sub-packets in the process of splitting the long message.
The data size of different power consumption data is different, if the data size is smaller, the data does not need to be compressed, task numbers are divided into two types according to the data size, and if the data is not compressed, the task numbers are smaller than 0x7D; otherwise, the task number is larger than 0x7D, and the receiving end judges whether decompression operation is needed to be executed according to the size of the task number.
The receiving end reorganizes the sub-packets with the same task number after recognizing whether the sub-packets are lost in the sending process and judging whether the sub-packets are lost; and in the process of reorganization, the receiving end checks whether the number of the currently received sub-packets is the same as the number of the sub-packets recorded in the identification packet header, if so, the reorganization is continued, and if not, the supplementary packet information is fed back to the sending end.
In the process of executing the packet grouping operation, the receiving end sequentially sorts the sub-packets according to the sub-packet sequence numbers in the identification packet header, and verifies whether the sub-packet sequence numbers are consistent, whether the first bit of the sub-packet sequence numbers is 1, and whether the last bit of the sub-packet sequence numbers is the same as the total number of the sub-packets; if the three verification results are all yes, the packet grouping operation is executed according to the sub-packet serial numbers, and if any one of the three verification results is no, the receiving end feeds back the supplementary packet information.
The receiving end forms a sequence queue with a plurality of received sub-packets through sub-packet sequence numbers, records the missing sub-packet sequence numbers when the sub-packet sequence numbers are not consistent (if the missing sub-packets are continuous sub-packets starting from the head and the tail, the situation that the sub-packet sequence numbers are consistent but the sub-packet number is still incomplete can occur, so that whether the head of the sub-packet is 1 needs to be detected, and meanwhile, whether the tail of the sub-packet is the same as the total number of the sub-packets or not is detected), writes the recorded missing information into the complementary packet information, sets the total number of the sub-packets in the packet header of the complementary packet information and the sub-packet sequence numbers to 0, and the task number is the same as the task number of the current sub-packet.
The sending end sends all sub-packets and then enters waiting time, the waiting time is kept until the waiting time is up to a waiting threshold value, if the sending end receives the complementary packet information, the waiting time is reset, the corresponding sub-packets are sent according to the complementary packet information, and if not, the next group of messages are sent;
the receiving end enters the receiving time when receiving the sub-packet for the first time, after the receiving time is continued to the receiving threshold value, whether the sub-packet is lost or not is detected, if the sub-packet is lost, the packet supplementing information is fed back, and if the sub-packet is not lost, the packet grouping operation is executed; if the feedback times of the packet supplementing information exceeds the packet supplementing threshold value and the detection result is yes, relevant data of the current message are discarded, and the receiving time is reset.
In order to avoid the situation that the receiving end sends the supplementary package information in an infinite loop due to the fact that the sending end does not receive the supplementary package information or the supplementary package is not successful, a supplementary package threshold value (3 times) is set for sending the supplementary package information in the embodiment, if the receiving end feeds back the supplementary package information three times and the sub package is not received completely, all data under the current task number are discarded, and the receiving threshold value is reset to zero.
Based on the situation that the packet supplementing information is lost due to the fact that the waiting threshold value is too low in the data transmission process, the waiting threshold value is set to 180 seconds (which is equivalent to three times of service frequency of the Beidou IC card), and the sending end is ensured to have enough time to wait for receiving 3 times of packet supplementing information; based on the fact that the packet Wen Changdu is smaller than 75 bytes in the data transmission process, the receiving end cannot judge whether the packet is lost or not (because if the packet is lost, the receiving end never receives the packet and further fails to obtain corresponding information), and the packet supplementing information cannot be sent, in this embodiment, the waiting threshold of the sending end after the single packet is sent is set to 60 seconds (the service frequency of the Beidou IC card is the same).
The process of generating the message by compressing the power consumption data by the transmitting end comprises the following steps: establishing a search buffer area, traversing electricity consumption data and recording the electricity consumption data into a history buffer area, comparing whether character strings which are the same as the history buffer area exist in the search buffer area, if so, outputting the position and the length of the character strings (namely binary array (addr, len), wherein addr is the initial position of the character string which is successfully matched, len is the length of the character string which is successfully matched, the minimum value of addr is 1 at the moment), otherwise, outputting the current character (namely binary array (0, C_last), wherein C_last is ASCII code of the current character, and the character after 0 is directly output as the original character in decoding);
the traversal method is binary tree traversal.
When the search buffer area traverses the power consumption data by using a binary tree traversing method, if characters in the search buffer area change, updating the offset of each node in the binary tree, deleting the nodes with the offset smaller than 1, and inserting new nodes.
Constructing characters existing in the search buffer into a binary search tree, wherein each node in the constructed binary search tree comprises an item, a pointer pointing to a left leaf node and a pointer pointing to a right leaf node; the node's entry in turn contains the node value (i.e., the original character) and the offset (i.e., the position addr of the original character in the search buffer).
The binary search tree is a linked structure that incorporates a binary search strategy, with the following properties: the node values of all nodes on the left subtree are smaller than the node value of the root node; the node values of all nodes on the right subtree are larger than the node value of the root node; the left and right subtrees are also binary search trees.
The process of deleting nodes with offsets less than 1 includes: if the deleted node has no child node, directly deleting the deleted node; if the deleted node has only one of the left and right leaf nodes, disconnecting the relation between the deleted node and the corresponding root node and leaf node, and establishing the relation between the corresponding root node and leaf node; if the deleted node has both left and right leaf nodes, the deleted node is said to be replaced by the leftmost node in the right subtree of the deleted node.
Those of ordinary skill in the art will appreciate that the elements and method steps of each example described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the elements and steps of each example have been described generally in terms of functionality in the foregoing description to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the several embodiments provided in this application, it should be understood that the disclosed methods and systems may be implemented in other ways. For example, the above-described division of units is merely a logical function division, and there may be another division manner when actually implemented, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted or not performed. The units may or may not be physically separate, and components shown as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the embodiment of the present invention.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and not for limiting the same; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the invention, and are intended to be included within the scope of the appended claims and description.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, alternatives, and improvements that fall within the spirit and scope of the invention.
Claims (9)
1. The power consumption data transmission method based on the Beidou short message is characterized by comprising the following steps of:
compressing electricity data to generate a message, splitting the message with byte length exceeding single communication capacity into a plurality of sub-packets, adding a corresponding identification packet header for each sub-packet, and sending the sub-packet to a receiving end;
acquiring a plurality of sub-packets sent by a sending end, and checking whether the sub-packets are lost or not in the sending process according to the identification packet heads of the sub-packets;
if the verification is yes, the receiving end feeds back the supplementary packet information to the transmitting end, the transmitting end transmits the corresponding sub-packet again according to the supplementary packet information, and the operation of the verification result of yes is repeated until the verification result of no;
if the checking result is no, the receiving end executes the package assembling operation.
2. The power consumption data transmission method based on the Beidou short message as claimed in claim 1, wherein the method comprises the following steps of:
counting the total number of sub-packets after splitting the current message in the process of splitting the message into a plurality of sub-packets, and sequentially setting sub-packet sequence numbers for the sub-packets according to the sequence in the splitting process;
and after the splitting is finished, the task number, the total number of the sub-packets and the sub-packet serial number of the message are used as the identification packet heads of the corresponding sub-packets.
3. The power consumption data transmission method based on the Beidou short message as claimed in claim 2, wherein the method comprises the following steps of:
in the process of executing the packet grouping operation, the receiving end checks whether the number of currently received sub-packets is the same as the number of sub-packets recorded in the identification packet header;
if the two are the same, continuing to reorganize; if the two types of the packet data are different, the packet supplementing information is fed back to the sending end.
4. The power consumption data transmission method based on the Beidou short message as claimed in claim 2, wherein the method comprises the following steps of:
in the process of executing the packet grouping operation, the receiving end sequentially sorts the plurality of sub-packets according to the sub-packet sequence numbers in the identification packet header;
verifying whether the sequence numbers of the sub-packets are consistent, whether the first bit of the sequence numbers of the sub-packets is 1, and whether the last bit of the sequence numbers of the sub-packets is the same as the total number of the sub-packets;
if the results of the three verification of the sub-packet serial numbers are all yes, performing packet grouping operation according to the sub-packet serial numbers;
if any one of the three verification results of the sub-packet sequence numbers is negative, the receiving end feeds back the supplementary packet information.
5. The power consumption data transmission method based on the Beidou short message as claimed in claim 1, wherein the method comprises the following steps of:
the sending end sends all sub-packets and then enters waiting time, if the sending end receives the complementary packet information before the waiting time reaches a waiting threshold value, the waiting time is reset, and corresponding sub-packets are sent according to the complementary packet information;
and if the sending end does not receive the packet supplementing information or the waiting time exceeds the waiting threshold value, sending the next group of messages.
6. The power consumption data transmission method based on the Beidou short message as claimed in claim 1, wherein the method comprises the following steps of:
the receiving terminal enters receiving time when receiving the sub-packet for the first time, and after the receiving time exceeds a receiving threshold value, the receiving terminal detects whether the sub-packet is lost or not;
if the detection result is yes, feeding back the supplementary package information;
if the detection result is negative, performing a packing operation;
if the feedback times of the packet supplementing information exceeds the packet supplementing threshold value and the detection result is yes, relevant data of the current message are discarded, and the receiving time is reset.
7. The power consumption data transmission method based on the Beidou short message as claimed in claim 1, wherein the method comprises the following steps of:
the process for generating the message by compressing the electricity consumption data comprises the following steps:
establishing a search buffer area to traverse electricity consumption data and recording the electricity consumption data into a history buffer area;
comparing whether the character strings which are the same as the character strings in the history buffer exist in the search buffer;
if the same character string exists, outputting the position and the length of the character string;
if the same character string does not exist, outputting the current character;
the traversal method is binary tree traversal.
8. The power consumption data transmission method based on the Beidou short message as claimed in claim 7, wherein the power consumption data transmission method is characterized by comprising the following steps of:
the search buffer area uses a binary tree traversal method to traverse the power consumption data, and according to the character change in the search buffer area, the offset of each node in the binary tree is updated, and the nodes with offset less than 1 are deleted and new nodes are inserted.
9. The power consumption data transmission method based on the Beidou short message as claimed in claim 7, wherein the power consumption data transmission method is characterized by comprising the following steps of:
the process of deleting nodes with offsets less than 1 includes:
the deleted node has no child node and is directly deleted;
the deleted node only has one of left leaf node or right leaf node, the relation between the deleted node and the corresponding root node and leaf node is disconnected, and the relation between the corresponding root node and leaf node is established;
the deleted node has a left leaf node and a right leaf node at the same time, and the left-most node in the right subtree of the deleted node to which the deleted node is replaced.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410288862.2A CN117896778A (en) | 2024-03-14 | 2024-03-14 | Power consumption data transmission method based on Beidou short message |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410288862.2A CN117896778A (en) | 2024-03-14 | 2024-03-14 | Power consumption data transmission method based on Beidou short message |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117896778A true CN117896778A (en) | 2024-04-16 |
Family
ID=90649125
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410288862.2A Pending CN117896778A (en) | 2024-03-14 | 2024-03-14 | Power consumption data transmission method based on Beidou short message |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117896778A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103326730A (en) * | 2013-06-06 | 2013-09-25 | 清华大学 | Data parallelism compression method |
| CN105323797A (en) * | 2014-07-14 | 2016-02-10 | 易讯科技股份有限公司 | Beidou channel based electronic whiteboard remote interaction method |
| WO2019137558A1 (en) * | 2018-01-15 | 2019-07-18 | 海信集团有限公司 | Nb-iot-based data transmission and receiving method and apparatus, and data transmission system |
-
2024
- 2024-03-14 CN CN202410288862.2A patent/CN117896778A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103326730A (en) * | 2013-06-06 | 2013-09-25 | 清华大学 | Data parallelism compression method |
| CN105323797A (en) * | 2014-07-14 | 2016-02-10 | 易讯科技股份有限公司 | Beidou channel based electronic whiteboard remote interaction method |
| WO2019137558A1 (en) * | 2018-01-15 | 2019-07-18 | 海信集团有限公司 | Nb-iot-based data transmission and receiving method and apparatus, and data transmission system |
Non-Patent Citations (2)
| Title |
|---|
| 王涛;周宜;王立福;詹禹曦;夏娜;: "基于北斗通信SRP机制的电力计费信息远程传输系统的设计与实现", 合肥工业大学学报(自然科学版), no. 12, 28 December 2017 (2017-12-28) * |
| 陈玉卿: "基于北斗短报文通信的用电信息采集系统研究", 《中国优秀硕士学位论文全文数据库》, 16 December 2019 (2019-12-16), pages 1 - 5 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109818930B (en) | Communication text data transmission method based on TCP protocol | |
| CN102694855B (en) | Meteorological disaster early warning information publishing system and method on basis of Beidou satellite | |
| CN111092686A (en) | Data transmission method, device, terminal equipment and storage medium | |
| CN106709069A (en) | High-reliability big data logging collection and transmission method | |
| WO2023185969A1 (en) | Real-time data compression and transmission method | |
| CN112330456A (en) | Ultra-low-delay hardware accelerated market data stream analysis system | |
| CN101523787A (en) | Method and apparatus for applying forward error correction in 66B systems | |
| CN110300120A (en) | The hierarchical synchronization method and system of reverse data under the conditions of a kind of physical isolation | |
| CN104410478A (en) | Coding apparatus, coding method, data communication apparatus, and data communication method | |
| CN106713415B (en) | A kind of data transmission method and system | |
| CN104917591A (en) | Satellite network data package compression method suitable for uni-directional lossy link | |
| US8165162B2 (en) | Method and system for optimizing fragment size for aggregation at the physical layer | |
| CN108040041B (en) | Image difference transmission protocol design system and method based on service drive | |
| CN110113100B (en) | Visible light communication device and method for Ethernet data transmission | |
| CN115134138A (en) | File synchronization method based on one-way optical gate | |
| CN117896778A (en) | Power consumption data transmission method based on Beidou short message | |
| CN106982165A (en) | Data compression method and its system | |
| CN111355801B (en) | Remote artificial intelligence communication service handling system and control method thereof | |
| CN116723250A (en) | Compression method of DL/T645 frame and data transmission system | |
| CN111327970B (en) | Passive optical network management channel, establishment method and system, sending end and receiving end | |
| CN107046472A (en) | Asynchronous data transmission system and its data processing method based on broadcast channel | |
| CN100444595C (en) | A method of master-slave equipment communication | |
| CN108632383A (en) | A kind of method of serial ports transmitting file | |
| CN112017049B (en) | Security quotation forwarding system and method | |
| CN115002035A (en) | Power data transmission congestion evasion method based on service level |
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 |