Data merging transmission method with receiving judgment capability and system thereof

A data combining and transmission method with receiving and determining capability and its system technical field

[0001] The present invention relates to the technical field of communications, and in particular, to a method and system for combining and transmitting data with the ability to receive and determine.

Background technique

For the machine type communication (Machine-Type Communication, MTC) technology of the existing Long Term Evolution (Long Term Evolution, LTE) system, the downlink data link transmission division multiplexing, OFDM) is the main modulation method, and the minimum downlink data transmission unit is defined as resource block (Resource block, RB).

Further, each RB is composed of a fixed number of subcarriers (subcarriers) and time slots (time slot), and each RB can be adapted to different modulation and coding according to the communication device/communication terminal conditions As well as transmit power usage, therefore, there is a considerable degree of convenience.

However, the size of the data that each RB can carry is fixed (about 4~16KB). Accordingly, when the downlink data transmission type is a large amount of small data (massive small data) transmission, due to the amount of data of a single data Most of them are smaller than the fixed capacity of data that can be carried by a single RB. Therefore, when a single RB is used to carry and transmit a single data, it will cause a padding of resources in a single RB. As a result, when the downlink data is a large amount of data will result in poor resource utilization efficiency.

[0005] Furthermore, when the sender wants to transmit a large amount of different data to a large number of different receivers, the transmission sequence of the plurality of data will be scheduled first, therefore, the data transmission time will be longer due to the later scheduled data Later, when there are a large number of receivers in the network, in addition to the aforementioned problem of poor resource utilization efficiency, the excessive data transmission will also cause the problem of excessive data transmission delay for the later scheduled data.

[0006] Therefore, how to improve the communication system to simultaneously significantly improve the utilization efficiency of spectrum resources and the transmission delay of a large amount of data, and reduce the load of the communication system, is a common goal of the industry.

SUMMARY OF THE INVENTION

[0007] The object of the present invention is to provide a method and system for combining data transmission with the ability to receive and determine.

The technical scheme adopted in the present invention is:

A kind of data merging transmission system with receiving judgment capability, for a large amount of small data (massive small data) transmission communication occasion, system comprises sending end and plural receiving ends, and each receiving end has the private decoding key that sending end provides , and each private decoding key is unique; the sender receives the complex data corresponding to the complex receiver from the back-end network server, and calculates the combined data block corresponding to the complex data according to the complex data and the complex private decoding key of the complex receiver. ; The sender transmits the combined data block to the complex receiver; the target receiver uses the private decoding key to extract the corresponding data from the combined data block, and the non-target receiver cannot extract the corresponding data from the combined data block using the private decoding key When the data is reached, the merged data block is discarded.

[0010] Further, the sending end has a buffer area, and the buffer area is used to store the data to be transmitted to a plurality of different receiving ends that the sending end receives from the back-end network server.

Further, sending end utilizes Chinese remainder theorem based on the respective private decoding keys of data and receiving end

A combined data block is obtained by separately encrypting and calculating the data to be sent to multiple different receiving ends.

Further, each receiving end utilizes Chinese remainder theorem to carry out decoding and checking calculation with respective private decoding key and merged data block; Target receiving end decoding checking then obtains corresponding original data by passing through, and non-target receiving end decoding and checking If the verification fails, the received combined data will be discarded.

[0013] A data merging and transmission method with the ability to receive and determine, the communication system adopted comprises a transmitting end and a complex number of receiving ends. Each receiving end has a private decoding key provided by the transmitting end, and each private decoding key is unique. The plurality of receivers include a first receiver with a first private decoding key; the method includes the following steps:

Step 1, the data to be transmitted to a plurality of different receiving ends that the transmitting end receives from the back-end network server and are stored in the buffer zone;

Step 2, utilizes Chinese remainder theorem sending end to encrypt the data to be sent to a plurality of different receiving ends to obtain a merged data block according to the private decoding key corresponding to data and receiving end respectively;

Step 3, transmitting terminal transmits merged data block to all receiving terminals;

Step 4, utilizes each receiving end of Chinese remainder theorem to carry out decoding and checking calculation with respective private decoding key and merged data block; Target receiving end decoding checking then obtains corresponding original data by passing through, and non-target receiving end decoding and checking If the verification fails, the received combined data will be discarded.

Further, the concrete steps of step 2 are as follows:

Step 2-1, the original data of the different receiving ends to be sent is expanded into respective extension data by the sending end respectively via the corresponding inspection mask; 0 position, and add 0 to the position of the check mask bit-1 of the specified number of digits;

[0020] Step 2-2, the sending end utilizes the Chinese remainder theorem to obtain the combined data block S by encrypting and calculating the extended data with the corresponding private decoding key.

Further, in step 2-1, specify that in the inspection mask, at least two bits at the end are the bit-1 positions of checking.

Further, the concrete steps of step 4 are as follows:

Step 4-1, utilizes Chinese remainder theorem with the respective private decoding key of each receiving end to be divisor, merge data block for dividend to calculate and obtain corresponding remainder,

Step 4-2, check whether the last two bits mark bit-1 in the corresponding mask of remainder are all 0; Yes, be judged as target receiving end, remove this extension bit to recover and obtain target receiving end each required to receive The original data; otherwise, it is determined as a non-target receiver and the combined data is discarded.

The present invention adopts above technical scheme, is different from the technical means that a data is divided into a plurality of groups based on the purpose of encryption in the prior art and is respectively encrypted with different keys and then merged into a data and sent to a recipient; this Based on the purpose of efficient transmission, the invention combines multiple data sent to different receiving ends into a large data block with different keys, and sends the combined large data block to multiple recipients at one time, and multiple recipients use the same. Its own key interprets the merged data block, so that the target receiver can obtain the data given to itself, while the non-target receiver cannot obtain the corresponding data and directly discard the merged data block. When the present invention has a large number of receiving ends in the network, the resource utilization efficiency is effectively improved when a large amount of data is transmitted, and the problem of excessive delay in data transmission is avoided.

Description of drawings

Below in conjunction with accompanying drawing and specific embodiment, the present invention is described in further detail;

[0027] FIG. 1 is a schematic structural diagram of a data merging and transmission system with a receiving and judging capability of the present invention.

Detailed ways

[0028] In order to make the purposes, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application.

[0029] As shown in FIG. 1 , the present invention discloses a data combined transmission system with receiving and determining capability. A schematic diagram of a communication system 1 according to the first embodiment of the present invention. The communication system 1 includes a transmitter and a plurality of receivers. Wherein, there is a data transmission connection between the sending end and a back-end network server. In addition, after the receivers A~E complete the registration with the sender, the sender first converts the private decoding key K_A~K_Eand the corresponding check mask F_A~F_EThey are respectively provided to the receivers A to E for the purpose of decoding and data validity determination when receiving data subsequently. Among them, the private decoding key K_A~K_Eare globally unique to each other. Assuming that the binary bit length of the private decoding key is 9, and the system default check bit length is 2, the check mask can be generated by the sender randomly selecting 2 bits of bit-1 within 9-1=8 bits of bit-0. It is 00000011, where the position of bit-0 represents the valid data bit, and the position of bit-1 represents the data validity check bit. The interaction between components is further elaborated below.

First, the processing unit of the sending end receives data M from the back-end network server through the transceiver unit_a~M_C, the data M_aContains complex data corresponding to receiver A, data M_bContains complex data corresponding to receiver B, data M_CContains complex data corresponding to receiver C. Next, the processing unit of the sending end according to the data M_A~M_Cand the private decoding key K of the receivers A~C_A~K_Cand the corresponding check mask F_A~F_C, calculate the merged data block S corresponding to the data M1~M3. In other words, the combined data block S only needs to transmit the data to the receivers A, B and C, but does not have the data to be transmitted to the receivers D and E.

Merge code calculation program mainly utilizes Chinese remainder theorem (Chinese Remainder Theorem) to complete. The private decoding key K of the communication system_A~K_Eis a unique prime number. Assume 257, 263, 269, 271, and 277 (9-bit decoding keys), respectively. Check code F_A~F_CAssuming two bits, for the convenience of an example, it is assumed that each receiving end adopts the same check mask 00000011. Note that if different check masks are used, the communication process will have the effect of ensuring privacy when the masks are properly preserved. The processing unit of the sending end receives the complex data M1, M2 and M3 corresponding to the receiving ends A, B and C from the back-end network server through the transceiver unit, and their values are assumed to be 6, 41 and 60 (6-bit data) respectively. In particular, the length of the binary bits plus the check bits of the data value to be sent must be shorter than the length of the binary bits of the private decoding key.

First sending end checks mask F by original data M1, M2 and M3_A, F_Band F_CIt is expanded to M1', M2' and M3'. The expansion method is to place the original data bits in the bit-0 position of the check mask in sequence, and add 0 to the position of bit-1 of the check mask, and the expanded extended data M1 The values of ', M2' and M3' are 24 (000110-00011000), 164 (101001 ~ 10100100) and 240 (111100-11110000), respectively. Then, the sender uses the Chinese remainder theorem, according to the extended data M1', M2' and M3', the private decoding key K of the receivers A, B and C_A, K_Band K_C, calculate the combined data block S (Chinese remainder theorem understanding). In other words, the derived merged data block S needs to satisfy the following conditions:

S%K_a=M1' (ie S%257 = 24)

S%K_b=M2' (ie S2%263 = 164)

S%K_C=M3' (ie S2%269 = 240)

Accordingly, the transmitting end can calculate the merged data block S=80742742 according to the Chinese remainder theorem, and transmit this merged data block S simultaneously (for example: in the mode of broadcasting or group broadcasting) to all receivers A~E.

On the other hand, after receiving terminal A~E receives merged data block S, just can respectively according to its own private decoding key K_A~K_E, the result is calculated from the merged data block S. Among them, the combined data block S represents the dividend, and the private decoding key K_A~K_Erepresents the divisor. At this moment, the participating receivers A~C obtain the corresponding extended data M1'~M3' respectively, and check the position marked bit-1 in the mask of the extended M1' through the same calculation. If all are 0, the extended data is also less than or equal to 2~8 (within the range of meaningful values that can be expressed), then remove the extension bit to restore and obtain the original data M1~M3 that each needs to receive.

For the non-participating receiving end D, the remainder obtained through the division calculation, through the same calculation check the position of the last two bits marked bit-1 in the mask, any one of which is set to 1, or the extended data is greater than 2~ 8 (exceeds the meaningful value range that can be expressed), indicating that the receiving end has no data to receive (Null), therefore, the receiving ends D~E can discard the merged data block S accordingly; for the non-participating receiving end E , the obtained remainder is 200, and the last two error detection bits are all bit-0. At this time, the non-participating receiving end E will mistakenly think that there is data to be received, and obtain a wrong (garbled) data. This false-positive condition can be reduced below a reasonably acceptable probability of occurrence by increasing the number of test digits.

It should be noted that the check digit can be placed at any position, and all have the same checking ability, and must be at the last position without mandatory requirements, and the more checking digit, the stronger the checking ability (the lower the probability of false positive), The position of the parity bit is defaulted by the mask. For example, a mask is 0001000101, the original data is bit-0, and there are 7 bits, and the bit-1 position of the parity bit is 3 bits. When the 7-bit original data is inserted into the 3-bit check bit After verification, 10-bit extended data is formed. When the check bit is k bits, no matter how many bits the original data is, the false positive probability is <1/(2%); the false positive probability means that a non-target receiver misjudged itself as a target receiver, so Probability of receiving an incorrect data.

[0039] It should be noted that, since the private decoding key used in the present invention is unique, each receiving end can only retrieve the data of the corresponding private decoding key in the combined data block. For example, since the receiver A only has a private vector K_A, therefore, the receiver A can only pass the private decoding key K_ARetrieve data M from merged data block S_a , and cannot retrieve data sent to other recipients.

[0040] It should be emphasized that although the first embodiment is described with five groups of receiving ends, it is not used to limit the number of receiving ends.

[0041] It should be emphasized that in the embodiment, due to the use of the Chinese remainder theorem, the private decoding key is only a unique prime number, because the relationship between the divisor (vector) and the remainder (extended data) must be considered. Accordingly, when the vector is set, the public vector data must be larger than the value of the corresponding relationship vector data that may be used, and the private decoding key must also be larger than the value of the corresponding data that may be generated, so that the Chinese remainder theorem can be used. The relationship between the divisor and the remainder is satisfied.

In addition, although the remainder of aforementioned Chinese remainder theorem is a decimal positive integer, the data transmission form of data in the present invention is not limited to a decimal positive integer, in other words, the data of the present invention can be converted into Different data types (for example: binary, octal or hexadecimal), and then convert the data to decimal positive integers through corresponding conversion methods.

The length of the data transmitted in the present invention is also not limited to the length of the decoding key, and when there is data that is greater than the decoding key length and wants to transmit, the receiving end can be given a sufficient number of decoding keys, and the receiving end obtains Use the decoding key in sequence to obtain the data of a long data segment (such as a string), and as the aforementioned check method will automatically stop at the end of the long data segment, in other words, it can receive characters of any length serial transmission.

Furthermore, in the foregoing embodiment, the application of the Chinese remainder theorem is mainly used to illustrate the operation mode of the present invention, but it is not used to limit the implementation of the present invention, and those skilled in the art should be able to easily through the foregoing content. It is understood that other implementation manners that can also achieve the technical effect of the present invention will not be repeated here.

The present invention adopts above technical scheme, be different from the technical means that a data is divided into a plurality of groups after encrypting with different keys and is respectively combined into a data and sends a recipient's technical means based on the purpose of "encryption" in the prior art The present invention is based on the purpose of "efficient transmission", and the multiple data sent to different receiving ends are respectively combined into a large data block with different keys and the combined large data block is sent to a plurality of receivers at one time, many Each receiver uses its own key to decode the merged data block, so that the target receiver can obtain the data given to itself, while the non-target receiver cannot obtain the corresponding data and directly discard the merged data block. When the present invention has a large number of receiving ends in the network, when a large amount of data is transmitted

The resource utilization efficiency is effectively improved, and the problem of excessive data transmission delay is avoided. At the same time, no additional clock synchronization mechanism is required to ensure self-clock synchronization among multiple receivers. In addition, communication privacy is also improved.

[0046] Obviously, the described embodiments are some, but not all, embodiments of the present application. The embodiments in this application and the features in the embodiments may be combined with each other without conflict. The components of the embodiments of the present application generally described and illustrated in the drawings herein may be arranged and designed in a variety of different configurations. Thus, the detailed description of the embodiments of the application is not intended to limit the scope of the application as claimed, but is merely representative of selected embodiments of the application. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative work fall within the protection scope of the present application.