An optimal cooperative asynchronous random access method, system, storage medium, and device
By employing a relay cooperative transmission scheme and optimizing relay link capacity, the problems of packet collision and power consumption limitations in asynchronous random access in satellite industrial IoT were solved, achieving high-performance power domain non-orthogonal multiple access transmission and improving system performance and throughput.
Patent Information
- Application Number
- CN202311168938.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-09-11
- Publication Date
- 2026-11-17
- Estimated Expiration
- 2043-09-11
AI Technical Summary
In satellite industrial IoT, packet conflicts and device power consumption limitations caused by asynchronous random access severely affect system performance, making it difficult to meet the needs of large-scale access.
A relay cooperative transmission scheme is adopted. The optimal cooperative relay is determined by optimizing the relay link capacity. An asynchronous random access packet transmission mode and a receiver sliding multi-user detection are designed to realize power domain non-orthogonal multiple access transmission.
It significantly improved system performance, increased channel capacity and throughput, reduced the probability of packet collisions, and met the access requirements of large-scale satellite industrial IoT.
Smart Images

Figure CN117082639B_ABST
Abstract
Description
Technical Field
[0001] This invention belongs to the field of wireless mobile communication technology, and particularly relates to an optimal cooperative asynchronous random access method, system, storage medium and device. Background Technology
[0002] Currently, compared to traditional Industrial Internet of Things (IIoT), Satellite-enabled IIoT (S-IIoT) offers advantages in wide-area coverage, long-distance transmission, and information collection in remote areas. A key issue in S-IIoT is how to connect a large number of devices to satellites. Asynchronous random access is considered an effective solution for uplink access in large-scale S-IIoT scenarios. However, due to the lightweight control and non-coordinated transmission characteristics of asynchronous random access, a large number of concurrent access signals can lead to numerous data collisions, severely impacting performance. Furthermore, traditional design concepts for asynchronous random access aim to improve system performance through joint transceiver design, but these concepts are limited by low device power consumption and high packet collision rates, thus restricting performance improvement. The emergence of relays can effectively address the low power limitations of IoT devices, and their high-speed transmission characteristics offer greater potential for improving system performance. Therefore, researching relay-coordinated transmission provides a new design approach for realizing asynchronous transmission in S-IIoT.
[0003] Based on the above analysis, the problems and shortcomings of the existing technology are as follows:
[0004] (1) Asynchronous transmission adopts the "send upon arrival" access strategy. The massive concurrent access signals will cause a large number of data packets to have local conflicts, which limits the improvement of system performance. It is necessary to solve the problem of a large number of local conflicts.
[0005] (2) The traditional asynchronous random access design concept aims to improve system performance through transceiver design. However, due to the low power consumption and low cost of IoT devices, the improvement of system performance is greatly limited, making it difficult to meet the access requirements of large-scale S-IIoT. Summary of the Invention
[0006] To address the problems existing in the prior art, this invention provides an optimal cooperative asynchronous random access method, system, storage medium, and device.
[0007] This invention is implemented as follows: an optimal cooperative asynchronous random access method is proposed. This method employs a relay cooperative transmission scheme to achieve power domain non-orthogonal multiple access transmission. The optimal cooperative relay for each user is determined under satellite movement conditions. An optimization problem is constructed based on the changing relay link capacity, and the optimal solution is obtained. Based on the optimal cooperative transmission scheme, the packet transmission mode of the asynchronous random access transmitter and the sliding multi-user detection scheme of the receiver are jointly designed, ultimately achieving optimal cooperative asynchronous random access.
[0008] Furthermore, the optimal cooperative asynchronous random access method includes the following steps:
[0009] Step 1: Construct an optimal cooperative asynchronous network model with relay-based cooperative transmission;
[0010] Step two: Assign the optimal relay to the user based on the satellite's location;
[0011] Step 3: Implement large-scale S-IIoT access satellites based on the optimal relay and OCARA protocol.
[0012] Furthermore, the optimal cooperative asynchronous network model with relay cooperative transmission in step one includes: for a low-orbit S-IIoT scenario with multiple cooperative relays, packets sent through relay links, during data transmission, the satellite, device, and relay each have a single antenna and access the satellite through a shared channel. The device will transmit data to the satellite through direct links and relay links, and send the collected data to the ground gateway without errors. The ground gateway is responsible for decoding the data.
[0013] Furthermore, the optimal cooperative asynchronous network model with relay-based cooperative transmission in step one also includes: In the OCARA protocol, the boundaries of time slots and frames are marked only at the local transmitter and are completely asynchronous between transmitters. The concept of a virtual frame (VF) refers to a time slot frame unique to each transmitter. In OCARA, for all transmitters, each virtual frame consists of N... slots It consists of 1 time slot, each time slot lasting for T seconds. slot The duration of the entire frame is T. frame = N slots ·T slot The boundaries of frames and time slots are defined relative to the receiver's time axis. All packets can arrive within the time slot boundaries, and all identical packets arrive in the same OCARA frame.
[0014] Each active user sends packets at any time within their local VF, and the number of active users follows [the rule]. The Poisson distribution, in which This represents the average number of active users. A packet is generated immediately upon user activation, ready for transmission. The duration of each packet is the same for all users, denoted as T. packet The number of relays is assumed to be ( The number of users is ( Furthermore, all relays operate using the Amplify Forward (AF) protocol, allowing each user-generated packet to be sent directly to the satellite or via a relay.
[0015] Users transmit data to the satellite via a direct link, and the received signal is represented as follows:
[0016]
[0017] in Indicates user The transmission power, Represented as user Channel to satellite , This indicates large-scale decay. This indicates small-size fading. This represents Gaussian white noise with a mean of 0 and a variance of 1.
[0018] When a user transmits data to a satellite via a relay link, the received signal is represented as follows:
[0019]
[0020] in It is the power amplification factor. User To relay The channel, , This indicates large-scale decay. This indicates small-size fading. For relay Channel to satellite and It is Gaussian white noise with a mean of 0 and a variance of 1.
[0021] Furthermore, the optimal relay allocation in step two is as follows: In the S-IIoT scenario of step one, when the satellite moves to different locations, each user selects a different cooperative relay. An optimal relay cooperative transmission scheme with time-varying characteristics is designed. For K users and I relays within the same beam, using... Indicates the first The user selected the first One relay, otherwise The optimal relay allocation is determined by optimizing the maximum communication capacity, which is expressed by the following formula:
[0022]
[0023] in This represents the channel capacity of user k when the satellite moves to a specific location t0. For instantaneous received signal-to-noise ratio;
[0024] The optimization problem is structured as follows:
[0025]
[0026] The optimization problem is a 0-1 programming problem. Since the number of users accessing the system at a certain time is not large, an exhaustive approach is used to solve the problem.
[0027] Furthermore, the specific content of the OCARA protocol in step three is as follows: After determining the optimal relay, each user will send packets to the satellite by relying on the OCARA protocol. The OCARA protocol is divided into an OCARA modulator and an OCARA demodulator.
[0028] For the OCARA modulator, the specific operation can be summarized in the following two steps:
[0029] (1) The valid information sent by the device is encoded and modulated to form a packet. Then, a preamble sequence is randomly selected from the local preamble sequence pool and appended to the beginning of the packet for packet acquisition and channel estimation.
[0030] (2) For each generated packet in (1), two identical packet copies are made. One packet copy is sent directly to the satellite via a direct link at the start of the virtual frame, and the other packet copy is delayed by a random amount of time during the duration of the virtual frame. Transmitted to satellite via relay link;
[0031] For the OCARA protocol demodulator, the specific process is as follows:
[0032] Due to the asynchronous nature of the OCARA protocol, in sliding detection, packets are decoded within the detection window according to the detection order, utilizing the capture effect. Interference cancellation IC technology is then used to eliminate interference from decoded packets and their copies. This operation is performed iteratively until the maximum number of iterations is reached. Then, the detection window is moved according to the step size... Slide to the next position for the next round of detection; the specific demodulation operation is as follows:
[0033] (1) For the received signal within the detection window, frequency conversion, filtering, and sampling operations are performed. Then, the processed signal samples are placed in the memory spanning the frames. When the detection window moves in steps... When sliding to the next detection position, the memory span also... Move to the right; at the same time, the leftmost part of the original memory span will be removed, and the empty rightmost part will be filled with the new incoming signal sample;
[0034] (2) Within the current detection window, packet preamble detection is first performed across the entire memory span using correlation calculations with the local preamble sequence. Each time a preamble is successfully detected, channel estimation and packet detection are performed. Packet detection based on the capture effect is as follows. For any packet j, its received signal-to-interference-plus-noise ratio (SINR) is written as:
[0035]
[0036] in This represents the received power of the j-th packet. The interference ratio of the nth group. Let N be the received power of the nth interfering packet, N be the number of interfering packets, and the probability that packet j is successfully decoded is:
[0037]
[0038] Where r represents the capture threshold;
[0039] when If the value is 0, it means that group j can be successfully decoded; otherwise, decoding fails and another group needs to be searched and decoding is attempted using group detection based on the capture effect.
[0040] (3) After packet j is successfully decoded, IC processing will be performed to remove interference from itself and its copy. The specific interference removal operation is as follows: First, a preamble search is performed to determine the location of the copy and estimate its channel. Then, the decoded payload bits are re-encoded and modulated to regenerate symbols. The regenerated symbols and preamble are combined with the estimated channel to reconstruct packet j and its copy. Finally, the signal samples of packet j and its copy are subtracted from the memory span to eliminate interference from itself and its copy.
[0041] (4) Iteratively execute steps 2) and 3) within the current detection window until the maximum number of iterations is reached. Then, the detection window will be incremented by a step size. Slide to the next detection position and perform steps 1), 2), and 3) in the new detection window.
[0042] Another object of the present invention is to provide a computer device including a memory and a processor, the memory storing a computer program that, when executed by the processor, causes the processor to perform the optimal cooperative asynchronous random access method.
[0043] Another object of the present invention is to provide a computer-readable storage medium storing a computer program that, when executed by a processor, causes the processor to perform the optimal cooperative asynchronous random access method.
[0044] Another objective of this invention is to provide an information data processing terminal for implementing the optimal cooperative asynchronous random access method.
[0045] Another object of the present invention is to provide an optimal cooperative asynchronous random access system based on the aforementioned optimal cooperative asynchronous random access method, the optimal cooperative asynchronous random access system comprising:
[0046] The cooperative transmission module is used to implement power domain non-orthogonal multiple access transmission using a relay cooperative transmission scheme.
[0047] The problem-building module is used to determine the optimal cooperative relay for each user when the satellite is moving. It constructs an optimization problem based on the changing relay link capacity and obtains the optimal solution.
[0048] The results output module is used to jointly design the packet transmission mode of the asynchronous random access transmitter and the sliding multi-user detection scheme of the receiver based on the optimal cooperative transmission scheme.
[0049] Based on the above technical solutions and the technical problems solved, the advantages and positive effects of the technical solution to be protected by this invention are as follows:
[0050] First, this invention provides an optimal cooperative asynchronous random access (OCARA) method for large-scale S-IIoT. To address the power limitations of IIoT devices, a relay cooperative transmission scheme is designed, achieving high-performance power-domain non-orthogonal multiple access transmission. Next, to further determine the optimal cooperative relay for each user under satellite movement conditions, an optimization problem is constructed based on varying relay link capacity, and the optimal solution is obtained. Then, based on the optimal cooperative transmission scheme, a packet transmission mode for the asynchronous random access transmitter and a sliding multi-user detection scheme for the receiver are jointly designed. With the help of the optimal cooperative relay, system performance is significantly improved.
[0051] Second, as the relay transmit power increases, the sum of the channel capacities of the proposed optimal cooperative schemes gradually increases. This can be attributed to the fact that higher relay transmit power provides better cooperative transmission quality, resulting in greater channel capacity. The peak normalized throughput of CRDSA, IRSA, ACRDA, and ACRDA-NOMA is approximately 0.51, 0.59, 0.66, and 0.76 bits / symbol, respectively. The peak normalized throughput of OCARA with transmit powers of 15, 20, and 25 dB is 0.99, 1.21, and 1.35 bits / symbol, respectively. The peak normalized throughput of OCARA gradually increases with increasing relay transmit power. Clearly, the peak normalized throughput of OCARA is significantly greater than these benchmark schemes. In fact, the peak throughput of OCARA with a transmit power of 25 dB is 77.6% higher than that of ACRDA-NOMA. This demonstrates that the proposed OCARA protocol achieves better performance compared to existing schemes. For a target PLR of 2 × 10⁻², the average throughput loads of CRDSA, IRSA, ACRDA, and ACRDA-NOMA can reach approximately 0.38, 0.61, 0.60, and 0.61 bits / symbol, respectively. OCARA, with transmit powers of 15, 20, and 25 dB, achieves 1.00, 1.07, and 1.20 bits / symbol, respectively. Compared to the relatively better ACRDA-NOMA, OCARA with a transmit power of 25 dB achieves approximately twice the performance in terms of target PLR. Clearly, OCARA offers superior PLR performance compared to existing benchmark solutions.
[0052] In terms of normalized sum rate, the OCARA protocol significantly outperforms the ACRDA and ACRDA-NOMA protocols. In fact, the peak normalized sum rate of OCARA at a transmit power of 25dB is approximately twice that of ACRDA-NOMA. Unlike normalized throughput, normalized sum rate reflects the performance improvement of cooperative relays at different transmit powers. In the linear region (i.e., average traffic load < 1), the normalized sum rate increases slightly with increasing transmit power. This can be interpreted as higher transmit power resulting in greater channel capacity for the relay link, thus significantly improving the normalized sum rate.
[0053] Third, the expected benefits and commercial value of the technical solution after its transformation are as follows: The main application background of this invention is satellite industrial IoT. Currently, the main problem facing satellite industrial IoT is the large number of conflicts caused by massive concurrent access signals. Simultaneously, the system performance is severely limited by the low power consumption and low cost of the IoT nodes themselves. The technical solution of this invention aims to solve the above-mentioned key problems faced by satellite industrial IoT. The expected benefits after the technical solution is transformed are closely related to the current maturity of satellite industrial IoT development. Currently, satellite industrial IoT is gradually moving from theory to application, and it has broad application prospects in uplink access scenarios for industrial IoT nodes in remote areas. After the transformation of this invention, it can be applied to the uplink access of large-scale satellite industrial IoT, improving system throughput and meeting the access needs of large-scale satellite industrial IoT.
[0054] Does the technical solution of this invention solve a long-standing but unsolved technical problem? In large-scale satellite industrial IoT, the main technical challenge faced by existing technologies is how to improve the access performance of satellite industrial IoT under the constraints of low power consumption and low cost. Existing technologies mainly rely on simple transceiver designs to improve system access performance; however, in practical applications, this is greatly limited by the low power consumption and low cost characteristics of the IoT nodes themselves, posing a significant challenge to improving the performance of large-scale satellite industrial IoT. This invention adopts a relay cooperative transmission scheme to achieve power domain non-orthogonal multiple access transmission, solving the limitations of the IoT nodes themselves. It also determines the optimal cooperative relay for each user when the satellite is moving. Furthermore, it jointly designs the packet transmission mode of the asynchronous random access transmitter and the sliding multi-user detection scheme of the receiver, ultimately achieving optimal cooperative asynchronous random access, thus solving the access problem of large-scale satellite IoT to a certain extent. Attached Figure Description
[0055] Figure 1 This is a flowchart of the optimal cooperative asynchronous random access method provided in the embodiments of the present invention;
[0056] Figure 2 This is a schematic diagram of a relay cooperative transmission network model provided in an embodiment of the present invention;
[0057] Figure 3 This is a schematic diagram of the OCARA protocol data packet distribution provided in an embodiment of the present invention;
[0058] Figure 4 This is a schematic diagram of the sliding multi-user detection principle provided in an embodiment of the present invention;
[0059] Figure 5 This is a performance comparison chart of the optimal cooperative transmission scheme provided in the embodiments of the present invention;
[0060] Figure 6This is a schematic diagram comparing the normalized throughput performance of the OCARA protocol provided in an embodiment of the present invention;
[0061] Figure 7 This is a schematic diagram comparing the packet loss rate performance of the OCARA protocol provided in an embodiment of the present invention;
[0062] Figure 8 This is a schematic diagram comparing the normalization and rate performance of the OCARA protocol provided in an embodiment of the present invention. Detailed Implementation
[0063] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the invention.
[0064] like Figure 1 As shown, the optimal cooperative asynchronous random access method provided in this embodiment of the invention includes the following steps:
[0065] S101: Power domain non-orthogonal multiple access transmission is achieved using a relay cooperative transmission scheme;
[0066] S102: Determine the optimal cooperative relay for each user in the case of satellite movement. An optimization problem is constructed based on the changing relay link capacity, and the optimal solution is obtained.
[0067] S103: Based on the optimal cooperative transmission scheme, jointly design the packet transmission mode of the asynchronous random access transmitter and the sliding multi-user detection scheme of the receiver.
[0068] Example 1:
[0069] The optimal cooperative asynchronous random access method provided in this embodiment of the invention specifically includes the following steps:
[0070] Step 1: Construct an optimal cooperative asynchronous network model with relay-based cooperative transmission;
[0071] Step two: Assign the optimal relay to the user based on the satellite's location;
[0072] Step 3: Implement large-scale S-IIoT access satellites based on the optimal relay and OCARA protocol.
[0073] In an embodiment of the present invention, step one, the optimal cooperative asynchronous network model with relay cooperative transmission, includes: for a low-orbit S-IIoT scenario with multiple cooperative relays, such as... Figure 2As shown, the satellite moves at high speed in a given orbit, and the equipment and relays are statically and uniformly distributed within a single beam of the satellite. Furthermore, the equipment is power-limited, while the relays have significantly higher power. Therefore, packets transmitted via relay links have greater power than those transmitted via direct links, enabling power-domain NOMA (Normally Oriented Multi-Aspect Ratio). By using packet diversity transmission with power-domain NOMA, the throughput of the OCARA protocol can be significantly improved. During data transmission, the satellite, equipment, and relays each have a single antenna, and a large number of devices access the satellite through a shared channel. The devices transmit data to the satellite via direct and relay links, and send the collected data error-free to the ground gateway, which is responsible for decoding the data.
[0074] In embodiments of the present invention, step one, the optimal cooperative asynchronous network model with relay cooperative transmission, further includes: in the OCARA protocol, the boundaries of time slots and frames are marked only at the local transmitter and are completely asynchronous between transmitters. The present invention uses the term Virtual Frame (VF) to specifically refer to the concept of a time slot frame unique to each transmitter. In OCARA, for all transmitters, each Virtual Frame consists of N... slots It consists of 1 time slot, each time slot lasting for T seconds. slot The duration of the entire frame is T. frame = N slots ·T slot The boundaries of frames and time slots are defined relative to the receiver's time axis. Therefore, all packets can arrive within the time slot boundaries, and all identical packets arrive in the same OCARA frame.
[0075] Each active user can send packets at any time within their local VF. The number of active users follows... The Poisson distribution, in which This represents the average number of active users. A packet is generated immediately upon user activation, ready for transmission. Assume the duration of each packet is the same for all users, denoted as T. packet The number of relays is assumed to be... ( The number of users is ( Furthermore, this invention assumes that all relays operate using the Amplify Forward (AF) protocol. Each user-generated packet can be sent directly to the satellite or via a relay.
[0076] Users can transmit data to the satellite via a direct link, and the received signal is represented as follows:
[0077]
[0078] in Indicates user The transmission power, Represented as user Channel to satellite , This indicates large-scale decay. This indicates small-size fading. This represents Gaussian white noise with a mean of 0 and a variance of 1.
[0079] When a user transmits data to a satellite via a relay link, the received signal is represented as follows:
[0080]
[0081] in It is the power amplification factor. User To relay The channel, , This indicates large-scale decay. This indicates small-size fading. For relay Channel to satellite and It is Gaussian white noise with a mean of 0 and a variance of 1.
[0082] In an embodiment of the present invention, the optimal relay allocation in step two is as follows: In the S-IIoT scenario described in step one, since the satellite is constantly moving, each user can choose different cooperative relays when the satellite moves to different locations. Therefore, the present invention should design an optimal relay cooperative transmission scheme with time-varying characteristics. For K users and I relays within the same beam, using... Indicates the first The user selected the first One relay, otherwise This invention determines the optimal relay allocation by optimizing the maximum communication capacity, which can be expressed by the following formula:
[0083]
[0084] in This represents the channel capacity of user k when the satellite moves to a specific location t0. This refers to the instantaneous received signal-to-noise ratio.
[0085] The optimization problem described above can be conceived as follows:
[0086]
[0087] This optimization problem is a 0-1 programming problem. Since the number of users accessing the system at a certain time is not large, the problem can be solved by exhaustive search.
[0088] In an embodiment of the present invention, the specific content of the OCARA protocol in step three is as follows:
[0089] After determining the optimal relay, each user will send packets to the satellite using the OCARA protocol, which can be divided into the OCARA modulator and the OCARA demodulator.
[0090] For the OCARA modulator, the specific operation can be summarized in the following two steps:
[0091] (1) The valid information sent by the device is encoded and modulated to form a packet. Then, a pre-pilot sequence is randomly selected from the local pre-pilot sequence pool and appended to the beginning of the packet for packet acquisition and channel estimation.
[0092] (2) For each generated packet in (1), two identical packet copies are made. One packet copy is sent directly to the satellite via a direct link at the start of the virtual frame, and the other packet copy is delayed by a random amount of time during the duration of the virtual frame. It is sent to the satellite via a relay link. Figure 3 This demonstrates the process of packets being transmitted via the OCARA protocol.
[0093] from Figure 3 It can be seen that the interference between packets is partial. The presence of the capture effect makes it possible for packets to be decoded, especially for packets sent via relay links, because they have greater transmission power.
[0094] Furthermore, the OCARA modulation process shows that each user can send two copies of their packets to the satellite at different times. Regardless of which packet copy is successfully decoded, the user can be considered to have been successfully transmitted. This enables packet diversity transmission, thereby reducing the probability of packet collisions.
[0095] For the OCARA protocol demodulator, the specific process is as follows:
[0096] Due to the asynchronous nature of the OCARA protocol, sliding detection with a capture effect is used to iteratively recover packets within the detection window. In sliding detection, packets can be decoded within the detection window using the capture effect according to the detection order, and interference cancellation (IC) techniques are used to eliminate interference from decoded packets and their copies. These operations are performed iteratively until the maximum number of iterations is reached. Then, the detection window is adjusted according to the step size. Slide to the next position for the next round of detection. The specific demodulation operation is as follows:
[0097] (1) For the received signal within the detection window, this invention employs frequency conversion, filtering, and sampling operations. The processed signal samples are then placed in a memory spanning multiple frames. When the detection window moves in steps... When sliding to the next detection position, the memory span also... Move to the right. At the same time, the leftmost part of the original memory span will be removed, and the empty rightmost part will be filled with the new incoming signal sample.
[0098] (2) Within the current detection window, packet preamble detection is first performed across the entire memory span using correlation calculations with the local preamble sequence. Channel estimation and packet detection are performed each time a preamble is successfully detected. Packet detection based on the capture effect is as follows. For any packet j, its received signal-to-interference-plus-noise ratio (SINR) can be written as:
[0099]
[0100] in This represents the received power of the j-th packet. The interference ratio of the nth group. Let be the received power of the nth interfering packet, and N be the number of interfering packets. The probability that packet j is successfully decoded is:
[0101]
[0102] Where r represents the capture threshold, when If the result is positive, it means that group j can be successfully decoded. Otherwise, decoding fails and another group needs to be searched and decoded using capture-effect-based group detection.
[0103] (3) After packet j is successfully decoded, IC processing is performed to remove interference from itself and its copies. The specific interference removal operation is as follows: First, a preamble search is performed to determine the location of the copy and estimate its channel. Then, the decoded payload bits are re-encoded and modulated to regenerate symbols. The regenerated symbols and preamble are combined with the estimated channel to reconstruct packet j and its copies. Finally, signal samples of packet j and its copies are subtracted from the memory span to eliminate interference from itself and its copies.
[0104] (4) Iteratively execute steps 2) and 3) within the current detection window until the maximum number of iterations is reached. Then, the detection window will be incremented by a step size. Slide to the next detection position and perform steps 1), 2), and 3) in the new detection window. Figure 4 The sliding detection process in the OCARA demodulation process was characterized.
[0105] The optimal cooperative asynchronous random access system provided in this embodiment of the invention includes:
[0106] The cooperative transmission module is used to implement power domain non-orthogonal multiple access transmission using a relay cooperative transmission scheme.
[0107] The problem-building module is used to determine the optimal cooperative relay for each user when the satellite is moving. It constructs an optimization problem based on the changing relay link capacity and obtains the optimal solution.
[0108] The results output module is used to jointly design the packet transmission mode of the asynchronous random access transmitter and the sliding multi-user detection scheme of the receiver based on the optimal cooperative transmission scheme.
[0109] This application example illustrates the application of the optimal cooperative asynchronous random access method proposed in this invention to satellite industrial IoT, which can solve the limitations of low power consumption and low cost of large-scale satellite IoT nodes. By utilizing relay cooperative transmission, the uplink access performance of the system can be improved, meeting the access requirements of large-scale satellite industrial IoT.
[0110] Simulation Verification: To verify the performance of the proposed method, its performance is evaluated using four metrics: channel capacity, normalized throughput, packet loss rate, and normalized sum rate. The entire simulation was performed on the MATLAB platform. In this simulation, it is assumed that the satellite orbital altitude is 750 km and it operates in the S-band. Relays and users are uniformly distributed within a single beam of the satellite. The coverage radius of the relay is assumed to be 5 km, and user data packets are randomly generated according to a Poisson distribution. The channel from the user to the relay follows a Rayleigh distribution, and the channel from the relay to the satellite follows a Ricean distribution. The path loss models are expressed as follows: and To ensure fairness, all users and relays are assumed to use the same transmit power. Other key simulation parameters are shown in Table 1.
[0111] Table 1 Simulation Parameters
[0112] parameter Value Group size 100 bits Frame interval 100 ms Grouping interval 1 ms Number of relays 5 System bandwidth 10 MHz Noise power spectral density -174 dBm / Hz Signal-to-interference-plus-noise ratio threshold 3 dB User transmit power 10 dB Maximum number of iterations for interference elimination 15 Detection window length 3 sliding step 0.3 FEC coding rate 1 / 2 Modulation order 4
[0113] To evaluate the performance of the proposed optimal cooperative transmission scheme Figure 5The proposed optimal cooperative transmission scheme demonstrates the sum of its channel capacities and compares them with fixed and random cooperative schemes. Two benchmarks are used for comparison: 1) Fixed cooperation: Users select a fixed relay for cooperative transmission, and the selected relay does not change with satellite movement; 2) Random cooperation: Users randomly select a relay for cooperative transmission, and the selected relay changes randomly with satellite movement. The proposed optimal cooperative transmission scheme always provides an optimal relay for each user when the satellite moves. The relay transmit power is set to 15, 20, and 25 dB. As can be seen from this figure, the sum of the channel capacities of the two benchmark schemes is essentially the same, and far less than that of the proposed optimal cooperative transmission scheme. Furthermore, as the relay transmit power increases, the sum of the channel capacities of the proposed optimal cooperative scheme gradually increases. This can be attributed to the fact that higher relay transmit power provides better cooperative transmission quality, resulting in greater channel capacity.
[0114] To improve the performance of the OCARA protocol proposed by the research institute, Figure 6 The graph shows the relationship between normalized throughput and average traffic load for different protocols. The standard CRDSA, IRSA, ACRDA, and ACRDA-NOMA protocols are used as benchmarks. For fairness, all schemes were simulated under the same system parameters. Against these benchmarks, the proposed OCARA protocol improves system performance through cooperative relay. The transmit power for cooperative relay is set to 15, 20, and 25 dB. As can be seen from the graph, the peak normalized throughput of CRDSA, IRSA, ACRDA, and ACRDA-NOMA is approximately 0.51, 0.59, 0.66, and 0.76 bits / symbol, respectively. The peak normalized throughput of OCARA with transmit powers of 15, 20, and 25 dB is 0.99, 1.21, and 1.35 bits / symbol, respectively. The peak normalized throughput of OCARA gradually increases with increasing relay transmit power. Clearly, the peak normalized throughput of OCARA is significantly greater than these benchmark schemes. Furthermore, OCARA's peak throughput at a transmit power of 25dB is 77.6% higher than ACRDA-NOMA. This demonstrates that the proposed OCARA protocol achieves better performance compared to existing solutions.
[0115] Figure 7The graph further illustrates the relationship between packet loss rate (PLR) and average traffic load for different protocols. As can be seen from the graph, for a target PLR of 2 × 10⁻², the average traffic load for CRDSA, IRSA, ACRDA, and ACRDA-NOMA can reach approximately 0.38, 0.61, 0.60, and 0.61 bits / symbol, respectively. OCARA, with transmit powers of 15, 20, and 25 dB, achieves 1.00, 1.07, and 1.20 bits / symbol, respectively. Compared to the relatively better ACRDA-NOMA, OCARA, with a transmit power of 25 dB, achieves approximately twice the performance in terms of target PLR. Clearly, OCARA exhibits better PLR performance compared to existing benchmark solutions.
[0116] To comprehensively evaluate the performance of the OCARA protocol, the normalization and rate of the protocol were further studied from the perspective of the physical layer, such as... Figure 8 As shown in the figure, two relatively good benchmark schemes are used for comparison. It can be seen from the figure that, in terms of normalized sum rate, the OCARA protocol significantly outperforms the ACRDA and ACRDA-NOMA protocols. Even more significantly, the peak normalized sum rate of OCARA at a transmit power of 25dB is approximately twice that of ACRDA-NOMA. Unlike normalized throughput, normalized sum rate reflects the performance improvement of cooperative relays at different transmit powers. Figure 7 It can be further observed that in the linear region (i.e., average traffic load < 1), the normalized sum rate increases slightly with increasing transmit power. This can be explained by the fact that the greater the transmit power, the greater the channel capacity of the relay link, thus resulting in a significant increase in the normalized sum rate.
[0117] It should be noted that embodiments of the present invention can be implemented in hardware, software, or a combination of both. The hardware portion can be implemented using dedicated logic; the software portion can be stored in memory and executed by a suitable instruction execution system, such as a microprocessor or dedicated-design hardware. Those skilled in the art will understand that the above-described devices and methods can be implemented using computer-executable instructions and / or included in processor control code, for example, such code provided on a carrier medium such as a disk, CD, or DVD-ROM, a programmable memory such as read-only memory (firmware), or a data carrier such as an optical or electronic signal carrier. The devices and modules of the present invention can be implemented by hardware circuitry such as very large-scale integrated circuits or gate arrays, semiconductors such as logic chips, transistors, or programmable hardware devices such as field-programmable gate arrays, programmable logic devices, etc., or by software executed by various types of processors, or by a combination of the above-described hardware circuitry and software, such as firmware.
[0118] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any modifications, equivalent substitutions, and improvements made by those skilled in the art within the scope of the technology disclosed in the present invention, and within the spirit and principles of the present invention, should be covered within the scope of protection of the present invention.
Claims
1. An optimal cooperative asynchronous random access method, characterized in that, The optimal cooperative asynchronous random access method uses a relay cooperative transmission scheme to achieve power domain non-orthogonal multiple access transmission; it determines the optimal cooperative relay for each user when the satellite is moving, constructs an optimization problem based on the changing relay link capacity, and obtains the optimal solution; based on the optimal cooperative transmission scheme, it jointly designs the packet transmission mode of the asynchronous random access transmitter and the sliding multi-user detection scheme of the receiver. The optimal cooperative asynchronous random access method includes the following steps: Step 1: Construct an optimal cooperative asynchronous network model with relay-based cooperative transmission; Step two: Assign the optimal relay to the user based on the satellite's location; Step 3: Implement large-scale S-IIoT access satellites based on the optimal relay and OCARA protocol; The optimal relay allocation in step two is as follows: In the S-IIoT scenario of step one, when the satellite moves to different locations, each user selects a different cooperative relay. An optimal relay cooperative transmission scheme with time-varying characteristics is designed. For K users and I relays within the same beam, using... Indicates the first The user selected the first One relay, otherwise The optimal relay allocation is determined by optimizing the maximum communication capacity, which is expressed by the following formula: , in This represents the channel capacity of user k when the satellite moves to a specific location t0. For instantaneous received signal-to-noise ratio; The optimization problem is structured as follows: , The optimization problem is a 0-1 programming problem. Since the number of users accessing the system at a certain time is not large, an exhaustive search method is used to solve the problem. The specific content of the OCARA protocol in step three is as follows: After determining the optimal relay, each user will send packets to the satellite by relying on the OCARA protocol. The OCARA protocol is divided into the OCARA modulator and the OCARA demodulator. For the OCARA modulator, the specific operation can be summarized in the following two steps: (1) The valid information sent by the device is encoded and modulated to form a packet. Then, a preamble sequence is randomly selected from the local preamble sequence pool and appended to the beginning of the packet for packet acquisition and channel estimation. (2) For each generated packet in (1), two identical packet copies are made. One packet copy is sent directly to the satellite via a direct link at the start of the virtual frame, and the other packet copy is delayed by a random amount of time during the duration of the virtual frame. Transmitted to satellite via relay link; For the OCARA protocol demodulator, the specific process is as follows: Due to the asynchronous nature of the OCARA protocol, in sliding detection, packets are decoded within the detection window according to the detection order, utilizing the capture effect. Interference cancellation IC technology is then used to eliminate interference from decoded packets and their copies. This operation is performed iteratively until the maximum number of iterations is reached. Then, the detection window is moved according to the step size... Slide to the next position for the next round of testing.
2. The optimal cooperative asynchronous random access method as described in claim 1, characterized in that, The optimal cooperative asynchronous network model with relay cooperative transmission in step one includes: For a low-orbit S-IIoT scenario with multiple cooperative relays, packets sent through relay links are transmitted through relay links. During data transmission, the satellite, device, and relay are equipped with a single antenna and access the satellite through a shared channel. The device transmits data to the satellite through direct links and relay links, and sends the collected data to the ground gateway without errors. The ground gateway is responsible for decoding the data.
3. The optimal cooperative asynchronous random access method as described in claim 1, characterized in that, The first step, the optimal cooperative asynchronous network model with relay-based cooperative transmission, further includes: In the OCARA protocol, the boundaries of time slots and frames are marked only at the local transmitter and are completely asynchronous between transmitters. The concept of a virtual frame (VF) refers to a time slot frame unique to each transmitter. In OCARA, for all transmitters, each virtual frame consists of N... slots It consists of 1 time slot, each time slot lasting for T seconds. slot The duration of the entire frame is T. frame = N slots ·T slot The boundaries of frames and time slots are defined relative to the receiver's time axis. All packets can arrive within the time slot boundaries, and all identical packets arrive in the same OCARA frame. Each active user sends packets at any time within their local VF, and the number of active users follows [the rule]. The Poisson distribution, in which This represents the average number of active users. A packet is generated immediately upon user activation, ready for transmission. The duration of each packet is the same for all users, denoted as T. packet The number of relays is assumed to be ( The number of users is ( Furthermore, all relays operate using the Amplify Forward (AF) protocol, where each user-generated packet is sent directly to the satellite or via a relay. Users transmit data to the satellite via a direct link, and the received signal is represented as follows: , in Indicates user The transmission power, Represented as user Channel to satellite , This indicates large-scale decay. This indicates small-size fading. This represents Gaussian white noise with a mean of 0 and a variance of 1. When a user transmits data to a satellite via a relay link, the received signal is represented as follows: , in It is the power amplification factor. User To relay The channel, , This indicates large-scale decay. This indicates small-size fading. For relay Channel to satellite and It is Gaussian white noise with a mean of 0 and a variance of 1.
4. The optimal cooperative asynchronous random access method as described in claim 1, characterized in that, The specific demodulation operation is as follows: (1) For the received signal within the detection window, frequency conversion, filtering, and sampling operations are performed. Then, the processed signal samples are placed in the memory spanning the frames. When the detection window moves in steps... When sliding to the next detection position, the memory span also... Move to the right; at the same time, the leftmost part of the original memory span will be removed, and the empty rightmost part will be filled with the new incoming signal sample; (2) Within the current detection window, preamble detection is first performed across the entire memory span using correlation calculations with the local preamble sequence. Each time a preamble is successfully detected, channel estimation and packet detection are performed. The packet detection based on the capture effect is as follows: for any packet j, its received signal-to-interference-plus-noise ratio (SINR) is written as: , in This represents the received power of the j-th packet. The interference ratio of the nth group. Let N be the received power of the nth interfering packet, N be the number of interfering packets, and the probability that packet j is successfully decoded is: , Where r represents the capture threshold; when If the value is 0, it means that group j can be successfully decoded; otherwise, decoding fails and another group needs to be searched and decoding is attempted using group detection based on the capture effect. (3) After packet j is successfully decoded, IC processing will be performed to remove interference from itself and its copy. The specific interference removal operation is as follows: First, a preamble search is performed to determine the location of the copy and estimate its channel. Then, the decoded payload bits are re-encoded and modulated to regenerate symbols. The regenerated symbols and preamble are combined with the estimated channel to reconstruct packet j and its copy. Finally, the signal samples of packet j and its copy are subtracted from the memory span to eliminate interference from itself and its copy. (4) Iteratively execute steps 2) and 3) within the current detection window until the maximum number of iterations is reached. Then, the detection window will be incremented by a step size. Slide to the next detection position and perform steps 1), 2), and 3 in the new detection window.
5. A computer device, characterized in that, The computer device includes a memory and a processor. The memory stores a computer program, which, when executed by the processor, causes the processor to perform the optimal cooperative asynchronous random access method according to any one of claims 1 to 4.
6. A computer-readable storage medium storing a computer program, which, when executed by a processor, causes the processor to perform the optimal cooperative asynchronous random access method according to any one of claims 1 to 4.
7. An optimal cooperative asynchronous random access system based on the optimal cooperative asynchronous random access method according to any one of claims 1 to 4, characterized in that, The optimal cooperative asynchronous random access system includes: The cooperative transmission module is used to implement power domain non-orthogonal multiple access transmission using a relay cooperative transmission scheme. The problem-building module is used to determine the optimal cooperative relay for each user when the satellite is moving. It constructs an optimization problem based on the changing relay link capacity and obtains the optimal solution. The results output module is used to jointly design the packet transmission mode of the asynchronous random access transmitter and the sliding multi-user detection scheme of the receiver based on the optimal cooperative transmission scheme.
