Distributed Internet of Things networking optimization method and system based on delay violation probability
By using multi-in and multi-output non-orthogonal multi-access MIMO-NOMA networking model and high-code rate encoding scheme in IoT networking, the problem of increasing code length increases and lower delay violations are achieved Probability and better networking effect, supporting large-scale connections.
Patent Information
- Application Number
- CN202411426286.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-10-14
- Publication Date
- 2024-11-12
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
In the coding modulation, satisfactory frame error rate can only be achieved when the code length tends to be infinitely long. Once the code length increases, it will increase the delay and cause poor networking effect.
The random network calculation model of multi-input, multiple-output, non-orthogonal multi-access, MIMO-NOMA network is adopted to convert the data amount into signal-to-noise ratio SNR domain data, obtain the probability of delay violation, and use duplicate codes and convolutional codes as high codes The rate coding scheme handles the probability of delay violation without increasing the code length, and guides resource allocation to optimize networking results.
Through low-complexity high-code rate coding scheme, the probability of delay violation is reduced, the delay performance is improved, and the time complexity and better networking effect can be achieved. Level 10-5 can be achieved when supporting large-scale networking connections. frame error rate.
Smart Images

Figure CN118944815A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of communication networking technology, and in particular to a distributed Internet of Things networking optimization method and system based on delay violation probability. Background Art
[0002] The transmission distance of space links usually reaches thousands of kilometers, which inevitably leads to an increase in latency. However, many IoT services currently have stringent requirements on latency, which brings challenges to the IoT industry supported by the integrated space-ground network. Delay analysis algorithms are particularly important in this context.
[0003] Since queuing theory and deterministic network calculus cannot cope with various uncertainties in communication systems, random network calculus is currently generally used to analyze the delay performance in communication systems. Different from deterministic network calculus, random network calculus introduces probabilistic operations, allowing communication systems to violate performance boundaries with a certain probability.
[0004] The existing technology takes into account factors such as inevitable channel fading, service arrival and system service randomness in actual transmission scenarios, so as to make full use of resources for communication networking. However, due to the fact that the existing technology can only achieve a satisfactory frame error rate when the code length tends to infinity during coding and modulation, once the code length increases, it will inevitably lead to an increase in delay, resulting in poor networking effect. Summary of the invention
[0005] The purpose of the present invention is to address the deficiencies of the above-mentioned prior art and provide a distributed Internet of Things networking optimization method and system based on delay violation probability, so as to solve the problem that in the prior art, a satisfactory frame error rate can only be achieved when the code length tends to be infinite during coding and modulation. Once the code length increases, it will inevitably lead to an increase in delay, resulting in poor networking effect.
[0006] The present invention specifically provides the following technical solution: a distributed Internet of Things networking optimization method based on delay violation probability, comprising the following steps: Use the random network calculation model of multiple-input multiple-output non-orthogonal multiple access MIMO-NOMA networking to obtain the data volume of the communication system; Converting the data in the data volume into signal-to-noise ratio (SNR) domain data, obtaining a delay representation of the SNR domain data, and obtaining a delay violation probability through the delay representation of the SNR domain data; Using repetition code and convolutional code as a high code rate coding scheme, and processing the delay violation probability by the high code rate coding scheme without increasing the code length; The resource allocation scheme is guided by the processed delay violation probability to obtain the optimized networking result.
[0007] Preferably, the data volume of the communication system is obtained using a random network calculation model of multiple-input multiple-output non-orthogonal multiple access MIMO-NOMA networking, specifically: Get in s Time has come t The amount of data arriving at the communication system at any given moment A ( s,t ), get s Time has come t The amount of data provided by the communication system S ( s,t ), and obtain s Time has come t The amount of data leaving the communication system at any given moment D ( s,t ).
[0008] Preferably, converting the data in the data volume into SNR domain data and obtaining a time delay representation of the SNR domain data comprises the following steps: Use exponential operation to s Time has come t The amount of data arriving at the communication system at any given moment A ( s,t ),exist s Time has come t The amount of data provided by the communication system S ( s,t ) and in s Time has come t The amount of data leaving the communication system at any given moment D ( s,t ) conversion to obtain SNR domain data, the specific expression is: .
[0009] Among them, e is the e-pointing function, u represents the parameters after the conversion at time s, It is defined as, represents continuous multiplication, t represents time, a( u ) represents the amount of data arriving at the communication system after conversion, s ( u ) represents the amount of data served by the communication system after conversion, d ( u ) represents the amount of data leaving the communication system after conversion, represents the data arrival process in the SNR domain, Represents the data service process in the SNR domain, Indicates the data leaving process of the SNR domain; in, , , , , , .
[0010] Obtain the delay representation in the SNR domain through the SNR domain data W ( t ), the specific expression is: .
[0011] Among them, inf is the minimum value, sup is the maximum value, represents deconvolution, Indicates 0 to t + u The specific expression of the amount of data leaving at the time when u is 0 is: .
[0012] in, represents convolution, Indicates the amount of data arriving in the SNR domain.
[0013] Preferably, obtaining the delay violation probability through the delay representation of the SNR domain data comprises the following steps: Get the initial expression of the delay violation probability, specifically: .
[0014] in, ω To tolerate the maximum delay, is the initial expression for the delay violation probability; The Mellin transform is introduced into the initial expression of the delay violation probability, and the delay violation probability is processed in combination with the Chernoff bound to obtain the optimized delay violation probability; the specific expression is: .
[0015] in, v is the parameter at any time after the Mellin transformation, for A ( s,t ), for S ( s,t ), θ is the relevant phase; The closed expression of the delay violation probability is obtained through a monotonically increasing function, including: Will p d ( ω ) is defined as the upper bound of the delay violation probability, that is: , and obtain the optimizedp d ( ω ); the specific expression is: .
[0016] Get the moment generating function ; The specific expression is: .
[0017] Among them, E represents expectation, η represents the Poisson distribution parameter; Get the moment generating function ; The specific expression is: .
[0018] in, γ is the signal-to-interference-noise ratio, , , Q is a Poisson random variable, ε is the frame error rate, N is the code length, parameter , and are two integral operations, f ( γ )for γ The probability density function of By determining and The value obtained ; The specific expression is: .
[0019] in, β is the ratio of the number of users to the number of antennas, conventional parameters , , N r is the number of antennas at the receiving end, c l is the coefficient set, is the number of coefficients; because p d ( ω ) is about A monotonically increasing function to obtain the upper bound of the delay violation probability p d ( ω ) is a closed expression; the specific expression is: .
[0020] in, yes The sum of the first n terms of yes The upper bound of .
[0021] Preferably, the use of repetition code and convolutional code as a high-rate coding scheme comprises the following steps: use( n ,1) represents the repetition code, and the code rate is obtained ;in, n is the length of the codeword sequence; A convolutional code is k Code elements are grouped into a group, and the encoding is n bits, and the encoding process is The information segments are related. As a constraint of convolutional codes, co-correlation ×n bits, and obtain the convolutional code ( n , k , ).
[0022] Preferably, the use ( n ,1) is a relation pair representing a repeated code, and further comprises the following steps: Get 1 ×n The generator matrix G REP , the specific expression is: G REP =[1,1,...,1].
[0023] Get( n -1) ×n The check matrix ; The specific expression is: .
[0024] Among them, n The submatrix with -1 column is the identity matrix.
[0025] The present invention provides a distributed Internet of Things networking optimization system based on delay violation probability, comprising: A data acquisition module is used to acquire the data volume of the communication system using a random network calculation model of multiple-input multiple-output non-orthogonal multiple access MIMO-NOMA networking; A conversion module, used to convert the data in the data volume into signal-to-noise ratio (SNR) domain data, and obtain a delay representation of the SNR domain data, and obtain a delay violation probability through the delay representation of the SNR domain data; A coding module, configured to use a repetition code and a convolutional code as a high-rate coding scheme, and process a delay violation probability through the high-rate coding scheme without increasing a code length; The networking optimization module is used to guide the resource allocation plan through the processed delay violation probability to obtain the optimized networking result.
[0026] The present invention also provides a computer device, including a memory and a processor, wherein a program is stored in the memory, and when the program is executed by the processor, the processor executes the steps of the above-mentioned distributed Internet of Things networking optimization method based on delay violation probability.
[0027] The present invention also provides a storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the steps of the above-mentioned distributed Internet of Things networking optimization method based on delay violation probability are implemented.
[0028] Compared with the prior art, the present invention has the following significant advantages: The present invention constructs a random network calculation model of MIMO-NOMA networking, obtains the data volume of the communication system, converts the data in the data volume into the SNR domain and obtains the delay representation in the SNR domain, obtains the delay violation probability through the delay representation, and uses low-complexity repetition code and convolution code as high-rate coding schemes to process the delay violation probability. Because the high-rate coding scheme has a strong error correction capability in processing scenarios with long code lengths, it provides better delay performance and lower time complexity through low-complexity and high-rate coding forms. When the code length remains unchanged, the delay violation probability can be greatly reduced and the delay performance can be improved. The proposed scheme can support large-scale networking connections while achieving 10 −5 The frame error rate FER of the level. BRIEF DESCRIPTION OF THE DRAWINGS
[0029] Figure 1 The Tanner graph provided by the present invention; Figure 2 A working principle diagram of the convolutional code provided by the present invention; Figure 3 A convolutional code grid diagram provided by the present invention; Figure 4 A performance comparison diagram of the solution provided by the present invention and the existing solution; Figure 5 A delay violation probability diagram under different maximum tolerable delays provided by the present invention; Figure 6 Delay violation probability diagram under different bit rates provided by the present invention; Figure 7 A graph showing the proportion of time used by each frame under different modules provided by the present invention; Figure 8 The time consumption diagram of each frame under different numbers of users provided by the present invention; Fig. 9 Performance diagrams under different coding and modulation schemes provided by the present invention; Fig.10 Under different modulation modes provided by the present invention p T and K relationship diagram. DETAILED DESCRIPTION
[0030] The following is a clear and complete description of the technical solutions of the embodiments of the present invention in conjunction with the drawings in the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present invention.
[0031] The present invention proposes a distributed Internet of Things networking optimization method based on delay violation probability to solve the problems of the prior art, which specifically includes the following steps: Step S1: Use a random network calculation model of multiple-input multiple-output non-orthogonal multiple access MIMO-NOMA (Multiple-Input Multiple-Output-Nonorthogonal Multiple Access) networking to obtain the data volume of the communication system.
[0032] S1 is specifically: Get in s Time has come t The amount of data arriving at the communication system at any given moment A ( s,t ), get s Time has come t The amount of data provided by the communication system S ( s,t ), and obtain s Time has come t The amount of data leaving the communication system at any given moment D ( s,t ).
[0033] Step S2: convert the data volume into the signal-to-noise ratio (SNR) domain, obtain the delay representation of the SNR domain data, and obtain the delay violation probability through the delay representation of the SNR domain data.
[0034] Specifically: Converting data in the data volume into SNR domain data and obtaining a delay representation of the SNR domain data includes the following steps: Use exponential operation ons Time has come t The amount of data arriving at the communication system at any given moment A ( s,t ),exist s Time has come t The amount of data provided by the communication system S ( s,t ) and in s Time has come t The amount of data leaving the communication system at any given moment D ( s,t ) conversion to obtain SNR domain data, the specific expression is: .
[0035] Among them, e is the e-pointing function, u represents the parameters after the conversion at time s, It is defined as, represents continuous multiplication, t represents time, a( u ) represents the amount of data arriving at the communication system after conversion, s ( u ) represents the amount of data served by the communication system after conversion, d ( u ) represents the amount of data leaving the communication system after conversion, represents the data arrival process in the SNR domain, Represents the data service process in the SNR domain, Represents the data leaving process in the SNR domain.
[0036] in, , , , , , .
[0037] To further expand the calculation, the binary algebraic (min, ×) convolution operation is introduced and (min, ×) deconvolution operation . min means taking the lower bound of the set, and × means the minimum convolution operation.
[0038] Obtaining SNR-domain delay representation through SNR-domain data W ( t ), the specific expression is: .
[0039] Among them, inf is the minimum value, sup is the maximum value, represents deconvolution, where It represents the amount of data leaving from time 0 to time t+u. When u is 0, the specific expression is: .
[0040] in, represents convolution, Indicates the amount of data arriving in the SNR domain.
[0041] Among them, the delay violation probability is obtained through the delay representation of the SNR domain data, specifically: Get the initial expression of the delay violation probability, specifically: .
[0042] in, ω To tolerate the maximum delay, is the initial expression for the delay violation probability.
[0043] The Mellin transform is introduced into the initial expression of the delay violation probability, and the delay violation probability is processed in combination with the Chernoff bound to obtain the optimized delay violation probability; the specific expression is: .
[0044] in, v is the parameter at any time after the Mellin transformation, for A ( s,t ), for S ( s,t ), θ is the relevant phase.
[0045] Obtaining a closed expression for the delay violation probability through a monotonically increasing function includes the following steps: Will p d ( ω ) is defined as the upper bound of the delay violation probability, that is: , and obtain the optimized p d ( ω ); the specific expression is: .
[0046] Get the moment generating function ; The specific expression is: .
[0047] Among them, E represents expectation, η represents the Poisson distribution parameter.
[0048] Get the moment generating function ; The specific expression is: .
[0049] in, γ is the signal-to-interference-noise ratio, , , Q is a Poisson random variable, ε is the frame error rate, N is the code length, parameter , and are two integral operations, f ( γ )for γ The probability density function of .
[0050] By determining and The value obtained ; The specific expression is: .
[0051] in, β is the ratio of the number of users to the number of antennas, conventional parameters , , N r is the number of antennas at the receiving end, c l is the coefficient set, is the number of coefficients.
[0052] because p d ( ω ) is about A monotonically increasing function to obtain the upper bound of the delay violation probability p d ( ω ) is a closed expression; the specific expression is: .
[0053] in, yes The sum of the first n terms of yes The upper bound of the above right formula can be obtained by adjusting θ.
[0054] Step S3: using repetition code and convolutional code as a high-rate coding scheme, and processing the delay violation probability through the high-rate coding scheme without increasing the code length.
[0055] S3 is specifically: Using repetition code and convolutional code as a high-rate coding scheme includes the following steps: use( n ,1) represents the repetition code, and the code rate is obtained .in, n is the length of the codeword sequence.
[0056] A convolutional code is k Code elements are grouped into a group, and the encoding is n bits, and the encoding process is The information segments are related. As a constraint of convolutional codes, co-correlation ×n bits, and obtain the convolutional code ( n , k , ).
[0057] use( n ,1) is a relation pair representing a repeated code, and further comprises the following steps: Get 1 ×n The generator matrix G REP , the specific expression is: G REP =[1 1, ...,1].
[0058] Get( n -1) ×n The check matrix ; The specific expression is: .
[0059] Among them, n The submatrix with -1 column is the identity matrix.
[0060] URLLC networking solution based on high bit rate coding modulation: As a strong candidate for 5G coding technology, Low Density Parity Check Code (LDPC) has attracted the attention of many experts and scholars at home and abroad. LDPC code has a strong error correction capability in scenarios with long code lengths, and its performance is close to Shannon capacity. In existing solutions, if you want to support low-latency and nearly error-free transmission for a large number of users, you need to meet the code length N→10. 4 .
[0061] Check matrix of LDPC code It is a sparse matrix, and the number of zero elements in the matrix is much larger than the number of non-zero elements. The use of sparse matrices can effectively reduce the complexity of decoding, and the increase in code length will not cause a significant increase in complexity.
[0062] The check matrix representation is mainly used for mathematical model representation and mathematical calculation, while the Tanner graph can present the encoding process in a more intuitive way. The check nodes (CN) and variable nodes (VN) in the Tanner graph correspond to If a CN is connected to a VN, the corresponding position The elements in are 1, otherwise they are 0. The number of CNs connected to a VN is called the degree of the VN. d v Similarly, the number of VNs connected to a CN is called the degree of the CN. d c .
[0063] Then, LDPC codes can be represented by Tanner graphs, as follows: Figure 1 As shown, c1, c2, c3, c4 and c5 are check nodes, b1, b2, b3, b4, b5, b6, b7, b8, b9 and b 10 is a variable node.
[0064] Convolutional codes are non-block codes. The main difference between them and block codes is that the codewords generated by them are not only related to the information codewords at the current moment, but also to the previous information segments. k Code elements are grouped into a group, and the encoding is n bits, and the encoding process is The information segments are related, then the constraint degree of the convolutional code is , total correlation * n bits, denoted as ( n , k , ). Figure 2 This is the working principle diagram of the convolutional code. One coded input u generates two coded outputs c1 and c2.
[0065] Convolutional codes can also be represented by polynomials and trellis graphs. Since the current encoding output of a convolutional code is also related to the previous input, it can be represented by a trellis graph. There are 4 different states of convolutional codes: S 0(00), S 1(01), S 2(10) and S 3(11), each state has two transfer paths to the next state according to the current input. Figure 3 is the convolutional code trellis diagram.
[0066] Wherein, when the code length does not increase, the delay violation probability is processed by a high code rate coding scheme, including the following steps: A data block with a data volume greater than a set threshold is obtained through a high-code rate encoding scheme.
[0067] In the case where the code length does not increase, data transmission is performed through data blocks to obtain the optimal maximum tolerable delay, and the optimal delay violation probability of the optimal maximum tolerable delay is obtained.
[0068] Step S4: guiding the resource allocation plan through the processed delay violation probability to obtain an optimized networking result.
[0069] Numerical results and discussion: Performance comparison analysis with existing solutions: LDPC code is a widely used coding scheme in 5G. However, in existing research schemes, in order to achieve near error-free transmission, the code length N→10 must be met. 4 In the present invention, the proposed power allocation scheme is applied to the LDPC code system, and it is confirmed that the proposed scheme can effectively reduce the frame error rate (FER) of the system. Figure 4 As shown in the figure, a performance comparison chart with existing solutions is shown.
[0070] Figure 5 By comparing the delay violation probability of ω under different maximum tolerable delays, it can be clearly observed that the larger the maximum tolerable delay, the smaller the delay violation probability that can meet this situation, which is also in line with basic intuition.
[0071] Figure 6 The delay violation probability under different bit rates is compared with Figure 5 The difference is that the bit rate varies from 1 / 10 to 1 / 2. Figure 6 It was found that high bit rate scenarios showed better latency performance. R c =1 / 6, even if the maximum tolerable delay is increased, the delay violation probability still cannot be reduced. R c =1 / 2, R c =1 / 3 and R c =1 / 4 can get 10 -4 The delay violation probability is R c =1 / 2 when ω is only 1, and R c =1 / 4 =5. This is because each data block can carry more data in a high bit rate scenario, reducing the number of transmissions.
[0072] Figure 7 and Figure 8The time complexity of the system is demonstrated. The modulation methods are all GMSK modulation. The effects of REP code, CC code and LDPC code on the complexity are studied. The standard for measuring time complexity is the time consumed by each data frame.
[0073] Fig. 9 Four systems with different configurations are shown to study their frame error rate (FER) and power consumption. E b / N 0 performance, all four systems are based on the assumption of imperfect CSIT.
[0074] Fig.10 Demonstrates the modulation power under MSK and GMSK modulation p T Modulation Ratio K relationship.
[0075] Based on the above method, the present invention provides a distributed Internet of Things networking optimization system based on delay violation probability, including: a data acquisition module, a conversion module, a coding module and a networking optimization module.
[0076] Among them, the data acquisition module is used to obtain the data volume of the communication system using the random network calculation model of multiple-input multiple-output non-orthogonal multiple access MIMO-NOMA networking; the conversion module is used to convert the data in the data volume into signal-to-noise ratio SNR domain data, and obtain the delay representation of the SNR domain data, and obtain the delay violation probability through the delay representation of the SNR domain data; the encoding module is used to use repetition codes and convolutional codes as high-rate encoding schemes, and process the delay violation probability through the high-rate encoding scheme without increasing the code length; the networking optimization module is used to guide the resource allocation plan through the processed delay violation probability to obtain the optimized networking result.
[0077] The present invention also provides a computer device, including a memory and a processor, wherein a program is stored in the memory, and when the program is executed by the processor, the processor executes the steps of a distributed Internet of Things networking optimization method based on delay violation probability.
[0078] According to the disclosed embodiments, a computing device may communicate with one or more external devices (e.g., keyboards, pointing devices, Bluetooth communications, etc.), or with any device (e.g., routers, modems, etc.) that enables a computing device to communicate with one or more other computing devices.
[0079] The present invention also provides a storage medium on which a computer program is stored. When the computer program is executed by a processor, a distributed Internet of Things networking optimization method based on delay violation probability is implemented.
[0080] According to the disclosed embodiments, the storage medium may be a non-volatile computer-readable storage medium, such as but not limited to: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present invention, the storage medium may be any tangible medium containing or storing a program that may be used by or in conjunction with an instruction execution system, apparatus, or device.
[0081] The various embodiments in this specification are described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the various embodiments can be referenced to each other.
[0082] The principles and implementation methods of the present invention are described in this article using specific examples. The description of the above embodiments is only used to help understand the method and core idea of the present invention. At the same time, for those skilled in the art, according to the idea of the present invention, there will be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as limiting the present invention.
Claims
1. A distributed Internet of Things networking optimization method based on delay violation probability, characterized in that: include: Use the random network calculation model of multiple-input multiple-output non-orthogonal multiple access MIMO-NOMA networking to obtain the data volume of the communication system; Converting the data in the data volume into signal-to-noise ratio (SNR) domain data, obtaining a delay representation of the SNR domain data, and obtaining a delay violation probability through the delay representation of the SNR domain data; Using repetition code and convolutional code as a high code rate coding scheme, and processing the delay violation probability by the high code rate coding scheme without increasing the code length; The resource allocation scheme is guided by the processed delay violation probability to obtain the optimized networking result.
2. A distributed Internet of Things networking optimization method based on delay violation probability as claimed in claim 1, characterized in that: The data volume of the communication system is obtained using the random network calculation model of multiple-input multiple-output non-orthogonal multiple access MIMO-NOMA networking, specifically: Get in s Time has come t The amount of data arriving at the communication system at any given moment A ( s,t ), get s Time has come t The amount of data provided by the communication system S ( s,t ), and obtain s Time has come t The amount of data leaving the communication system at any given moment D ( s,t ).
3. A distributed Internet of Things networking optimization method based on delay violation probability as claimed in claim 2, characterized in that: Converting the data in the data volume into SNR domain data and obtaining a time delay representation of the SNR domain data comprises the following steps: Use exponential operation to s Time has come t The amount of data arriving at the communication system at any given moment A ( s,t ),exist s Time has come t The amount of data provided by the communication system S ( s,t ) and in s Time has come t The amount of data leaving the communication system at any given moment D ( s,t ) conversion to obtain SNR domain data, the specific expression is: ; Among them, e is the e-pointing function, u represents the parameters after the conversion at time s, It is defined as, represents continuous multiplication, t represents time, a( u ) represents the amount of data arriving at the communication system after conversion, s ( u ) represents the amount of data served by the communication system after conversion, d ( u ) represents the amount of data leaving the communication system after conversion, represents the data arrival process in the SNR domain, Represents the data service process in the SNR domain, Indicates the data leaving process of the SNR domain; in, , , , , , ; Obtaining delay representation through the SNR domain data W ( t ), the specific expression is: ; Among them, inf is the minimum value, sup is the maximum value, represents deconvolution, Indicates 0 to t + u The specific expression of the amount of data leaving at the time when u is 0 is: ; in, represents convolution, Indicates the amount of data arriving in the SNR domain.
4. A distributed Internet of Things networking optimization method based on delay violation probability as claimed in claim 3, characterized in that: Obtaining the delay violation probability through the delay representation of the SNR domain data includes the following steps: Get the initial expression of the delay violation probability, specifically: ; in, ω To tolerate the maximum delay, is the initial expression for the delay violation probability; The Mellin transform is introduced into the initial expression of the delay violation probability, and the delay violation probability is processed in combination with the Chernoff bound to obtain the optimized delay violation probability. The specific expression is: ; in, v is the parameter at any time after the Mellin transformation, for A ( s,t ), for S ( s,t ), θ is the relevant phase; The closed expression of the delay violation probability is obtained through a monotonically increasing function, including: Will p d ( ω ) is defined as the upper bound of the delay violation probability, that is: , and obtain the optimized p d ( ω ); the specific expression is: ; Get the moment generating function ; The specific expression is: ; Among them, E represents expectation, η represents the Poisson distribution parameter; Get the moment generating function ; The specific expression is: ; in, γ is the signal-to-interference-noise ratio, , , Q is a Poisson random variable, ε is the frame error rate, N is the code length, parameter , and are two integral operations, f ( γ )for γ The probability density function of By determining and The value obtained ; The specific expression is: ; in, β is the ratio of the number of users to the number of antennas, conventional parameters , , N r is the number of antennas at the receiving end, c l is the coefficient set, is the number of coefficients; because p d ( ω ) is about A monotonically increasing function to obtain the upper bound of the delay violation probability p d ( ω ) is a closed expression; the specific expression is: ; in, yes The sum of the first n terms of yes The upper bound of .
5. A distributed Internet of Things networking optimization method based on delay violation probability as claimed in claim 1, characterized in that: The use of repetition code and convolutional code as a high code rate encoding scheme comprises the following steps: use( n ,1) represents the repetition code, and the code rate is obtained ;in, n is the length of the codeword sequence; A convolutional code is k Code elements are grouped into a group, and the encoding is n bits, and the encoding process is The information segments are related. As a constraint of convolutional codes, co-correlation ×n bits, and obtain the convolutional code ( n , k , ).
6. A distributed Internet of Things networking optimization method based on delay violation probability as claimed in claim 5, characterized in that: The use ( n ,1) is a relation pair representing a repeated code, and further comprises the following steps: Get 1 ×n The generator matrix G REP , the specific expression is: G REP =[1,1,...,1]; Get( n -1) ×n The check matrix ; The specific expression is: ; Among them, n The submatrix with -1 column is the identity matrix.
7. A distributed Internet of Things networking optimization system based on delay violation probability, characterized in that: include: A data acquisition module is used to acquire the data volume of the communication system using a random network calculation model of multiple-input multiple-output non-orthogonal multiple access MIMO-NOMA networking; A conversion module, used to convert the data in the data volume into signal-to-noise ratio (SNR) domain data, and obtain a delay representation of the SNR domain data, and obtain a delay violation probability through the delay representation of the SNR domain data; A coding module, configured to use a repetition code and a convolutional code as a high-rate coding scheme, and process a delay violation probability through the high-rate coding scheme without increasing a code length; The networking optimization module is used to guide the resource allocation plan through the processed delay violation probability to obtain the optimized networking result.
8. A computer device, characterized in that: It includes a memory and a processor, wherein a program is stored in the memory, and when the program is executed by the processor, the processor executes the steps of a distributed Internet of Things networking optimization method based on delay violation probability as described in any one of claims 1 to 6.
9. A storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of a distributed Internet of Things networking optimization method based on delay violation probability as described in any one of claims 1 to 6 are implemented.
Citation Information
Patent Citations
Short packet transmission delay analysis method in large-scale MIMO-NOMA system
CN110677178A
Transmission method for reducing delay default probability
CN113938252A
Beam forming method for a transmitting antenna and a device thereof
US20180331738A1
