Joint backoff method of low earth orbit satellite based on information freshness and NE balance
By adopting a joint backoff method of information freshness and Nash equilibrium in low-orbit satellite Internet of Things, the problem of low information timeliness and access throughput when equipment observes the physical characteristics of the environment is solved, and the system throughput and information timeliness are improved.
Patent Information
- Application Number
- CN202411091393.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-09
- Publication Date
- 2024-11-19
AI Technical Summary
When devices in satellite IoT are used to observe the physical characteristics of the environment, the information timeliness and access throughput are low, resulting in the impact of the accuracy of data transmission and system performance.
Using a joint backoff method based on information freshness and Nash equilibrium of low-orbit satellites, the coverage area is regionalized through the interference threshold of the spread spectrum factor, and the information freshness is analyzed, and the AoI function of the data packet is calculated using the inaccurate discrete Markov chain under the finite state. , and design a return function based on the probability of successful transmission, find a closed form of hybrid strategy Nash equilibrium to control node access and transmission.
It improves system throughput, reduces average PAoI and AoI, and improves information timeliness and access throughput.
Smart Images

Figure CN118984183A_ABST
Abstract
Description
Technical Field
[0001] The invention belongs to the technical field of satellite communications and relates to a joint backoff method for a low-orbit satellite based on information freshness and NE balance. Background Art
[0002] Nowadays, the Internet of Things (IoT), driven by various sensing and monitoring applications such as smart cities and smart industries, has stimulated research interests in massive machine type communication (mMTC) systems. Satellite Internet of Things (S-IoT) is an IoT application based on satellite communication technology. Satellite networks have the characteristics of wide coverage and are not restricted by geographical environments. They can better meet the needs of IoT applications in remote and special areas, and are of great significance for realizing device interconnection and data transmission on a global scale. Through the deep integration of IoT technology and satellite communication, satellite IoT has been widely used in various fields, such as remote monitoring, agricultural IoT, environmental monitoring, transportation logistics, emergency rescue, etc. Typically, S-IoT devices are used to observe the physical characteristics of the environment, such as temperature, pollution level, and speed. The sensor data collected during the physical characteristic observation will be transmitted to the information fusion node through the communication network to extract meaningful information, such as control decisions and remote source reconstruction to predict the information state evolution in the S-IoT scheme. Obviously, the accuracy of such output decisions has a significant impact on the performance of various S-IoT applications, and largely depends on the freshness of the S-IoT device data measurement at the information fusion node. Age of Information (AoI) is a relevant timeliness metric to measure the freshness of data during random access, which is a time function of the measurement age of the last successful delivery. It is of great significance to study AoI to predict the evolution of information state in S-IoT schemes. Summary of the invention
[0003] In view of this, the object of the present invention is to provide a joint backoff method for low-orbit satellites based on information freshness and NE balance, so as to improve the system throughput under the satellite Internet of Things, reduce the normalized delay, and reduce the average PAoI and AoI.
[0004] In order to achieve the above object, the present invention provides the following technical solutions:
[0005] A joint backoff method for a low-orbit satellite based on information freshness and NE balance comprises the following steps:
[0006] S1: The satellite coverage area is divided into different levels through the interference threshold of the spreading factor;
[0007] S2: Analyze the information freshness and peak information freshness under the satellite Internet of Things to obtain the closed expression of PAoI;
[0008] S3: Use optimization methods to find the closed form mixed strategy Nash equilibrium NE, which can effectively control the access of nodes;
[0009] S4: The transmission is completed by combining the information freshness and Nash equilibrium backoff algorithm.
[0010] Further, step S1 specifically includes the following steps:
[0011] S11: In the satellite coverage area, the coverage area is divided into two parts according to the interference of the spreading factor in the LoRa system, namely the receiving area and the non-receiving area;
[0012] S12: According to the threshold value obtained through experiments in the case of LoRa-L, the data packets exceeding the interference threshold value are discarded.
[0013] Further, step S2 specifically includes the following steps:
[0014] S21: The satellite network stores the relevant information of the data packet during transmission;
[0015] S22: Calculate the relevant information using the finite state irreducible discrete Markov chain DTMC, and obtain the AoI function Δ(t) and average of the data packet
[0016] Further, the information calculation of the irreducible discrete Markov chain under the finite state in step S22 includes the following steps:
[0017] S221: According to in is the expected time between two successful transmissions of a node, is the expected system time of the packet, Calculated as:
[0018]
[0019] Where H is A matrix that increases by the number of nodes, is the probability of successful transmission of node 1 when the system is in state ((1,σ1); S2), where 1 in (1,σ1) means that the node has a data packet, and σ1 represents the backoff phase; S2 represents the state of node 2, and T represents the transposition; express;
[0020] Calculated as:
[0021]
[0022] where e nis the probability of successful transmission in the nth time slot after the data packet arrives at the node.
[0023] Further, n It is expressed as:
[0024]
[0025] Where W n is the probability that the system time of a typical data packet exceeds n time slots, which is derived from the recursive formula W n =T W W n-1 Given; T W is the probability that a typical packet is neither successfully sent nor occupied by a new data packet in a time slot.
[0026] Further, step S3 specifically includes the following steps:
[0027] S31: Define the access strategy of satellite nodes using the slotted ALOHA game model and design a profit function based on the probability of successful transmission;
[0028] S32: Use optimization methods to find the closed form mixed strategy Nash equilibrium NE and obtain the optimal transmission probability a * .
[0029] Further, the profit function designed based on the probability of successful transmission in step S31 includes:
[0030] S311: The profit function is set as:
[0031]
[0032] in represents the strategy of node k, expressed as T * Indicates transmission, W * Indicates waiting; represents the strategies of other nodes except node k; is the reward function, is the penalty function;
[0033] S312: The reward function is defined as:
[0034]
[0035] Where Q represents the reward for successful transmission, Q>0, a represents the transmission probability of the node, It represents the probability of successful transmission of the data packet of node k. If the action of k is to wait, the reward is 0.
[0036] Further, step S4 specifically includes the following steps:
[0037] S41: Find the strategy set σ for each node through Nash equilibrium in each random access frame * ;
[0038] S42: Generate a random backoff number η∈[0,1];
[0039] S43: The backoff number η is compared with the optimal transmission probability a in the optimal strategy set. * For comparison, if η≤a * The final transmission probability is generated according to the obtained AoI function And follow Otherwise, the data packet cannot be transmitted.
[0040] The beneficial effects of the present invention are as follows: the present invention aims at the problem that the physical characteristics of the environment observed by the device in the satellite Internet of Things need to consider the timeliness of information and the low access throughput, and designs a joint backoff method for low-orbit satellites based on information freshness and NE balance. Through the precise analysis of the age of information in the satellite Internet of Things and the mixed strategy Nash equilibrium of satellite access, the throughput is improved while the average PAoI and AoI are reduced.
[0041] Other advantages, objectives and features of the present invention will be described in the following description to some extent, and to some extent, will be obvious to those skilled in the art based on the following examination and study, or can be taught from the practice of the present invention. The objectives and other advantages of the present invention can be realized and obtained through the following description. BRIEF DESCRIPTION OF THE DRAWINGS
[0042] In order to make the purpose, technical solutions and advantages of the present invention more clear, the present invention will be described in detail below in conjunction with the accompanying drawings, wherein:
[0043] Figure 1 It is a schematic diagram of the process of the present invention;
[0044] Figure 2 It is a schematic diagram of the joint backoff method model based on information freshness and NE balance for low-orbit satellites;
[0045] Figure 3 This is a schematic diagram showing the coverage range. DETAILED DESCRIPTION
[0046] The following describes the embodiments of the present invention by specific examples, and those skilled in the art can easily understand other advantages and effects of the present invention from the contents disclosed in this specification. The present invention can also be implemented or applied through other different specific embodiments, and the details in this specification can also be modified or changed in various ways based on different viewpoints and applications without departing from the spirit of the present invention. It should be noted that the illustrations provided in the following embodiments only illustrate the basic concept of the present invention in a schematic manner, and the following embodiments and features in the embodiments can be combined with each other without conflict.
[0047] It should be noted that the illustrations provided in the following embodiments are only schematic illustrations of the basic concept of the present invention, and thus the drawings only show components related to the present invention rather than being drawn according to the number, shape and size of components in actual implementation. In actual implementation, the type, quantity and proportion of each component may be changed arbitrarily, and the component layout may also be more complicated.
[0048] In the following description, numerous details are discussed to provide a more thorough explanation of the embodiments of the present invention. However, it is obvious to those skilled in the art that the embodiments of the present invention can be implemented without these specific details. In other embodiments, well-known structures and devices are shown in the form of block diagrams rather than in detail to avoid making the embodiments of the present invention difficult to understand.
[0049] like Figures 1 to 3 As shown, the present invention provides a low-orbit satellite communication system inter-beam pre-switching method, comprising:
[0050] Step 1: Differentiate satellite coverage, including:
[0051] 11) In the satellite coverage area, the coverage area is divided into two parts according to the interference of the spreading factor in the LoRa system, as shown in the figure, namely the receiving area and the non-receiving area. Only the data packets sent by users in the receiving area can be correctly received;
[0052] 12) According to the threshold value obtained through experiments in the case of LoRa-L, the data packets exceeding the interference threshold are discarded. The current threshold value is 25db.
[0053] Step 2: Satellite network terminal AoI calculation, specifically including:
[0054] 21) The satellite network stores relevant information about the data packet during transmission, such as the time when the data packet was received, the time when the transmission was successful, etc. The specific information includes:
[0055] 211) The time T when the node receives the i-th data packet i .
[0056] 212) The time H between two successful transmissions of a node i .
[0057] 213) System time Y of the ith data packet i , which is the time of its successful transmission minus the time of its packet generation.
[0058] 22) Use the finite state irreducible discrete Markov chain (DTMC) to calculate the above related information and obtain the AoI function Δ(t) and average of the data packet The information calculation of the irreducible discrete Markov chain in a finite state includes the following steps:
[0059] 221) Due to in is the expected time between two successful transmissions of a node, is the expected system time of the packet. It can be calculated as:
[0060]
[0061] Where H is A matrix that increases by the number of nodes, It is the probability of successful transmission of node 1 when the system is in state ((1,σ1); S2), where 1 in (1,σ1) represents that the node has a data packet, and σ1 represents the backoff phase.
[0062] 222) It can be calculated as:
[0063]
[0064] where e n is the probability of successful transmission in the nth time slot after the data packet arrives at the node. n Then:
[0065]
[0066] Where W n is the probability that the system time of a typical data packet exceeds n time slots, which can be obtained by the recursive formula W n =T W W n-1 Given. W is the probability that a typical packet is neither successfully sent nor occupied by a new data packet in a time slot.
[0067] Step 3: satellite access strategy NE balancing, including:
[0068] 31) Use the slotted ALOHA game model to define the access strategy of satellite nodes and design a profit function based on the probability of successful transmission, including:
[0069] 311) The profit function is set as:
[0070]
[0071] in represents the strategy of node k, expressed as T * Indicates transmission, W * Indicates waiting. is the reward function, is the penalty function;
[0072] 312) The reward function is defined as;
[0073]
[0074] Where Q (Q>0) represents the reward for successful transmission, a represents the transmission probability of the node, It represents the probability of successful transmission of the data packet of node k. If the action of k is to wait, the reward is 0.
[0075] 32) Use optimization methods to find the closed form mixed strategy Nash equilibrium (NE) and obtain the optimal transmission probability a * , and generate a random number, and then compare it with the optimal transmission probability to decide whether it can be sent.
[0076] Step 4, backoff phase execution, includes:
[0077] 1) In each random access frame, find the strategy set σ for each node through Nash equilibrium * ;
[0078] 2) Generate a random backoff number η∈[0,1];
[0079] 3) The backoff number η is compared with the optimal transmission probability a in the optimal strategy set * For comparison, if η≤a * Then the final transmission probability is generated according to the obtained AoI function:
[0080]
[0081] Where μ and η are backoff parameters, Δ(t) is the AoI function, and finally according to Otherwise, the data packet cannot be transmitted.
[0082] In the above embodiments, the description's reference to "this embodiment" indicates that a particular feature, structure, or characteristic described in conjunction with the embodiment is included in at least some embodiments, but not necessarily all embodiments. Multiple occurrences of "this embodiment" do not necessarily all refer to the same embodiment.
[0083] In the above-described embodiments, although the invention has been described in conjunction with specific embodiments of the invention, many substitutions, modifications, and variations of these embodiments will be apparent to those of ordinary skill in the art based on the foregoing description. For example, other storage structures (e.g., dynamic RAM (DRAM)) may use the embodiments discussed. Embodiments of the invention are intended to encompass all such substitutions, modifications, and variations that fall within the broad scope of the appended claims.
[0084] This embodiment further provides a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, any one of the methods in this embodiment is implemented.
[0085] This embodiment also provides an electronic terminal, including: a processor and a memory;
[0086] The memory is used to store a computer program, and the processor is used to execute the computer program stored in the memory, so that the terminal executes any one of the methods in this embodiment.
[0087] The computer-readable storage medium in this embodiment can be understood by ordinary technicians in this field: all or part of the steps of implementing the above-mentioned method embodiments can be completed by hardware related to the computer program. The aforementioned computer program can be stored in a computer-readable storage medium. When the program is executed, the steps of the above-mentioned method embodiments are executed; and the aforementioned storage medium includes: ROM, RAM, magnetic disk or optical disk and other media that can store program codes.
[0088] The electronic terminal provided in this embodiment includes a processor, a memory, a transceiver and a communication interface. The memory and the communication interface are connected to the processor and the transceiver and complete communication with each other. The memory is used to store computer programs, the communication interface is used to communicate, and the processor and the transceiver are used to run computer programs so that the electronic terminal executes each step of the above method.
[0089] In this embodiment, the memory may include a random access memory (RAM), and may also include a non-volatile memory (non-volatile memory), such as at least one disk memory.
[0090] The above-mentioned processor can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.
[0091] The present invention can be used in many general or special computing system environments or configurations, such as personal computers, server computers, handheld or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set-top boxes, programmable consumer electronic devices, network PCs, minicomputers, mainframe computers, distributed computing environments including any of the above systems or devices, and the like.
[0092] The present invention may be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. The present invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules may be located in local and remote computer storage media, including storage devices.
[0093] Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention rather than to limit it. Although the present invention has been described in detail with reference to the preferred embodiments, those skilled in the art should understand that the technical solution of the present invention can be modified or replaced by equivalents without departing from the purpose and scope of the technical solution, which should be included in the scope of the claims of the present invention.
Claims
1. A joint backoff method for low-orbit satellites based on information freshness and NE balance. Features: The following steps are involved: S1: The satellite coverage area is divided into different levels through the interference threshold of the spreading factor; S2: Analyze the information freshness and peak information freshness under the satellite Internet of Things to obtain the closed expression of PAoI; S3: Use optimization methods to find the closed form mixed strategy Nash equilibrium NE, which can effectively control the access of nodes; S4: The transmission is completed by combining the information freshness and Nash equilibrium backoff algorithm.
2. The joint backoff method for low-orbit satellites based on information freshness and NE balance according to claim 1, Features: Step S1 specifically includes the following steps: S11: In the satellite coverage area, the coverage area is divided into two parts according to the interference of the spreading factor in the LoRa system, namely the receiving area and the non-receiving area; S12: According to the threshold value obtained through experiments in the case of LoRa-L, the data packets exceeding the interference threshold value are discarded.
3. The joint backoff method for low-orbit satellites based on information freshness and NE balance according to claim 1, Features: Step S2 includes the following steps: S21: The satellite network stores the relevant information of the data packet during transmission; S22: Calculate the relevant information using the finite state irreducible discrete Markov chain DTMC, and obtain the AoI function Δ(t) and average of the data packet 4. The joint backoff method for low-orbit satellites based on information freshness and NE balance according to claim 3, Features: The information calculation of the irreducible discrete Markov chain in the finite state in step S22 includes the following steps: S221: According to in is the expected time between two successful transmissions of a node, is the expected system time of the packet, Calculated as: Where H is A matrix that increases by the number of nodes, The system is in the state ((1,σ 1 );S 2 ) when node 1 successfully transmits, (1,σ 1 ) indicates that the node has a data packet, σ 1 Represents the retreat phase; S 2 represents the state of node 2, and T represents transposition; represents the steady-state distribution vector; Calculated as: where e n is the probability of successful transmission in the nth time slot after the data packet arrives at the node.
5. The joint backoff method for low-orbit satellites based on information freshness and NE balance according to claim 4, Features: e n It is expressed as: Where W n is the probability that the system time of a typical data packet exceeds n time slots, which is derived from the recursive formula W n =T W W n-1 Given; T W is the probability that a typical packet is neither successfully sent nor occupied by a new data packet in a time slot.
6. The joint backoff method for low-orbit satellite based on information freshness and NE balance according to claim 1, Features: Step S3 includes the following steps: S31: Define the access strategy of satellite nodes using the slotted ALOHA game model and design a profit function based on the probability of successful transmission; S32: Use optimization methods to find the closed form mixed strategy Nash equilibrium NE and obtain the optimal transmission probability a * .
7. The joint backoff method for low-orbit satellites based on information freshness and NE balance according to claim 6, Features: The profit function designed based on the probability of successful transmission in step S31 includes: S311: The profit function is set as: in represents the strategy of node k, expressed as T * Indicates transmission, W * Indicates waiting; represents the strategies of other nodes except node k; is the reward function, is the penalty function; S312: The reward function is defined as: Where Q represents the reward for successful transmission, Q>0, a represents the transmission probability of the node, It represents the probability of successful transmission of the data packet of node k. If the action of k is to wait, the reward is 0.
8. The joint backoff method for low-orbit satellite based on information freshness and NE balance according to claim 1, Features: Step S4 includes the following steps: S41: Find the strategy set σ for each node through Nash equilibrium in each random access frame * ; S42: Generate a random backoff number η∈[0,1]; S43: The backoff number η is compared with the optimal transmission probability a in the optimal strategy set. * For comparison, if η≤a * The final transmission probability is generated according to the obtained AoI function And follow Otherwise, the data packet cannot be transmitted.
