CN114501673A - Time slot allocation method, time slot allocation device, electronic equipment and storage medium - Google Patents
Time slot allocation method, time slot allocation device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN114501673A CN114501673A CN202210145196.8A CN202210145196A CN114501673A CN 114501673 A CN114501673 A CN 114501673A CN 202210145196 A CN202210145196 A CN 202210145196A CN 114501673 A CN114501673 A CN 114501673A
- Authority
- CN
- China
- Prior art keywords
- data
- node
- time slot
- allocated
- probability
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 51
- 238000005070 sampling Methods 0.000 claims abstract description 134
- 230000005540 biological transmission Effects 0.000 claims abstract description 107
- 230000009471 action Effects 0.000 claims abstract description 46
- 238000011156 evaluation Methods 0.000 claims description 21
- 238000004590 computer program Methods 0.000 claims description 6
- 239000002699 waste material Substances 0.000 abstract description 13
- 238000010586 diagram Methods 0.000 description 8
- 230000001960 triggered effect Effects 0.000 description 7
- 230000003287 optical effect Effects 0.000 description 6
- 238000004891 communication Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 5
- 238000012545 processing Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 230000008707 rearrangement Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure
- H04W74/0841—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment
- H04W74/085—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure with collision treatment collision avoidance
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/52—Allocation or scheduling criteria for wireless resources based on load
Abstract
The embodiment of the invention discloses a time slot allocation method, a time slot allocation device, electronic equipment and a storage medium. The time slot allocation method comprises the following steps: acquiring traffic data of each node and time slot association data to be allocated; determining the probability data of seizing the time slot to be allocated by each node according to the traffic data and the time slot association data to be allocated; and acquiring a random sampling data range matched with the preemptive probability data, and triggering the time slot preemptive action of each node according to the random sampling result of the random sampling data range. The technical scheme of the embodiment of the invention can effectively reduce the data transmission conflict, improve the utilization rate of the time slot resources and avoid the waste of the time slot resources.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method and an apparatus for allocating time slots, an electronic device, and a storage medium.
Background
In a communication system (such as a TDMA time division multiple access system), a plurality of terminals can share a common time slot resource, when a plurality of terminals randomly access a time slot, the situation of high data transmission conflict rate often exists, which results in the waste of time slot resources, a time slot allocation mechanism is reasonably planned, data transmission conflict can be effectively reduced, the time slot resource utilization rate is improved, and the reasonable allocation of the time slot becomes a research hotspot in the communication field.
Disclosure of Invention
Embodiments of the present invention provide a time slot allocation method, an apparatus, an electronic device, and a storage medium, which can effectively reduce data transmission conflicts, improve the utilization rate of time slot resources, and avoid the waste of time slot resources.
In a first aspect, an embodiment of the present invention provides a timeslot allocation method, including:
acquiring traffic data of each node and time slot association data to be allocated;
determining the probability data of seizing the time slot to be allocated by each node according to the traffic data and the time slot associated data to be allocated;
and acquiring a random sampling data range matched with the preemption probability data, and triggering the time slot preemption action of each node according to the random sampling result of the random sampling data range.
In a second aspect, an embodiment of the present invention further provides a timeslot allocating apparatus, including:
the data acquisition module is used for acquiring the traffic data of each node and the time slot association data to be allocated;
the data determining module is used for determining the probability data of the nodes for seizing the time slots to be allocated according to the traffic data and the time slot association data to be allocated;
and the action triggering module is used for acquiring a random sampling data range matched with the preemption probability data and triggering the time slot preemption action of each node according to the random sampling result of the random sampling data range.
In a third aspect, an embodiment of the present invention further provides an electronic device, where the electronic device includes:
one or more processors;
storage means for storing one or more programs;
when executed by the one or more processors, cause the one or more processors to implement the slot allocation method provided by any of the embodiments of the present invention.
In a fourth aspect, an embodiment of the present invention further provides a computer storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the timeslot allocation method provided in any embodiment of the present invention.
According to the technical scheme of the embodiment, the traffic data and the time slot associated data to be allocated of each node are obtained, and then the probability data to be preempted of the time slot to be allocated of each node is determined according to the traffic data and the time slot associated data to be allocated, so that a random sampling data range matched with the probability data is obtained, and the time slot preemption action of each node is triggered according to the random sampling result of the random sampling data range. Because the traffic data can represent the traffic of the nodes, the probability data of the nodes for occupying the time slots to be allocated are determined according to the traffic data and the time slot association data to be allocated, and the association between the traffic of the nodes and the probability data can be established, so that the probability data of the nodes can be adjusted based on the traffic of the nodes. And triggering the time slot preemption action of each node according to the random sampling result of the random sampling data range matched with the preemption probability data, establishing the association between the traffic volume of each node and the time slot preemption action of each node through the preemption probability data, and realizing the regulation of the time slot preemption action based on the traffic volume of the nodes, thereby reducing the probability of data transmission conflict and the generation of idle time slots caused by random access time slots, solving the problems of high data transmission conflict rate and time slot resource waste caused by unreasonable time slot allocation in the prior art, effectively reducing data transmission conflict, improving the utilization rate of the time slot resources and avoiding the waste of the time slot resources.
Drawings
Fig. 1 is a flowchart of a timeslot allocation method according to an embodiment of the present invention;
fig. 2 is a flowchart of a timeslot allocation method according to a second embodiment of the present invention;
fig. 3 is a diagram illustrating a timeslot allocation according to a second embodiment of the present invention;
fig. 4 is a diagram illustrating a result of preempting a timeslot by a node according to a second embodiment of the present invention;
fig. 5 is a schematic diagram of a timeslot allocating apparatus according to a third embodiment of the present invention;
fig. 6 is a schematic structural diagram of an electronic device according to a fourth embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention.
It should be further noted that, for the convenience of description, only some but not all of the relevant elements of the present invention are shown in the drawings. Before discussing exemplary embodiments in more detail, it should be noted that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although a flowchart may describe the operations (or steps) as a sequential process, many of the operations can be performed in parallel, concurrently or simultaneously. In addition, the order of the operations may be re-arranged. The process may be terminated when its operations are completed, but may have additional steps not included in the figure. The processes may correspond to methods, functions, procedures, subroutines, and the like.
Example one
Fig. 1 is a flowchart of a timeslot allocation method according to an embodiment of the present invention, where the embodiment is applicable to effectively reduce timeslot allocation conflicts, and the method may be executed by a timeslot allocation apparatus, where the timeslot allocation apparatus may be implemented by software and/or hardware, and may be generally integrated in an electronic device. The electronic device may be a terminal device, a server device, or the like, and the embodiment of the present invention does not limit the type of the electronic device that executes the timeslot assignment method. Accordingly, as shown in fig. 1, the method comprises the following operations:
and S110, acquiring the traffic data of each node and the time slot association data to be allocated.
A node may be a device, module, system, or apparatus that needs to access a slot for data transmission through the slot, among others. Illustratively, the node may be a communication terminal, a software system, or the like. The embodiment of the present invention does not limit the type of the node. The traffic data may be the amount of traffic data that the node needs to transmit. Alternatively, the traffic data may be measured in bytes, bits, megabits, and the like. The data associated with the time slots to be allocated may be data associated with time slots accessible to the node.
In the embodiment of the invention, the data volume of the service data required to be transmitted by each node can be counted to obtain the service volume data of each node, and the time slot which can be accessed by each node can be analyzed to determine the time slot related data to be distributed.
And S120, determining the probability data of the nodes to seize the time slots to be allocated according to the traffic data and the time slot association data to be allocated.
The time slot to be allocated may be a time slot accessible to the node, that is, a time slot that the node can preempt. The preemption probability data may be the probability of a node successfully accessing a time slot to be allocated.
In the embodiment of the invention, the data related to the time slots to be allocated can be analyzed, the number of the time slots to be allocated which can be accessed by the nodes and the data transmission capability of the time slots to be allocated are determined, and then the probability data of preemption of the time slots to be allocated by the nodes is calculated according to the traffic data of the nodes, the number of the time slots to be allocated and the data transmission capability of the time slots to be allocated. Because the traffic data can reflect the size of the node traffic (the size of the traffic data), the probability data of preemption of the time slot to be allocated by each node is determined according to the traffic data and the time slot association data to be allocated, and the reasonable adjustment of the probability data of preemption of the time slot to be allocated can be realized aiming at the traffic of each node.
S130, acquiring a random sampling data range matched with the preemptive probability data, and triggering the time slot preemptive action of each node according to the random sampling result of the random sampling data range.
The random sampling data range may be a data range preset according to the preemption probability data. The randomly sampled data range may include at least two data. The random sampling result may be sampling data obtained by performing random sampling processing on data in a random sampling data range. For example, assuming that the random sampling data range includes 1, 2, 3, 4 and 5, the random sampling data range is subjected to a random sampling process, and when the sampling data is 5, 5 may be used as a random sampling result. The slot preemption action may be an action by which a node accesses a slot to be allocated.
In the embodiment of the invention, a random sampling data range matched with each node can be configured according to the preemption probability data of each node, random sampling processing is carried out on the random sampling data range to obtain the random sampling result of each node, and then the time slot preemption action of each node is triggered according to the random sampling result, the random sampling data range and the preemption probability data of each node.
Because the size of the traffic of each node is associated with the preemption probability data of each node, after the preemption probability data is reasonably adjusted according to the traffic of each node, the time slot preemption action of each node is triggered according to the random sampling result of the random sampling data range matched with the preemption probability data, so that each node can reasonably preempt the time slot to be allocated according to the specific task size, for example, the node with large task size preempts the time slot to be allocated through higher probability, the node with small task size preempts the time slot to be allocated through lower probability, so as to ensure that the node with large task size obtains more access opportunities, and the node with small traffic can not successfully access because of the unopposed access of other nodes with multiple services, namely, when the traffic of the node is large, more opportunities can be obtained to relieve the load, when the traffic of the node is reduced, excessive preemption is not performed any more, and the node is accessed into the time slot to be allocated in a self-adaptive manner. The probability of the nodes with large task amount preempting the time slots to be allocated is higher than that of the nodes with small task amount preempting the time slots to be allocated. When the traffic of the node is less, the node occupies a small number of time slots to be allocated in the N time slots to be allocated; when the service data volume of the node is large, the node occupies a plurality of time slots to be allocated in the N time slots to be allocated, so that the access rate is improved, the data backlog is relieved, and the purpose of reasonably and uniformly occupying time slot resources is achieved.
According to the technical scheme of the embodiment, the traffic data and the time slot associated data to be allocated of each node are obtained, and then the probability data to be preempted of the time slot to be allocated of each node is determined according to the traffic data and the time slot associated data to be allocated, so that a random sampling data range matched with the probability data is obtained, and the time slot preemption action of each node is triggered according to the random sampling result of the random sampling data range. Because the traffic data can represent the traffic of the nodes, the probability data of the nodes for occupying the time slots to be allocated are determined according to the traffic data and the time slot association data to be allocated, and the association between the traffic of the nodes and the probability data can be established, so that the probability data of the nodes can be adjusted based on the traffic of the nodes. And triggering the time slot preemption action of each node according to the random sampling result of the random sampling data range matched with the preemption probability data, establishing the association between the traffic volume of each node and the time slot preemption action of each node through the preemption probability data, and realizing the regulation of the time slot preemption action based on the traffic volume of the nodes, thereby reducing the probability of data transmission conflict and the generation of idle time slots caused by random access time slots, solving the problems of high data transmission conflict rate and time slot resource waste caused by unreasonable time slot allocation in the prior art, effectively reducing data transmission conflict, improving the utilization rate of the time slot resources and avoiding the waste of the time slot resources.
Example two
Fig. 2 is a flowchart of a timeslot allocation method according to a second embodiment of the present invention. The embodiments of the present invention are embodied on the basis of the above embodiments, and in the embodiments of the present invention, a specific optional implementation manner for determining preemption probability data of time slots to be allocated by each node according to traffic data and time slot association data to be allocated is provided.
As shown in fig. 2, the method of the embodiment of the present invention specifically includes:
s210, acquiring the traffic data of each node and the time slot association data to be allocated.
In an optional embodiment of the present invention, acquiring traffic data of each node and timeslot association data to be allocated may include: determining a statistical period of a time slot to be allocated; taking the number of the time slots to be allocated in a statistical period and the time slot data transmission quantity of a single time slot to be allocated as the time slot associated data to be allocated; and counting the traffic data of each node at the beginning of the counting period.
Wherein, a plurality of timeslots to be allocated may be included in one statistic period. The number of timeslots to be allocated may be the number of timeslots to be allocated for access by the node. The slot data transmission amount may be a maximum data transmission amount of the slot to be allocated for characterizing the data transmission capability of the slot to be allocated.
In the embodiment of the present invention, a statistical period of a periodic time slot to be allocated, which is accessible to a node, may be first determined, and then the number of time slots to be allocated in one statistical period and the time slot data transmission amount of a single time slot to be allocated are determined, so that the number of time slots to be allocated in one statistical period and the time slot data transmission amount of a single time slot to be allocated are used as time slot related data to be allocated, and traffic data of each node is counted at the period start time of each statistical period, so as to reasonably allocate a time slot according to the traffic data of each node.
For example, in a statistical period, the time may be divided into equal-length time slots, where N +1 time slots are a frame, where N time slots are time slots to be allocated, and one time slot is a B time slot. Each slot is a resource unit. The B time slot is a broadcast time slot, and is used for a terminal (node) to receive a base station broadcast, so as to ensure time synchronization between the base station and the terminal, and a time slot allocation map can be seen in fig. 3.
And S220, determining the probability data of the nodes to seize the time slots to be allocated according to the traffic data and the time slot association data to be allocated.
In an optional embodiment of the present invention, S220 may specifically include:
and S221, determining the number of the time slots to be preempted of each node according to the traffic data of each node and the transmission quantity of the time slot data.
The number of the timeslots to be preempted may be the number of the timeslots to be allocated, which are occupied by the node to transmit the service data matched with the traffic data.
In the embodiment of the present invention, the number of to-be-allocated timeslots required by each node to transmit the service data matched with the traffic data may be calculated according to the traffic data of each node and the timeslot data transmission amount, and the calculated number of to-be-allocated timeslots required by each node is respectively used as the number of to-be-preempted timeslots of the corresponding node.
For example, the quotient of the traffic data of the node and the transmission quantity of the timeslot data may be used as the number of timeslots to be preempted by the node, the calculated number of timeslots to be allocated required by the node a is used as the number of timeslots to be preempted by the node a, and the calculated number of timeslots to be allocated required by the node B is used as the number of timeslots to be preempted by the node B.
S222, determining preemption probability data of time slots to be allocated to each node according to the number of the time slots to be preempted and the number of the time slots to be allocated of each node.
In the embodiment of the invention, the preemption probability data of the time slots to be allocated by each node can be determined according to the proportion of the number of the time slots to be preempted of each node to the number of the time slots to be allocated.
In an optional embodiment of the present invention, determining preemption probability data of time slots to be allocated by each node according to the number of time slots to be preempted and the number of time slots to be allocated of each node may include: acquiring at least one standard transmission probability grade range and standard transmission probability data matched with the standard transmission probability grade range; determining the sending probability grade data of each node according to the ratio of the number of the time slots to be preempted and the number of the time slots to be distributed of each node; and determining the transmission probability data corresponding to each node according to the standard transmission probability level range in which the transmission probability level data of each node falls, wherein the transmission probability data are used as the preemption probability data of each node on the time slot to be allocated.
The standard transmission probability level range may be a preset data interval, and is used to divide the probability level of the node accessing the time slot to be allocated. The standard transmission probability data may be a preset probability that the node transmits the service data through the time slot to be allocated, corresponding to the standard transmission probability level ranges one to one. The transmission probability level data may be data in a standard transmission probability level range determined according to a ratio of the number of slots to be preempted and the number of slots to be allocated. The transmission probability data may be data belonging to standard transmission probability data matching the standard transmission probability level range, determined based on the transmission probability level data, the standard transmission probability level range, and the standard transmission probability data. The transmission probability level data corresponds to the transmission probability data one to one.
In the embodiment of the present invention, at least one standard transmission probability level range and standard transmission probability data matched with the standard transmission probability level range may be set according to the traffic data of each node, so as to calculate the ratio of the number of time slots to be preempted to the number of time slots to be allocated of each node, and use the ratio of the number of time slots to be preempted to the number of time slots to be allocated of each node as the transmission probability level data of the corresponding node. After the transmission probability level data of each node is obtained, the transmission probability level data of each node is matched with the standard transmission probability level range, and the standard transmission probability level range in which the transmission probability level data of each node falls is determined. And respectively taking the standard sending probability data matched with the standard sending probability level range in which the sending probability level data of each node falls as the sending probability data of the corresponding node, and further respectively taking the sending probability data of each node as the preemptive probability data of the corresponding node to-be-allocated time slot.
For example, the standard transmission probability level range and the standard transmission probability data matching the standard transmission probability level range may be stored in a standard transmission probability level look-up table as shown in table 1:
table 1 standard transmission probability level look-up table
| Standard transmission probability level range | Standard transmission probability data |
| N/N is greater than or equal to 1 | 50％ |
| N/N is more than 0.75 and less than 1 | 40％ |
| N/N is greater than 0.5 and less than or equal to 0.75 | 30％ |
| N/N is greater than 0.25 and less than or equal to 0.5 | 20％ |
| N/N is less than or equal to 0.25 | 10％ |
Wherein N represents the number of time slots to be preempted, N represents the number of time slots to be allocated, and N/N represents the sending probability level data.
The standard transmission probability level ranges and the standard transmission probability data in table 1 are only examples and can be adjusted according to specific setting requirements.
In an optional embodiment of the present invention, before determining the transmission probability level data of each node according to a ratio of the number of slots to be preempted to the number of slots to be allocated of each node, the method may further include: acquiring a traffic evaluation threshold value of a node, and calculating a traffic mean value of traffic data of each node; when the average value of the traffic is determined to be larger than or equal to the traffic evaluation threshold, standard sending probability data matched with the range of each standard sending probability level is adjusted according to a first proportion; and when the average traffic volume is determined to be smaller than the traffic volume evaluation threshold, the standard transmission probability data matched with the standard transmission probability grade ranges are adjusted upwards according to a second proportion.
The traffic evaluation threshold may be preset, and is used for evaluating data of traffic density degree. The traffic mean may be a mean of data quantities characterizing the transmission of traffic data by each node. The first ratio may be preset data less than 1 for up-regulating the standard transmission probability data. The second ratio may be preset data less than 1 for adjusting the standard transmission probability data downward.
In the embodiment of the invention, the traffic evaluation threshold value can be determined according to the allocation requirement of the time slot, so that the traffic data of each node which needs to occupy the time slot to be allocated is determined, the ratio of the sum of the traffic data of each node to the number of the nodes is used as the traffic mean value, so that the traffic mean value and the traffic evaluation threshold value are compared, and if the traffic mean value is greater than or equal to the traffic evaluation threshold value, the standard sending probability data matched with each standard sending probability grade range is adjusted according to the first ratio so as to update the standard sending probability data matched with each standard sending probability grade range. And if the traffic mean value is smaller than the traffic evaluation threshold, the standard sending probability data matched with the standard sending probability grade ranges are adjusted upwards according to a second proportion to update the standard sending probability data matched with the standard sending probability grade ranges. That is, when the node traffic is dense, the probability data can be sent according to the first proportion, time slot conflict is reduced, and the time slot utilization rate is improved.
In an optional embodiment of the present invention, after determining, according to the traffic data and the data related to the time slot to be allocated, the preemption probability data of the time slot to be allocated by each node, the method may further include: determining the access success probability of each node and the idle probability of the time slot to be allocated according to the preemption probability data of each node; calculating the time slot conflict probability according to the access success probability and the idle probability of the time slot to be allocated; and taking the access success probability, the idle probability of the time slot to be allocated and the time slot conflict probability as evaluation statistical data of the time slot to be allocated.
The access success probability may be the probability of the node successfully accessing the time slot to be allocated. The idle probability may be the probability that the time slot to be allocated is not accessed by any node. The time slot collision probability may be the probability that one time slot to be allocated is accessed by at least two nodes. The evaluation statistic may be data evaluating how reasonable the slot allocation is.
In the embodiment of the invention, the access success probability of each node can be determined according to the preemption probability data of each node, the probability that each node unsuccessfully preempts the time slot to be allocated can be calculated according to the preemption probability data of each node, the idle probability of the time slot to be allocated is calculated according to the probability that each node unsuccessfully preempts the time slot to be allocated, the sum of the access success probability of each node and the idle probability of the time slot to be allocated is further calculated, the difference value between 1 and the sum is further used as the time slot conflict probability, and therefore, the access success probability, the idle probability of the time slot to be allocated and the time slot conflict probability are used as the evaluation statistical data of the time slot to be allocated, and the evaluation and adjustment are carried out on the allocation reasonableness of the time slot to be allocated according to the evaluation statistical data of the time slot to be allocated.
Illustratively, the access success probability of a node may be calculated according to the following formula:
wherein, PSiThe access success probability of the node i is represented, pi represents the preemption probability data of the node i, and n represents the total number of the nodes.
The idle probability of a time slot to be allocated can be calculated according to the following formula:
wherein, PI represents the idle probability of the time slot to be allocated, PI represents the preemption probability data of the node i, and n represents the total number of the nodes.
The slot collision probability can be calculated according to the following formula:
PC＝1-PSi-PI
where PI denotes the idle probability of the time slot to be allocated, PSiAnd the access success probability of the node i is represented, and the PC represents the calculation of the time slot collision probability.
And S230, acquiring a random sampling data range matched with the preemptive probability data, and triggering the time slot preemptive action of each node according to the random sampling result of the random sampling data range.
In an optional embodiment of the present invention, triggering a time slot preemption action of each node according to a random sampling result of a random sampling data range may include: according to the occupation probability data of each node, configuring a random sampling data range matched with the occupation probability data of each node; determining a time slot occupation sampling data range corresponding to each node according to the random sampling data range and the occupation probability data of each node; and randomly sampling each node, determining random sampling results respectively corresponding to each node, and triggering the time slot preemption action of the nodes of which the random sampling results fall into a matched time slot preemption sampling data range.
The time slot preemptive sampling data range may be partial data in the random sampling data range, and the quotient of the number of data in the time slot preemptive sampling data range corresponding to the node and the number of data in the random sampling data range is the preemptive probability data of the node. For example, assuming that the preemption probability data is 80%, the random sampling data range matched with the preemption probability data includes 1, 2, 3, 4 and 5, the time slot preemption sampling data range may include 1, 2, 3 and 4, the time slot preemption sampling data range includes 4 data, the random sampling data range includes 5 data, and the quotient of the number of data included in the time slot preemption sampling data range and the number of data included in the random sampling data range is 0.8, which is consistent with the preemption probability data of 80%. The time slot preemptive sampling data range may further include 2, 3, 4 and 5, and the embodiment of the present invention does not limit the specific data content in the random sampling data range included in the time slot preemptive sampling data range, as long as the quotient of the number of data in the time slot preemptive sampling data range corresponding to the node and the number of data in the random sampling data range is satisfied as the preemptive probability data of the node.
In the embodiment of the present invention, a data set corresponding to the preemption probability data of each node may be determined according to the preemption probability data of each node, so as to obtain a random sampling data range matching the preemption probability data of each node, further determine a data amount of the random sampling data range, use a product value of the preemption probability data and the data amount of the random sampling data range as a data amount of data to be screened from the random sampling data range, further select at least one data from the random sampling data range according to the data amount to be screened, and preempt the sampling data range by using the screened data as a time slot. And after the time slot is obtained and the sampling data range is preempted, randomly sampling the data in the random sampling data range of each node to obtain random sampling results respectively corresponding to each node. If the random sampling result falls into the matched time slot preemptive sampling data range, triggering the time slot preemptive action of the node matched with the random sampling result, and if the random sampling result does not fall into the matched time slot preemptive sampling data range, not triggering the time slot preemptive action of the node matched with the random sampling result.
For example, assuming that the preemption probability data of the node a is 80%, a random sampling data range including 1, 2, 3, 4, and 5 may be set, a random sampling data range from 1 to 100 may also be set, and a random sampling data range of 0.2, 0.4, 0.6, 0.8, and 1 may also be set, as long as the ratio of the data amount of the sampling data range occupied by the time slot to the data amount of the random sampling data range is the preemption probability data.
Fig. 4 is a diagram of a result of preempting a time slot by a node according to a second embodiment of the present invention, as shown in fig. 4, when a time slot to be allocated arrives, a node 1 uses P1 to preempt the time slot to be allocated for service data transmission, and does not preempt with a probability of (1-P1), so that other nodes in a network perform preemption, thereby avoiding collision. In the same way, the node 2 preempts the time slot to be allocated with P2 for service data transmission, and does not preempt with the probability of (1-P2), and the node 3 preempts the time slot to be allocated with P3 for service data transmission, and does not preempt with the probability of (1-P3). If the time slot allocation method of the scheme is not adopted, but a method that the nodes seize the service is adopted, time slot resources are bound to conflict when more than 1 node sends the service. The advantage of the time slot allocation method in the present scheme is that if at least two nodes have service data transmission requirements in the time slot to be allocated, the possibility of successful occupation of the time slot to be allocated still exists.
According to the technical scheme of the embodiment, the number of the time slots to be preempted of each node is determined according to the traffic data and the time slot data transmission quantity of each node by acquiring the traffic data and the time slot association data of each node, so that the preemption probability data of each node for the time slots to be allocated is determined according to the number of the time slots to be preempted and the number of the time slots to be allocated of each node, a random sampling data range matched with the preemption probability data is further acquired, and the time slot preemption action of each node is triggered according to the random sampling result of the random sampling data range. Because the traffic data can represent the traffic of the nodes, the probability data of the nodes for occupying the time slots to be allocated are determined according to the traffic data and the time slot association data to be allocated, and the association between the traffic of the nodes and the probability data can be established, so that the probability data of the nodes can be adjusted based on the traffic of the nodes. And triggering the time slot preemption action of each node according to the random sampling result of the random sampling data range matched with the preemption probability data, establishing the association between the traffic volume of each node and the time slot preemption action of each node through the preemption probability data, and realizing the regulation of the time slot preemption action based on the traffic volume of the nodes, thereby reducing the probability of data transmission conflict and the generation of idle time slots caused by random access time slots, solving the problems of high data transmission conflict rate and time slot resource waste caused by unreasonable time slot allocation in the prior art, effectively reducing data transmission conflict, improving the utilization rate of the time slot resources and avoiding the waste of the time slot resources.
It should be noted that any permutation and combination between the technical features in the above embodiments also belong to the scope of the present invention.
EXAMPLE III
Fig. 5 is a schematic diagram of a timeslot allocating apparatus according to a third embodiment of the present invention, and as shown in fig. 5, the timeslot allocating apparatus includes: a data acquisition module 310, a data determination module 320, and an action trigger module 330, wherein:
a data obtaining module 310, configured to obtain traffic data of each node and data associated with a time slot to be allocated;
a data determining module 320, configured to determine, according to the traffic data and the data related to the time slot to be allocated, probability data of preemption of the time slot to be allocated by each node;
and the action triggering module 330 is configured to acquire a random sampling data range matched with the preemption probability data, and trigger a time slot preemption action of each node according to a random sampling result of the random sampling data range.
According to the technical scheme of the embodiment, the traffic data and the time slot associated data to be allocated of each node are obtained, and then the probability data to be preempted of the time slot to be allocated of each node is determined according to the traffic data and the time slot associated data to be allocated, so that a random sampling data range matched with the probability data is obtained, and the time slot preemption action of each node is triggered according to the random sampling result of the random sampling data range. Because the traffic data can represent the traffic of the nodes, the probability data of the nodes for occupying the time slots to be allocated are determined according to the traffic data and the time slot association data to be allocated, and the association between the traffic of the nodes and the probability data can be established, so that the probability data of the nodes can be adjusted based on the traffic of the nodes. And triggering the time slot preemption action of each node according to the random sampling result of the random sampling data range matched with the preemption probability data, establishing the association between the traffic volume of each node and the time slot preemption action of each node through the preemption probability data, and realizing the regulation of the time slot preemption action based on the traffic volume of the nodes, thereby reducing the probability of data transmission conflict and the generation of idle time slots caused by random access time slots, solving the problems of high data transmission conflict rate and time slot resource waste caused by unreasonable time slot allocation in the prior art, effectively reducing data transmission conflict, improving the utilization rate of the time slot resources and avoiding the waste of the time slot resources.
Optionally, the data obtaining module 310 is specifically configured to determine a statistical period of the time slot to be allocated; taking the number of the time slots to be allocated in one statistical period and the time slot data transmission quantity of a single time slot to be allocated as the time slot related data to be allocated; and counting the traffic data of each node at the beginning of the period of the counting period.
Optionally, the data determining module 320 is specifically configured to determine, according to the traffic data of each node and the transmission quantity of the timeslot data, the number of timeslots to be preempted of each node; and determining the preemption probability data of the time slots to be allocated of each node according to the number of the time slots to be preempted of each node and the number of the time slots to be allocated.
Optionally, the data determining module 320 is specifically configured to obtain at least one standard transmission probability level range and standard transmission probability data matched with the standard transmission probability level range; determining the sending probability grade data of each node according to the number of the time slots to be preempted of each node and the ratio of the number of the time slots to be allocated; and determining the transmission probability data corresponding to each node according to the standard transmission probability level range in which the transmission probability level data of each node falls, wherein the transmission probability data are used as the preemption probability data of each node on the time slot to be allocated.
Optionally, the time slot allocating apparatus further includes a data adjusting module, configured to obtain a traffic volume evaluation threshold of the node, and calculate a traffic volume average of traffic volume data of each node; when the average value of the traffic is determined to be larger than or equal to the traffic evaluation threshold value, adjusting standard transmission probability data matched with each standard transmission probability grade range according to a first proportion; and when the average traffic volume is determined to be smaller than the traffic volume evaluation threshold, the standard transmission probability data matched with each standard transmission probability grade range is adjusted up according to a second proportion.
Optionally, the action triggering module 330 is specifically configured to configure, according to the preemption probability data of each node, a random sampling data range matched with the preemption probability data of each node; determining a time slot preemption sampling data range corresponding to each node according to the random sampling data range and preemption probability data of each node; and randomly sampling the nodes, determining random sampling results respectively corresponding to the nodes, and triggering the time slot preemption action of the nodes with the random sampling results falling into the matched time slot preemption sampling data range.
Optionally, the time slot allocating apparatus further includes an evaluating module, configured to determine, according to the preemption probability data of each node, an access success probability of each node and an idle probability of a time slot to be allocated; calculating the time slot conflict probability according to the access success probability and the idle probability of the time slot to be allocated; and taking the access success probability, the idle probability of the time slot to be allocated and the time slot conflict probability as evaluation statistical data of the time slot to be allocated.
The time slot allocation device can execute the time slot allocation method provided by any embodiment of the invention, and has corresponding functional modules and beneficial effects of the execution method. For details of the technique not described in detail in this embodiment, reference may be made to the timeslot allocation method provided in any embodiment of the present invention.
Since the timeslot allocation apparatus described above is an apparatus capable of executing the timeslot allocation method in the embodiment of the present invention, based on the timeslot allocation method described in the embodiment of the present invention, a person skilled in the art can understand a specific implementation manner of the timeslot allocation apparatus in the embodiment of the present invention and various variations thereof, and therefore, how to implement the timeslot allocation method in the embodiment of the present invention by the timeslot allocation apparatus is not described in detail herein. The scope of the present application is intended to cover any apparatus used by those skilled in the art to implement the timeslot allocation method in the embodiments of the present invention.
Example four
Fig. 6 is a schematic structural diagram of an electronic device according to a fourth embodiment of the present invention. FIG. 6 illustrates a block diagram of an electronic device 412 that is suitable for use in implementing embodiments of the present invention. The electronic device 412 shown in fig. 6 is only an example and should not bring any limitations to the functionality and scope of use of the embodiments of the present invention.
As shown in fig. 6, the electronic device 412 is in the form of a general purpose computing device. The components of the electronic device 412 may include, but are not limited to: one or more processors 416, a storage device 428, and a bus 418 that couples the various system components including the storage device 428 and the processors 416.
The electronic device 412 may also communicate with one or more external devices 414 (e.g., keyboard, pointing device, camera, display 424, etc.), with one or more devices that enable a user to interact with the electronic device 412, and/or with any devices (e.g., network card, modem, etc.) that enable the electronic device 412 to communicate with one or more other computing devices. Such communication may occur via I/O interface 422. Also, the electronic device 412 may communicate with one or more networks (e.g., a Local Area Network (LAN), Wide Area Network (WAN), and/or a public Network, such as the internet) via the Network adapter 420. As shown, network adapter 420 communicates with the other modules of electronic device 412 over bus 418. It should be appreciated that although not shown in the figures, other hardware and/or software modules may be used in conjunction with the electronic device 412, including but not limited to: microcode, device drivers, Redundant processing units, external disk drive Arrays, disk array (RAID) systems, tape drives, and data backup storage systems, to name a few.
The processor 416 executes various functional applications and data processing by running programs stored in the storage device 428, for example, implementing the timeslot allocation method provided by the above-mentioned embodiment of the present invention, including: acquiring traffic data of each node and time slot association data to be allocated; determining the probability data of seizing the time slot to be allocated by each node according to the traffic data and the time slot association data to be allocated; and acquiring a random sampling data range matched with the preemptive probability data, and triggering the time slot preemptive action of each node according to the random sampling result of the random sampling data range.
According to the technical scheme of the embodiment, the traffic data and the time slot associated data to be allocated of each node are obtained, and then the probability data to be preempted of the time slot to be allocated of each node is determined according to the traffic data and the time slot associated data to be allocated, so that a random sampling data range matched with the probability data is obtained, and the time slot preemption action of each node is triggered according to the random sampling result of the random sampling data range. Because the traffic data can represent the traffic of the nodes, the probability data of the nodes for occupying the time slots to be allocated are determined according to the traffic data and the time slot association data to be allocated, and the association between the traffic of the nodes and the probability data can be established, so that the probability data of the nodes can be adjusted based on the traffic of the nodes. And triggering the time slot preemption action of each node according to the random sampling result of the random sampling data range matched with the preemption probability data, establishing the association between the traffic volume of each node and the time slot preemption action of each node through the preemption probability data, and realizing the regulation of the time slot preemption action based on the traffic volume of the nodes, thereby reducing the probability of data transmission conflict and the generation of idle time slots caused by random access time slots, solving the problems of high data transmission conflict rate and time slot resource waste caused by unreasonable time slot allocation in the prior art, effectively reducing data transmission conflict, improving the utilization rate of the time slot resources and avoiding the waste of the time slot resources.
EXAMPLE five
An embodiment of the present invention further provides a computer storage medium storing a computer program, where the computer program is used to execute the timeslot allocation method according to any one of the above embodiments of the present invention when executed by a computer processor, and the method includes: acquiring traffic data of each node and time slot association data to be allocated; determining the probability data of seizing the time slot to be allocated by each node according to the traffic data and the time slot associated data to be allocated; and acquiring a random sampling data range matched with the preemptive probability data, and triggering the time slot preemptive action of each node according to the random sampling result of the random sampling data range.
Computer storage media for embodiments of the invention may employ any combination of one or more computer-readable media. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a Read-Only Memory (ROM), an Erasable Programmable Read-Only Memory (EPROM) or flash Memory), an optical fiber, a portable compact disc Read-Only Memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, Radio Frequency (RF), etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
It is to be noted that the foregoing description is only exemplary of the invention and that the principles of the technology may be employed. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, although the present invention has been described in greater detail by the above embodiments, the present invention is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present invention, and the scope of the present invention is determined by the scope of the appended claims.
Claims (10)
1. A method for allocating time slots, comprising:
acquiring traffic data of each node and time slot association data to be allocated;
determining the probability data of the nodes to seize the time slots to be allocated according to the service volume data and the time slot association data to be allocated;
and acquiring a random sampling data range matched with the preemption probability data, and triggering the time slot preemption action of each node according to the random sampling result of the random sampling data range.
2. The method of claim 1, wherein the obtaining traffic data of each node and data associated with a timeslot to be allocated comprises:
determining a statistical period of the time slot to be allocated;
taking the number of the time slots to be allocated in one statistical period and the time slot data transmission quantity of a single time slot to be allocated as the time slot associated data to be allocated;
and counting the traffic data of each node at the beginning of the period of the counting period.
3. The method according to claim 2, wherein the determining, according to the traffic data and the data associated with the timeslots to be allocated, the preemption probability data for the timeslots to be allocated by each node comprises:
determining the number of time slots to be preempted of each node according to the traffic data of each node and the transmission quantity of the time slot data;
and determining the preemption probability data of the time slots to be allocated of each node according to the number of the time slots to be preempted of each node and the number of the time slots to be allocated.
4. The method according to claim 3, wherein said determining preemption probability data for each node for a timeslot to be allocated based on the number of timeslots to be preempted and the number of timeslots to be allocated for each node comprises:
acquiring at least one standard transmission probability grade range and standard transmission probability data matched with the standard transmission probability grade range; determining the sending probability grade data of each node according to the number of the time slots to be preempted of each node and the ratio of the number of the time slots to be allocated;
and determining the transmission probability data corresponding to each node according to the standard transmission probability level range in which the transmission probability level data of each node falls, wherein the transmission probability data are used as the preemption probability data of each node on the time slot to be allocated.
5. The method according to claim 4, wherein before said determining the transmission probability level data of each node based on the ratio of the number of timeslots to be preempted and the number of timeslots to be allocated of each node, further comprising:
acquiring a traffic evaluation threshold of a node, and calculating a traffic mean value of traffic data of each node;
when the average value of the traffic is determined to be larger than or equal to the traffic evaluation threshold value, adjusting standard transmission probability data matched with each standard transmission probability grade range according to a first proportion;
and when the average traffic volume is determined to be smaller than the traffic volume evaluation threshold, the standard transmission probability data matched with each standard transmission probability grade range is adjusted up according to a second proportion.
6. The method according to claim 1, wherein the triggering a slot preemption action for each node according to the random sampling result of the random sampling data range comprises:
according to the preemption probability data of each node, configuring a random sampling data range matched with the preemption probability data of each node;
determining a time slot preemption sampling data range corresponding to each node according to the random sampling data range and preemption probability data of each node;
and randomly sampling the nodes, determining random sampling results respectively corresponding to the nodes, and triggering the time slot preemption action of the nodes with the random sampling results falling into the matched time slot preemption sampling data range.
7. The method according to claim 1, after determining the preemption probability data of each node for the timeslot to be allocated according to the traffic data and the timeslot-to-be-allocated association data, further comprising:
determining the access success probability of each node and the idle probability of the time slot to be allocated according to the preemption probability data of each node;
calculating the time slot conflict probability according to the access success probability and the idle probability of the time slot to be allocated;
and taking the access success probability, the idle probability of the time slot to be allocated and the time slot conflict probability as evaluation statistical data of the time slot to be allocated.
8. A time slot allocation apparatus, comprising:
the data acquisition module is used for acquiring the traffic data of each node and the time slot association data to be allocated;
a data determining module, configured to determine, according to the traffic data and the to-be-allocated timeslot association data, preemption probability data of the to-be-allocated timeslots of each node;
and the action triggering module is used for acquiring a random sampling data range matched with the preemption probability data and triggering the time slot preemption action of each node according to the random sampling result of the random sampling data range.
9. An electronic device, characterized in that the electronic device comprises:
one or more processors;
storage means for storing one or more programs;
when executed by the one or more processors, cause the one or more processors to implement the slot allocation method of any one of claims 1-7.
10. A computer storage medium on which a computer program is stored, which program, when being executed by a processor, is adapted to carry out the time slot allocation method according to any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210145196.8A CN114501673A (en) | 2022-02-17 | 2022-02-17 | Time slot allocation method, time slot allocation device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210145196.8A CN114501673A (en) | 2022-02-17 | 2022-02-17 | Time slot allocation method, time slot allocation device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114501673A true CN114501673A (en) | 2022-05-13 |
Family
ID=81481687
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210145196.8A Pending CN114501673A (en) | 2022-02-17 | 2022-02-17 | Time slot allocation method, time slot allocation device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114501673A (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5822311A (en) * | 1996-03-05 | 1998-10-13 | Ericsson Inc. | Random access scheme for mobile satellite communications |
| CN1500360A (en) * | 2001-03-30 | 2004-05-26 | ���ȿ���ͨ�Źɷ�����˾ | Method for assessing characteristics of network for mobile telecom appts. |
| US20140092817A1 (en) * | 2012-09-28 | 2014-04-03 | Motorola Solutions, Inc. | Real time traffic adaptive data channel bandwidth control among agency access groups |
| CN107787044A (en) * | 2016-08-29 | 2018-03-09 | 北京钧威科技有限公司 | The implementation method and device of a kind of dynamic time slot allocation |
| CN108024367A (en) * | 2017-12-01 | 2018-05-11 | 上海金卓网络科技有限公司 | A kind of method, apparatus, equipment and the storage medium of dynamically distributes time slot |
| CN109548168A (en) * | 2018-12-19 | 2019-03-29 | 北航（四川）西部国际创新港科技有限公司 | Adaptive hierarchical multiple access method and its system in highly dynamic radio network |
| WO2021228010A1 (en) * | 2020-05-15 | 2021-11-18 | 华为技术有限公司 | Data transmission method and communication apparatus |
-
2022
- 2022-02-17 CN CN202210145196.8A patent/CN114501673A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5822311A (en) * | 1996-03-05 | 1998-10-13 | Ericsson Inc. | Random access scheme for mobile satellite communications |
| CN1500360A (en) * | 2001-03-30 | 2004-05-26 | ���ȿ���ͨ�Źɷ�����˾ | Method for assessing characteristics of network for mobile telecom appts. |
| US20140092817A1 (en) * | 2012-09-28 | 2014-04-03 | Motorola Solutions, Inc. | Real time traffic adaptive data channel bandwidth control among agency access groups |
| CN107787044A (en) * | 2016-08-29 | 2018-03-09 | 北京钧威科技有限公司 | The implementation method and device of a kind of dynamic time slot allocation |
| CN108024367A (en) * | 2017-12-01 | 2018-05-11 | 上海金卓网络科技有限公司 | A kind of method, apparatus, equipment and the storage medium of dynamically distributes time slot |
| CN109548168A (en) * | 2018-12-19 | 2019-03-29 | 北航（四川）西部国际创新港科技有限公司 | Adaptive hierarchical multiple access method and its system in highly dynamic radio network |
| WO2021228010A1 (en) * | 2020-05-15 | 2021-11-18 | 华为技术有限公司 | Data transmission method and communication apparatus |
Non-Patent Citations (4)
| Title |
|---|
| CCL/ITRI: "R1-99b03 "MAC Procedures for CPCH"", 3GPP TSG_RAN\\WG1_RL1, no. 1, 25 August 1999 (1999-08-25) * |
| QUALCOMM EUROPE: "R1-080809 "Collision/Blocking Probability Analysis of AICH/E-AICH E-DCH Resource Allocation scheme"", 3GPP TSG_RAN\\WG1_RL1, no. 1, 6 February 2008 (2008-02-06) * |
| ZTE, SANECHIPS: "R1-1903880 "Analysis on the collision probability of msgA"", 3GPP TSG_RAN\\WG1_RL1, no. 1, 30 March 2019 (2019-03-30) * |
| 夏白桦;李洪业;: "数据链时隙争抢占用方式的冲突分析", 舰船电子工程, no. 06, 20 June 2010 (2010-06-20), pages 72 - 75 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10891177B2 (en) | Message management method and device, and storage medium | |
| CN110248417B (en) | Resource allocation method and system for communication service in power Internet of things | |
| CN112996116B (en) | Resource allocation method and system for guaranteeing quality of power time delay sensitive service | |
| US7373467B2 (en) | Storage device flow control | |
| CN110048882B (en) | Method and device for resource allocation based on edge calculation | |
| CN108184270B (en) | Resource scheduling method and system based on TDMA system | |
| US20210044984A1 (en) | Spectrum management device, system and method, and computer-readable storage medium | |
| CN114040504A (en) | TDMA satellite communication system frame structure and resource allocation method | |
| CN111511028A (en) | Multi-user resource allocation method, device, system and storage medium | |
| US20210409963A1 (en) | Spectrum device, wireless communication system, wireless communication method and storage medium | |
| CN111586867B (en) | Resource allocation method and device of SCMA (sparse code multiple access) system | |
| CN113727316A (en) | Radio frequency scheduling method and device for coexistence of Wi-Fi and Bluetooth | |
| CN113068267A (en) | Dynamic allocation method and device for communication satellite channel bandwidth resources | |
| CN114501673A (en) | Time slot allocation method, time slot allocation device, electronic equipment and storage medium | |
| CN111278039B (en) | User perception suppression identification method, device, equipment and medium | |
| CN113316230B (en) | Method and device for scheduling data sending task, electronic equipment and storage medium | |
| CN114786276B (en) | Service terminal access method and device, electronic equipment and storage medium | |
| CN111315023A (en) | Uplink wireless resource allocation method and device | |
| CN117858262B (en) | Base station resource scheduling optimization method, device, base station, equipment, medium and product | |
| CN115834712B (en) | Gateway resource scheduling method for connection-oriented service | |
| CN113891392B (en) | Congestion control method, device, equipment and storage medium | |
| US6697855B1 (en) | Adaptive hybrid method for access to a transmission channel | |
| CN116723586B (en) | Channel access method, device, electronic equipment and storage medium | |
| US20240129792A1 (en) | Method for determining contention window, access point and station | |
| CN111526596B (en) | Joint resource scheduling method and device for WLAN (Wireless local area network) and mobile network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |