Method and system for measuring timeliness of decision information in CSMA / CA non-saturated networks

By constructing a unsaturated update decision system and Markov transfer model based on the CSMA/CA protocol, the lack of decision information timeliness analysis in the CSMA/CA network is solved, and the timeliness of decision information timeliness of CSMA/CA unsaturated network is realized. Quantification and analysis improve the system's timeliness and resource utilization efficiency.

CN118741744BActive Publication Date: 2024-11-08WUHAN UNIV
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411227100.8
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-09-03
Publication Date
2024-11-08
Estimated Expiration
2044-09-03

AI Technical Summary

Technical Problem

In wireless sensor networks, the timeliness analysis of decision information under the CSMA/CA protocol is missing, resulting in waste of information and inaccuracy of decision-making moments. Especially when IoT devices are connected to a large number of public channels, traditional multiple access policies cannot maintain synchronization , affects the operation of the system.

Method used

Build a non-saturation update decision system based on the CSMA/CA protocol, calculate the decoding error probability of data packets through the finite code length theory, and establish an equivalent Markov transfer model to derive the collision probability and transmission probability of data packets, and then quantify the decision Timeliness of information.

Benefits of technology

It realizes the effective representation of the timeliness of decision-making information of CSMA/CA unsaturated network, provides a closed form expression of the average decision-making time age, improves the system's timeliness analysis capabilities, and ensures the timeliness of information and the effective utilization of resources.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118741744B_ABST
    Figure CN118741744B_ABST
Patent Text Reader

Abstract

The present invention proposes a method for measuring the timeliness of decision information for CSMA / CA non-saturated networks, which mainly includes the following steps: first, construct a non-saturated update decision system based on the CSMA / CA protocol; then, calculate the decoding error probability of each transmission based on the finite code length theory; then, establish an equivalent Markov transition model and derive the collision probability and transmission probability of the data packet; finally, obtain the average decision time age of the update decision system based on the above derivation. While ensuring transmission reliability, the present invention can achieve high timeliness of decision information and is suitable for real-time decision-making scenarios.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of wireless communications, and in particular to a method and system for measuring the timeliness of decision information for a CSMA / CA non-saturated network. Background Art

[0002] With the rapid development of the Internet of Things, timely and reliable status updates are essential for effective remote monitoring. Information age is proposed to quantify the timeliness of these status updates. Information age is specifically defined as the time elapsed from the generation time of the most recently received data packet. However, in order to make judgments about system operation, in various IoT applications, data is usually processed once it is received. In such critical decision-making scenarios, the performance of the instantaneous information age is more important than the performance of the average information age when making decisions. Therefore, the decision moment age is introduced and developed to accurately quantify the timeliness of information in these critical decision periods.

[0003] Due to the scarcity of radio spectrum in wireless sensor networks, a large number of wireless IoT devices accessing the public channel at the same time may cause congestion. This will waste limited channel resources and receive outdated information. In addition, traditional multiple access strategies such as time division multiple access and frequency division multiple access often cannot maintain strict synchronization requirements because IoT devices often operate intermittently. Therefore, random multiple access strategies such as carrier sense collision avoidance multiple access (CSMA / CA) are more practical in wireless sensor networks. However, the analysis of the timeliness of decision information of CSMA / CA considering the impact of limited code length and practical retransmission strategy is still missing. Summary of the invention

[0004] The invention is to evaluate the timeliness of decision information in a CSMA / CA network, and provides a method for measuring the timeliness of decision information in a CSMA / CA non-saturated network.

[0005] In order to solve the above technical problems, the present invention provides the following technical solutions:

[0006] The method for measuring the timeliness of decision information for CSMA / CA non-saturated networks includes the following steps:

[0007] Step 1: Construct a non-saturated update decision system based on the CSMA / CA protocol;

[0008] Step 2: Calculate the decoding error probability of each transmission of the data packet based on the non-saturated update decision system in step 1 and the finite code length theory;

[0009] Step 3: Establish an equivalent Markov transition model and derive the collision probability and transmission probability of the data packet;

[0010] Step 4: Based on the collision probability and transmission probability of the data packets in step 3, the average decision time age of the update decision system is obtained to measure the timeliness of the decision information of the CSMA / CA non-saturated network.

[0011] Furthermore, the non-saturated update decision system in step 1 includes:

[0012] An independent source node, a destination node and a decision unit;

[0013] Each source node is equipped with a buffer, and packets are sent at a rate The data packet is generated and stored in the cache, and the data packet generation process is a Bernoulli process. The data packet based on the CSMA / CA protocol is transmitted to the destination node through a limited code length mechanism. The decision unit uses the Bernoulli process to rate at which decisions are made.

[0014] Further, in step 2, the data packet f The decoding error probability of this transmission is expressed as:

[0015]

[0016] in is the Q function, m Indicates the code length of the data packet transmission, Indicates the number of bits in the packet. represents the channel dispersion, represents the signal-to-noise ratio at the receiving end, represents the Shannon channel capacity.

[0017] Furthermore, the equivalent Markov transition model established in step 3 is:

[0018] Construct a discrete-time Markov chain where each state of the Markov chain is represented by a three-dimensional process Indicates that is the backoff order of the node, , is the maximum backoff order, and the node’s backoff counter is j , , The backoff order is The maximum contention window size when Indicates the maximum contention window size when the backoff order is 0. To set the number of packets in the cache, ; and considering an empty cache, i.e. ; No data packet will generate a backoff process, and the idle state is represented as .

[0019] Furthermore, in step 3, the collision probability in the equivalent Markov transition model is set as and transmission probability is constant and independent;

[0020] When the cache contains k When there are data packets, the corresponding transition probability is expressed as:

[0021]

[0022] in, , The backoff order i and The maximum contention window size, is the probability that the number of packets in the cache remains unchanged, is the maximum number of transmissions, For the e The decoding error probability of the transmission;

[0023] represents the probability that the backoff counter will be frozen when a collision is detected when no packets are generated;

[0024] It indicates the probability that the backoff counter will be reduced by 1 if no collision occurs when no data packet is generated;

[0025] Indicates if a collision is detected and when the backoff counter is i If no packets are generated when the -1 phase decreases to zero, the backoff counter will enter the next phase i and will be The probability of selecting a new initial fallback value within the range;

[0026] Indicates from arrive The case includes two cases: the probability that the node transmits or discards its data packet without any collision and generates a new data packet; or it starts a new backoff process and does not generate a new data packet;

[0027] Indicates that in the maximum backoff phase , the probability that the backoff order will not increase.

[0028] Furthermore, in step 3,

[0029] set up is the stationary distribution of the Markov chain, is the stationary probability of the idle state; in the next time slot, the buffer is empty, which includes two cases: the empty buffer is waiting for a new packet or the only packet in the buffer leaves.

[0030] According to the normalization condition of stationary distribution

[0031]

[0032]

[0033] but:

[0034]

[0035] Collision Probability and transmission probability They are:

[0036]

[0037]

[0038] in, Indicates the backoff order is i , the node's backoff counter is j , Markov chain steady-state distribution with 1 packet in the cache, Indicates the backoff order is i , the node's backoff counter is 0 , the number of packets in the cache is k The Markov chain steady-state distribution of For steady-state distribution and multiples of and They represent the backoff order respectively. 0 , the node's backoff counter is 0 , the number of packets in the cache is k and k- 1 is a Markov chain steady-state distribution.

[0039] Further, the step 4 is as follows: set the interval between two adjacent data packets to have The decision occurs in time, For the k The first packet j decision moment;

[0040] The maximum number of decisions is ,in is the length of a time slot;

[0041] Make a packet departure interval between two adjacent packets. n The probability of a decision is:

[0042]

[0043] Where C is a combination function, is the decision probability for each time slot;

[0044] Set the interval between two adjacent decision times to And follows a memoryless geometric distribution, k The first packet j Decision Moments With k - 1 packet received The time difference is It follows the Pascal distribution and is represented as:

[0045]

[0046] The sum is expressed as And the expectation is expressed as:

[0047]

[0048] Indicates the pursuit of expectations, at the moment of decision The instantaneous decision-making age is expressed as ,in is the system time of the previous received data packet;

[0049] Age of all decision moments To solve the expectation,

[0050]

[0051] Leave a gap between two adjacent packets Expectations:

[0052]

[0053] Update the average decision-making age formula of the decision-making system:

[0054]

[0055] in For received packets With data packet The arrival interval of For data packets System time;

[0056] The first-order moment of the arrival interval of successfully transmitted packets is the expected and the second moment Expressed as:

[0057]

[0058]

[0059] The expectation is rewritten as ,

[0060]

[0061]

[0062] in, for expectations, for expectations, for expectations, Waiting time for service, For service time; is the service rate, is the distribution of service time, is the distribution of system time, is the system time distribution parameter; is an auxiliary function, For auxiliary functions The derivative of

[0063]

[0064] r is the number of data packets that failed to be transmitted between adjacent successful data packets, and z is an auxiliary variable;

[0065] The average decision moment age of the updated decision system is:

[0066] .

[0067] On the other hand, the present invention provides a decision information timeliness measurement system for CSMA / CA non-saturated networks, comprising:

[0068] Module 1: It is used to build a non-saturated update decision system based on the CSMA / CA protocol;

[0069] Module 2: It is used to calculate the decoding error probability of each transmission of a data packet based on a non-saturated update decision system and finite code length theory;

[0070] Module 3: It is used to establish an equivalent Markov transition model and derive the collision probability and transmission probability of data packets;

[0071] Module 4: It is used to measure the timeliness of decision information in CSMA / CA non-saturated networks by obtaining the average decision time age of the update decision system based on the collision probability and transmission probability of data packets;

[0072] Compared with the prior art, the present invention has the following beneficial effects:

[0073] The present invention is the first to characterize the timeliness of unsaturated CSMA / CA networks. In order to clearly quantify the decision moment age performance, the present invention establishes an equivalent and tractable unsaturated Markov transmission model based on the considered network, and studies the transmission probability and collision probability respectively. Then, the probability density functions of the interval time, service time and system time of successfully transmitted data packets are derived. Based on these characteristics, the present invention analyzes the average decision moment age of the Bernoulli decision process and obtains the corresponding closed form expression. BRIEF DESCRIPTION OF THE DRAWINGS

[0074] In order to more clearly illustrate the technical solutions in the present invention or the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0075] Figure 1 is a flow chart of a method according to an embodiment of the present invention;

[0076] Figure 2 This is a schematic diagram of a non-saturated update decision system based on the CSMA / CA protocol according to an embodiment of the present invention;

[0077] Figure 3 A schematic diagram of a discrete-time Markov chain implemented in the present invention;

[0078] Figure 4 This is a graph showing the variation of network collision probability and transmission probability with data packet generation rate according to an embodiment of the present invention;

[0079] Figure 5 This is a graph showing the variation of the average decision information age with the code length according to an embodiment of the present invention. DETAILED DESCRIPTION

[0080] In order to make the purpose, technical solution and advantages of the present invention clearer, the technical solution of the present invention will be clearly and completely described below in conjunction with the drawings of 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 are within the scope of protection of the present invention.

[0081] Example 1

[0082] like Figure 1 The flowchart of the method of the present invention is a method for measuring the timeliness of decision information for CSMA / CA (Carrier Sense Multiple Access with Collision Avoid) non-saturated networks, which mainly includes the following steps: first, construct a non-saturated update decision system based on the CSMA / CA protocol; then, calculate the decoding error probability of each transmission based on the finite code length theory; then, establish an equivalent Markov transition model and derive the collision probability and transmission probability of the data packet; finally, according to the above derivation, obtain the average decision time age of the update decision system. The implementation process includes the following steps:

[0083] Step 1: Construct a non-saturated update decision system based on the CSMA / CA protocol. The CSMA / CA non-saturated network packet is as follows: Figure 2 As shown, including There are three independent source nodes, one destination node and one decision unit. Each source is equipped with a buffer, and the data packets are transmitted at a rate of p The data packet is generated and stored in the cache, and the data packet generation process is a Bernoulli process. The data packet will be transmitted to the destination node through a finite block length mechanism based on the CSMA / CA protocol. The decision unit uses the Bernoulli process to rate at which decisions are made.

[0084] Step 2: In order to meet the reliability requirements of the transmitted data packets, the decoding error probability at the receiving end is considered; a quasi-static Rayleigh fading model is used to keep the state of the wireless channel unchanged in each frame.

[0085] In order to meet the requirement of low latency, data packets cannot be retransmitted an unlimited number of times; f The decoding error probability of this transmission is expressed as:

[0086]

[0087] in is the Q function, m Indicates the code length of the data packet transmission, Indicates the number of bits in the packet. represents the channel dispersion, represents the signal-to-noise ratio at the receiving end, represents the Shannon channel capacity.

[0088] Step 3: Establish an equivalent Markov transition model and derive the collision probability and transmission probability of the data packet. When constructing the equivalent Markov transition model, assume that the collision probability and transmission probability is constant and independent. Figure 3 The discrete-time Markov process shown in Figure 1 is a Markov chain in which each state is represented by a three-dimensional process. Indicates that is the backoff order, , is the maximum backoff stage, is the backoff counter, , is the backoff level The maximum contention window size, represents the contention window size when the backoff order is 0. The number of packets in the cache is recorded as , . In addition, considering an empty cache, i.e. Since there is no data packet and no backoff process occurs, the idle state is represented as .

[0089] When the buffer contains k When there are data packets, the corresponding transition probability can be expressed as:

[0090]

[0091] in, , The backoff order i and The maximum contention window size, is the probability that the number of packets in the cache remains unchanged, is the maximum number of transmissions, For the e The decoding error probability of the transmission;

[0092] represents the probability that the backoff counter will be frozen when a collision is detected when no packets are generated;

[0093] It indicates the probability that the backoff counter will be reduced by 1 if no collision occurs when no data packet is generated;

[0094] Indicates if a collision is detected and when the backoff counter is i If no packets are generated when the -1 phase decreases to zero, the backoff counter will enter the next phase i and will be The probability of selecting a new initial fallback value within the range;

[0095] Indicates from arrive The case includes two cases: the probability that the node transmits or discards its data packet without any collision and generates a new data packet; or it starts a new backoff process and does not generate a new data packet;

[0096] Indicates that in the maximum backoff phase , the probability that the backoff order will not increase.

[0097] definition is the stationary distribution of the Markov chain, is idle. Since the backoff counter will reach zero in exactly one time slot no matter which order it stays at, the closed solution of the Markov chain is:

[0098]

[0099]

[0100] By summing the backoff order, we have

[0101]

[0102] make and ,when ,have

[0103]

[0104] in is the stationary probability of being in the idle state. In the next time slot, the buffer is empty, which includes two cases: the empty buffer is waiting for a new packet or the only packet in the buffer leaves. Therefore, It can be expressed as

[0105]

[0106] By substitution Available

[0107]

[0108] in In the short packet scenario, , hence the considered network will be stable and the queue delay will be bounded.

[0109] when ,have

[0110] thus It can be expressed as

[0111] For each ,

[0112]

[0113] According to the normalization condition of stationary distribution

[0114]

[0115]

[0116] Obtain

[0117]

[0118] From this we can find the collision probability and transmission probability They are

[0119]

[0120]

[0121] in, Indicates the backoff order is i , the node's backoff counter is j , Markov chain steady-state distribution with 1 packet in the cache, Indicates the backoff order is i , the node's backoff counter is 0 , the number of packets in the cache is k The Markov chain steady-state distribution of For steady-state distribution and multiples of and They represent the backoff order respectively. 0 , the node's backoff counter is 0 , the number of packets in the cache is k and k- 1 is a Markov chain steady-state distribution.

[0122] Step 4: Assume that there is a time interval between two adjacent packets. have The decision occurs in Since the departure interval is an integer multiple of the time slot length, the maximum number of decisions is Since the decision-making process follows the Bernoulli process, The parameter is A random number. Made in The probability of a decision is

[0123]

[0124] Define the interval between two adjacent decision moments as , due to the decision interval follows a memoryless geometric distribution, so It follows the Pascal distribution and can be expressed as,

[0125]

[0126] Where C is a combination function, is the decision probability for each time slot;

[0127] therefore The expectation can be expressed as

[0128]

[0129] At the moment of decision The instantaneous decision information age can be expressed as ,in Is the system time of the previous received packet.

[0130] By solving the expected age of all decision information,

[0131]

[0132] Through Seek expectations

[0133]

[0134] Therefore, the average decision-making age formula of the updated decision-making system is

[0135]

[0136] in For received packets With data packet The arrival interval of For data packets System time, The time for one time slot.

[0137] The first-order moment of the arrival interval of successfully transmitted packets is the expected and the second moment Expressed as:

[0138]

[0139]

[0140] because and Related, The expectation can be rewritten as , Waiting time for service.

[0141]

[0142] in , is the distribution of service time, is the distribution of system time, is the system time distribution parameter;

[0143] Define the following helper functions

[0144] The expectation can be expressed as

[0145]

[0146] For Derivative of a function.

[0147] From this, we can deduce the average decision-making age of the updated decision-making system.

[0148]

[0149] Figure 4 The graph of network collision probability and transmission probability changing with data packet generation rate in the real-time example of the present invention is given, where the number of source nodes is set to , the transmission code length is set to , maximum backoff order , the maximum contention window size when the backoff order is 0 is , the maximum number of retransmissions is It can be seen that as the collision probability and transmission probability increase with the packet generation rate p increases with the increase of . pThe increase in leads to a higher probability of non-empty buffers, which subsequently leads to an increase in the transmission probability. In addition, due to the increased competition for channel access, the collision probability also increases accordingly. When the network tends to be saturated, the collision probability and the transmission probability converge to the maximum value.

[0150] Figure 5 The average decision time age in the real-time example of the present invention is given as a function of the code length, and the packet arrival rate , the maximum number of retransmissions is , it can be seen that the average decision time age exhibits a unique characteristic, which is neither convex nor concave with respect to the block length. However, the average decision time age shows convexity in three domains, which just corresponds to the maximum number of transmissions allowed. Frequent retransmissions and excessively long block lengths lead to large values ​​of the average decision time age. In addition, the implementation of retransmissions helps to achieve the optimal value.

[0151] Example 2

[0152] This embodiment provides a decision information timeliness measurement system for a CSMA / CA non-saturated network, including:

[0153] Module 1: It is used to build a non-saturated update decision system based on the CSMA / CA protocol;

[0154] Module 2: It is used to calculate the decoding error probability of each transmission based on the non-saturated update decision system and the finite code length theory;

[0155] Module 3: It is used to establish an equivalent Markov transition model and derive the collision probability and transmission probability of data packets;

[0156] Module 4: It is used to measure the timeliness of decision information in CSMA / CA non-saturated networks by obtaining the average decision time age of the update decision system based on the collision probability and transmission probability of data packets.

[0157] It should be understood that parts not elaborated in detail in this specification belong to the prior art.

[0158] It should be understood that the above description of the preferred embodiment is relatively detailed, and it cannot be considered as limiting the scope of protection of the patent of the present invention. It is not necessary and impossible to list all the embodiments here. Under the enlightenment of the present invention, ordinary technicians in this field can also make substitutions or modifications without departing from the scope of protection of the claims of the present invention, which fall within the scope of protection of the present invention. The scope of protection of the present invention shall be based on the attached claims.

Claims

1. A method for measuring the timeliness of decision information for CSMA / CA non-saturated networks, characterized in that: The following steps are involved: Step 1: Constructing a non-saturated update decision system based on the CSMA / CA protocol; The non-saturated update decision system in step 1 includes: An independent source node, a destination node and a decision unit; Each source node is equipped with a buffer, and packets are sent at a rate The data packet is generated and stored in the cache, and the data packet generation process is a Bernoulli process. The data packet based on the CSMA / CA protocol is transmitted to the destination node through a limited code length mechanism. The decision unit uses the Bernoulli process to Make decisions at a rate Step 2: Based on the non-saturated update decision system in step 1 and the finite code length theory, the decoding error probability of each transmission of the data packet is calculated; f The decoding error probability of this transmission is expressed as: in is the Q function, m Indicates the code length of the data packet transmission, Indicates the number of bits in the packet. represents the channel dispersion, represents the signal-to-noise ratio at the receiving end, represents the Shannon channel capacity; Step 3: Establish an equivalent Markov transfer model and derive the collision probability and transmission probability of the data packet; the equivalent Markov transfer model established in step 3 is: Construct a discrete-time Markov chain where each state of the Markov chain is represented by a three-dimensional process Indicates that is the backoff order of the node, , is the maximum backoff order, and the node’s backoff counter is j , , The backoff order is The maximum contention window size when Indicates the maximum contention window size when the backoff order is 0. To set the number of packets in the cache, ; and considering an empty cache, i.e. ; No data packet will generate a backoff process, and the idle state is represented as ; In step 3, the collision probability in the equivalent Markov transition model is set as and transmission probability is constant and independent; When the cache contains k When there are data packets, the corresponding transition probability is expressed as: in, , The backoff order i and The maximum contention window size, is the probability that the number of packets in the cache remains unchanged, is the maximum number of transmissions, For the e The decoding error probability of the transmission; represents the probability that the backoff counter will be frozen when a collision is detected when no packets are generated; It indicates the probability that the backoff counter will be reduced by 1 if no collision occurs when no data packet is generated; Indicates if a collision is detected and when the backoff counter is i If no packets are generated when the -1 phase decreases to zero, the backoff counter will enter the next phase i and will be The probability of selecting a new initial fallback value within the range; Indicates from arrive The case includes two cases: the probability that the node transmits or discards its data packet without any collision and generates a new data packet; or it starts a new backoff process and does not generate a new data packet; Indicates that in the maximum backoff phase The probability that the backoff order will not increase when ; Step 4: Based on the collision probability and transmission probability of the data packets in step 3, the average decision time age of the update decision system is obtained to measure the timeliness of the decision information of the CSMA / CA non-saturated network.

2. The method for measuring the timeliness of decision information for CSMA / CA non-saturated networks according to claim 1, characterized in that: In the step 3, set up is the stationary distribution of the Markov chain, is the stationary probability of the idle state; in the next time slot, the buffer is empty, which includes two cases: the empty buffer is waiting for a new packet or the only packet in the buffer leaves. According to the normalization condition of stationary distribution but: Collision Probability and transmission probability They are: in, Indicates the backoff order is i , the node's backoff counter is j , Markov chain steady-state distribution with 1 packet in the cache, Indicates the backoff order is i , the node's backoff counter is 0 , the number of packets in the cache is k The Markov chain steady-state distribution of For steady-state distribution and multiples of and They represent the backoff order respectively. 0 , the node's backoff counter is 0 , the number of packets in the cache is k and k- 1 is a Markov chain steady-state distribution.

3. The method for measuring the timeliness of decision information for CSMA / CA non-saturated networks according to claim 2, characterized in that: The step 4 is as follows: set the interval between two adjacent data packets to have The decision occurs in time, For the k The first packet j decision moment; The maximum number of decisions is ,in is the length of a time slot; Make a packet departure interval between two adjacent packets. n The probability of a decision is: Where C is a combination function, is the decision probability for each time slot; Set the interval between two adjacent decision times to And follows a memoryless geometric distribution, k The first packet j Decision Moments With k - 1 packet received The time difference is It follows the Pascal distribution and is represented as: The sum is expressed as And the expectation is expressed as: Indicates the pursuit of expectations, at the moment of decision The instantaneous decision-making age is expressed as ,in is the system time of the previous received data packet; Age of all decision moments To solve the expectation, Leave a gap between two adjacent packets Expectations: Update the average decision-making age formula of the decision-making system: in For received packets With data packet The arrival interval of For data packets System time; The first-order moment of the arrival interval of successfully transmitted packets is the expected and the second moment Expressed as: The expectation is rewritten as , in, for expectations, for expectations, for expectations, Waiting time for service, For service time; is the service rate, is the distribution of service time, is the distribution of system time, is the system time distribution parameter; is an auxiliary function, For auxiliary functions The derivative of r is the number of data packets that failed to be transmitted between adjacent successful data packets, and z is an auxiliary variable; The average decision moment age of the updated decision system is: 。 4. A decision information timeliness measurement system for CSMA / CA non-saturated networks, characterized by: include: Module 1: It is used to build a non-saturated update decision system based on the CSMA / CA protocol; Module 2: It is used to calculate the decoding error probability of each transmission of a data packet based on a non-saturated update decision system and finite code length theory; Module 3: It is used to establish an equivalent Markov transition model and derive the collision probability and transmission probability of data packets; Module 4: It is used to measure the timeliness of decision information in CSMA / CA non-saturated networks by obtaining the average decision time age of the update decision system based on the collision probability and transmission probability of data packets; The decision information timeliness measurement system for CSMA / CA non-saturated networks is used to execute the steps in the decision information timeliness measurement method for CSMA / CA non-saturated networks described in any one of claims 1-3.