WO2022114737A1 - Procédé et appareil de commande de retransmission de paquets - Google Patents

Procédé et appareil de commande de retransmission de paquets Download PDF

Info

Publication number
WO2022114737A1
WO2022114737A1 PCT/KR2021/017299 KR2021017299W WO2022114737A1 WO 2022114737 A1 WO2022114737 A1 WO 2022114737A1 KR 2021017299 W KR2021017299 W KR 2021017299W WO 2022114737 A1 WO2022114737 A1 WO 2022114737A1
Authority
WO
WIPO (PCT)
Prior art keywords
backlogged
terminals
packet
backlogged terminals
time
Prior art date
Application number
PCT/KR2021/017299
Other languages
English (en)
Korean (ko)
Inventor
후진
서준배
Original Assignee
한양대학교 에리카산학협력단
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Priority claimed from KR1020210160629A external-priority patent/KR102675807B1/ko
Application filed by 한양대학교 에리카산학협력단 filed Critical 한양대학교 에리카산학협력단
Publication of WO2022114737A1 publication Critical patent/WO2022114737A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA

Definitions

  • the present embodiments relate to a method and apparatus for controlling packet retransmission.
  • the Pure ALOHA method is a multiple access control protocol in which devices on a network do not synchronize with each other and do not receive a communication channel before transmitting a packet. Therefore, transmission failure may occur due to packet transmission collision while each device transmits a packet through the same channel.
  • devices retransmit a packet if the device simply retransmits a packet randomly between 1 second and 3 seconds, the greater the number of devices that want to transmit a packet to the network, that is, the backlog size, the more severe network congestion. Problems may arise that may lead to
  • the present embodiments provide a method and apparatus for controlling packet retransmission that adaptively adjusts a backoff time for packet transmission by estimating a network load.
  • the present embodiments provide a method for an access point (AP) to control packet retransmission of a terminal, a bag for transmitting a packet based on an idle period in which a packet is not received every specific time
  • AP access point
  • a packet comprising: a receiving step of receiving at least one of the backoff parameters calculated based on the number of terminals; and a packet transmission step of setting a backoff time based on the backoff parameter, and transmitting the packet based on the backoff time
  • a retransmission method may be provided.
  • the backlogged terminal to which the packet is to be transmitted is performed.
  • a control unit for estimating the number and calculating a backoff parameter that maximizes throughput based on the estimated number of backlogged terminals, and at least one of the number of backlogged terminals and backoff parameters to the backlogged terminal It is possible to provide an access point including a transmitter for transmitting.
  • FIG. 1 is a diagram illustrating an overall configuration of a wireless network to which the present embodiment can be applied.
  • FIG. 2 is a diagram for explaining an operation in which an access point controls packet retransmission of a terminal according to the present embodiment.
  • 3 is a diagram for explaining an operation in which the terminal performs packet retransmission according to the present embodiment.
  • FIG. 4 is a diagram for explaining the configuration of an access point according to the present embodiment.
  • 5 is a diagram for explaining an operation of estimating the number of backlogged terminals according to the present embodiment.
  • FIG. 6 is a diagram for explaining an algorithm for estimating the number of backlogged terminals according to the present embodiment.
  • FIG. 7 is a diagram for explaining the performance according to the present embodiment.
  • temporal precedence relationship such as “after”, “after”, “after”, “before”, etc.
  • a flow precedence relationship when a flow precedence relationship is described, it may include a case where it is not continuous unless “immediately” or "directly” is used.
  • FIG. 1 is a diagram illustrating an overall configuration of a wireless network to which the present embodiment can be applied.
  • an access point (AP) 110 may exist in a wireless network using the Pure ALOHA protocol.
  • the access point 110 may be connected to a plurality of terminals.
  • each of the terminals 120 , 130 , 140 , and 150 may transmit a packet to the access point 110 .
  • a collision may occur as a frame of a packet transmitted from one terminal overlaps a frame of a packet transmitted from another terminal.
  • the packet may be retransmitted using a delayed first transmission (DFT) method.
  • DFT delayed first transmission
  • a backlogged terminal that is, a terminal having a packet to be retransmitted, may attempt packet retransmission at random backoff time intervals upon recognizing a collision or transmission failure.
  • each terminal 120 , 130 , 140 , 150 receives a backoff parameter transmitted by the access point 110 , and receives a backoff parameter from an exponential distribution function averaging the inverse of the backoff parameter. Off time can be set.
  • the exponential distribution can be used to represent a continuous probability distribution over the waiting time until an event occurs, that is, the probability distribution over the elapsed time between an event and an event.
  • the backoff parameter transmitted by the access point 110 to the terminal may be updated at a specific point in time according to time. In particular, it may be updated based on the state of a channel through which communication occurs between the terminal and the access point 110 and the estimated number of backlogged terminals.
  • the access point 110 calculates a backoff parameter for transmitting the number of backlogged terminals to the terminal based on the estimation, so that the access point 110 controls packet retransmission of the terminal. The details will be described later with reference to FIGS. 2 to 7 .
  • FIG. 2 is a diagram for explaining an operation in which an access point controls packet retransmission of a terminal according to the present embodiment.
  • a terminal number estimation step of estimating the number of backlogged terminals to which a packet is to be transmitted may include (S210).
  • the access point that controls packet retransmission of the terminal may estimate the number of backlogged terminals that want to transmit a packet based on an idle period in which packets are not received at specific time points.
  • the specific time point may be a time point at which a success or collision period ends in a section including one idle period and a success or collision period for packet transmission occurring after the idle period.
  • an access point that controls packet retransmission of a terminal is one period from when a channel through which communication with the terminal enters an idle period until a specific terminal succeeds in packet transmission or a collision between terminals occurs. It can be set as a section of
  • a time point at which one section ends may be defined as an epoch. That is, the access point may set a time point for success in packet transmission or an end point of a collision period generated in each section as time elapses as a specific point in time, and may estimate the number of backlogged terminals at each specific point in time.
  • the access point controlling packet retransmission of the terminal may estimate the average number of backlogged terminals according to the idle period using Bayesian estimation.
  • the access point may estimate the number of backlogged terminals based on the estimated average number of backlogged terminals.
  • an access point that controls packet retransmission of a terminal may perform Bayesian estimation by assuming a Poisson distribution having an average ⁇ of the number of backlogged terminals as a prior distribution.
  • the access point may estimate the average number of backlogged terminals by calculating a conditional probability distribution in which the number of backlogged terminals is m when the idle period during which no packets are received is t.
  • the access point may estimate and update the number of backlogged terminals at each specific point in time using the estimated average number of backlogged terminals.
  • the estimated number of backlogged terminals ( ⁇ ) may be distinguished from the number (m) of backlogged terminals in the actual system.
  • the access point that controls packet retransmission of the terminal may backlog based on the number of new backlogged terminals and the average number of backlogged terminals at a specific time according to the success or collision of packet transmission.
  • the number of de terminals can be estimated. If the packet transmission is successful, the access point can estimate the number of backlogged terminals by adding the number of new backlogged terminals to the average number of backlogged terminals and excluding one terminal that successfully transmits the packet. .
  • the access point may estimate the number of backlogged terminals by adding a value obtained by multiplying the number of new backlogged terminals by the current collision period to the average number of backlogged terminals. Details of a method for estimating the number of backlogged terminals will be described later with reference to FIGS. 5 and 6 .
  • the method in which the access point controls packet retransmission of the terminal may include a parameter calculating step of calculating a backoff parameter transmitted to the terminal (S210).
  • the access point controlling packet retransmission of the terminal may calculate a backoff parameter that maximizes throughput based on the estimated number of backlogged terminals.
  • the access point may calculate a value obtained by multiplying the number of backlogged terminals estimated at a specific time by N and taking the inverse number as the backoff parameter.
  • N may be a real number of 0 or more.
  • the access point may calculate a value obtained by multiplying the estimated number of backlogged terminals at a specific point in time and taking the inverse number as the backoff parameter.
  • 2 is an example of a real number greater than or equal to 0, and is not limited thereto.
  • the method in which the access point controls packet retransmission of the terminal may include a transmission step of transmitting a backoff parameter to the backlogged terminal (S220).
  • the access point may transmit at least one of the number of backlogged terminals and a backoff parameter to the backlogged terminal.
  • the transmitted backoff parameter may be used to set a backoff time corresponding to an interval at which the terminal retransmits a packet in real time.
  • 3 is a diagram for explaining an operation in which the terminal performs packet retransmission according to the present embodiment.
  • the method for the terminal to perform packet retransmission may include a receiving step of receiving at least one of the number of backlogged terminals and a backoff parameter ( S310 ).
  • the terminal performing packet retransmission is the number of backlogged terminals estimated based on the idle period in which packets are not received at specific time points and the number of backlogged terminals calculated based on the number of backlogged terminals.
  • At least one of the off parameters may be received.
  • the specific time point may be a time point at which a success or collision period ends in a section including one idle period and a success or collision period for packet transmission occurring after the idle period.
  • the terminal performing packet retransmission may receive the estimated number of backlogged terminals for each successive packet transmission or the end of a collision period occurring in each section over time.
  • the number of received backlogged terminals is to be estimated based on the estimated average number of backlogged terminals by estimating the average number of backlogged terminals according to the idle period using Bayesian estimation.
  • the number of backlogged terminals may be estimated based on the number of new backlogged terminals and the average number of backlogged terminals at each specific point in time according to the success or collision of packet transmission.
  • the terminal performing packet retransmission may receive the calculated backoff parameter at each end time point.
  • the received backoff parameter may be calculated as a value obtained by multiplying the number of backlogged terminals estimated at each specific time by N and taking the reciprocal number.
  • the method for the terminal to perform packet retransmission may include a packet transmission step of transmitting a packet based on a backoff time (S320).
  • the terminal performing packet retransmission may set a backoff time based on the received backoff parameter and transmit the packet based on the set backoff time.
  • the terminal performing packet retransmission may set the backoff time from an exponential distribution function averaging the inverse of the received backoff parameter.
  • the terminal performing packet retransmission may maximize the throughput by retransmitting the packet at an interval corresponding to the backoff time set in real time.
  • FIG. 4 is a diagram for explaining the configuration of an access point according to the present embodiment.
  • the access point 110 for controlling packet retransmission of the terminal is backlogged to transmit packets based on an idle period in which packets are not received at specific time points.
  • the control unit 410 for estimating the number of terminals and calculating a backoff parameter that maximizes throughput based on the estimated number of backlogged terminals, and at least one of the number of backlogged terminals and a backoff parameter may include a transmission unit 420 for transmitting to the backlogged terminal.
  • the controller 410 may estimate the number of backlogged terminals to which packets are to be transmitted. For example, the controller 410 may estimate the number of backlogged terminals to which packets are to be transmitted based on an idle period in which packets are not received at specific time points. Specifically, the control unit 410 estimates the number of backlogged terminals every time the success or collision period ends in a section including one idle period and a success or collision period for packet transmission occurring after the idle period. can
  • the controller 410 estimates the average number of backlogged terminals according to the idle period using Bayesian estimation, and calculates the number of backlogged terminals based on the estimated average number of backlogged terminals.
  • the control unit 410 may estimate the number of backlogged terminals based on the number of new backlogged terminals and the average number of backlogged terminals at a specific time according to the success or collision of packet transmission.
  • the controller 410 may calculate a backoff parameter that maximizes the throughput based on the estimated number of backlogged terminals. Specifically, the controller 410 may calculate a value obtained by multiplying the number of backlogged terminals estimated at a specific point in time by N and taking the inverse number as the backoff parameter.
  • N may be a real number of 0 or more.
  • the transmitter 420 may transmit at least one of the number of backlogged terminals and a backoff parameter to the backlogged terminal.
  • the transmitter 420 may transmit at least one of the number of backlogged terminals and a backoff parameter to the backlogged terminal.
  • the transmitted backoff parameter may be used to set a backoff time corresponding to an interval at which the terminal retransmits a packet in real time.
  • the controller 410 calculates the backoff parameter based on the operation of estimating the number of backlogged terminals and the number of backlogged terminals based on the idle period required to perform the above-described present disclosure. It is possible to control the overall operation of the access point 110 according to the operation control.
  • the transmitter 420 may be used to transmit a signal, message, or data necessary for carrying out the above-described present disclosure.
  • the access point (AP) may be a base station, and the terminal may be a device or a user to transmit a packet.
  • the access point (AP) is not limited thereto as long as a random access method may be applied and a device capable of wireless communication.
  • an access point In a wireless communication system, an access point (AP) is located at the center of a cell, and time may be divided into slots corresponding to one packet transmission. Packets transmitted by each terminal to the access point may be randomly received. Accordingly, the backlog size, which is the number of active users of the system, may change over time due to the random reception of packets from the terminal. Specific details will be described later with reference to FIGS. 5 to 6 . However, in the present specification, it is assumed that the access point can provide feedback information.
  • the feedback information may be information about the start and end of a success period, an idle period, and a collision period provided at the end of each slot.
  • 5 is a diagram for explaining an operation of estimating the number of backlogged terminals according to the present embodiment.
  • a control method for calculating a backoff parameter for maximizing throughput based on the number of backlogged terminals in the slotless ALOHA system may be described.
  • This may be referred to as an online adaptive backoff algorithm.
  • a plurality of terminals may be randomly scattered under the service area of one access point (AP).
  • Each terminal can hold only one packet by generating a packet according to a Poisson process with an average speed ⁇ .
  • the length of the packet may be constant.
  • a terminal having a packet to transmit may be referred to as a backlogged terminal.
  • the backlogged UE may first generate a random variable according to an exponential distribution with an average of 1/ ⁇ (sec).
  • ⁇ i may be a random variable drawn by device i. That is, if the terminal fails (re)transmission at time t, the terminal may transmit a packet to the access point (AP) at time t+ ⁇ i .
  • the backlogged terminal may select a random variable from a uniform distribution for the [0, U] interval.
  • TDD time division duplexing
  • the access point (AP) receives the received packet and then transmits it through the downlink.
  • TDD time division duplexing
  • the UE may generate a new random variable by repeating exponential random backoff (ERB) or uniform random backoff (URB) until random access succeeds.
  • the throughput and random access (RA) delay distribution in the slotless ALOHA system can be described.
  • 5 may be a timing diagram of a slotless ALOHA system.
  • t' k and t k for t k ⁇ R may be start and end time epochs of events such as success or collision, respectively.
  • I and C may be the lengths of idle and collision periods, respectively.
  • X tk may be the number of backlogged terminals at time epoch t k . As time goes by, the number of backlogged terminals X tk may be changed as in Equation 1.
  • II(S) may be set to 1 if transmission is successful, and may be set to 0 otherwise. may be a new backlogged terminal newly joined during t k -t k-1 .
  • an approximation model may be generated with a generalized M/M/1 queue system having a population size of N.
  • the packet arrival rate (average input rate) to the system can be expressed as Equation (2).
  • the first condition may be that previous transmissions do not overlap with tagged packet transmissions.
  • the probability density function (PDF) of the first packet transmission time has an average of 1 / (i ⁇ ), that is, i ⁇ e -i ⁇ t .
  • the first condition can occur with e -i ⁇ probability.
  • the second condition may be that i-1 backlogged terminals do not (re)transmit during the transmission time of the first packet.
  • the retransmissions may occur with probability e -(i-1) ⁇ .
  • the steady-state probability of having i backlogged terminals may be ⁇ i .
  • the balance equation in each state can be expressed as Equation (4).
  • ⁇ o can be expressed as in Equation (6).
  • Equation (7) the system throughput ⁇ can be expressed as in Equation (7).
  • LST Laplace-Stieltjes transform
  • Equation (10) Since exponential random backoff (ERB) is repeated with a 1- ps probability whenever random access fails, the LST of the random access delay distribution can be expressed as Equation (10).
  • Equation 11 can be obtained by connecting Equation 8 and Equation 10.
  • Equation 12 a cumulative distribution function (CDF) of the random access delay distribution can be calculated as Equation 12.
  • the random access delay in the k-th retransmission epoch may be the sum of the continuous random variables k extracted from the [0, U] interval.
  • the LST of the uniform random variable for the interval [0, U] can be expressed as in Equation 13.
  • the cumulative distribution function of the random access delay distribution can be calculated.
  • the CDF and PDF for the sum of n independent and Identically Distributed i.i.d.
  • CDF and PDF can be expressed as Equations 14 and 15, respectively.
  • Equation 16 s i (t)
  • each of X and Y may be a continuous uniform random variable in a unit interval and a [0, U] interval.
  • the CDF for the sum of Y can be obtained by linearly transforming one random variable into another random variable. That is, it may be Pr[Y ⁇ y] Pr[UX ⁇ y] Pr[X ⁇ y/U]. Therefore, the CDF and PDF of the random access delay distribution can be expressed as Equations 17 and 18, respectively, when applied to the URB.
  • Equation 17 Equation 17
  • Equation 9 where P s is ⁇ 2/U may be used.
  • the operating region is divided into unsaturated stable, bistable, and saturated regions, and the unsaturated stable region may be an ideal operating region.
  • the operation region may be divided by the new packet arrival rate ⁇ , the retransmission rate ⁇ , and the number N of terminals.
  • Catastrophe theory can be used to characterize the domain of motion. For example, when F is a potential function of a system, F: R k ⁇ R n ⁇ R, and each of k and n may be a control variable and a system state variable.
  • Nx may be the number of backlogged terminals.
  • F(x) holds as Equation 19 for x ⁇ [0, 1].
  • F(x) 0 ⁇ .
  • ⁇ B is a fold line composed of points and may be a fold line on the manifold surface. ⁇ B is can be defined as
  • ⁇ B can be characterized in three parts as in Equation 20, Equation 21 and Equation 21
  • the branch point sets ⁇ + and ⁇ - can be obtained by projecting the three-dimensional manifold (tangent) ⁇ + and ⁇ - into the control space ( ⁇ , ⁇ ), respectively.
  • the potential function can be expressed as in Equation 23.
  • E[S] is the average runoff rate and can be expressed as in Equation 24.
  • E[A] in Equation 23 can be expressed as Equation 25.
  • Equation 23 may be expressed as Equation 26.
  • Equation 27 ⁇ in Equations 20 and 21 can be expressed as Equation 27.
  • Equation 28 ⁇ in Equations 20 and 21 is must be satisfied, so it can be expressed as in Equation 28.
  • Equation 27 can be obtained.
  • Equation 29 when x ⁇ is a normalized state corresponding to ⁇ + and ⁇ in Equations 20 and 21, respectively, x ⁇ can be expressed as in Equation 29.
  • G ⁇ can be expressed as in Equation 30.
  • Equation 27 By substituting Equation 27 into Equation 26, Equation 31 can be obtained.
  • G ⁇ may be a real number for ⁇ > 2/N.
  • Equation 22 can be expressed as Equation 32 as a vertex.
  • Equation 33 can be obtained.
  • x 1/( ⁇ N).
  • Equation 35 xN is a value that changes with time and may be X tk .
  • Equation 36 the higher-order derivative of F(x) for k ⁇ 3 can be expressed as in Equation 36.
  • FIG. 6 is a diagram for explaining an algorithm for estimating the number of backlogged terminals according to the present embodiment.
  • the backoff parameter ( ⁇ ) is a value calculated based on the number of backlogged terminals (i) and may mean a backoff speed.
  • the backlogged terminal that has not yet reserved retransmission or needs to reschedule is the average of 1 just transmitted
  • an idle period may begin at the end of a success or conflict period.
  • the time at which the access point AP transmits the backoff parameter ⁇ may be a success or a time point at which the collision period ends.
  • the time point at which the success or collision period ends may be a time point corresponding to t k-1 , t k or t k+1 of FIG. 5 .
  • the idle period may end at the beginning of the success or conflict period.
  • the time point at which the idle period ends may be a time point corresponding to t' k-1 , t' k or t' k+1 of FIG. 5 .
  • the idle period may be the period from the end of the previous success or conflict period to the beginning of the current success or conflict period. That is, the idle period may be calculated from the third row of the algorithm disclosed in FIG.
  • the first retransmission time epoch performed by i backlogged terminals may be the minimum value of the i exponential random variable.
  • the idle period I can be expressed as in Equation 37.
  • the complementary conditional cumulative distribution function (CDF) of the idle period I can be expressed as Equation 38.
  • PDF probability density function
  • Equation 40 E[X
  • I t]
  • f I (t) may be an unconditional probability density function.
  • the number of backlogged terminals is a Poisson process with an average ⁇ .
  • the number of backlogged terminals can be expressed as in Equation 41.
  • the probability that the idle period is t can be expressed as Equation 42.
  • Equation 43 f I (t) in Equation 40 can be expressed as Equation 43.
  • Equation 44 can be obtained.
  • Equation 45 can be finally obtained from Equations 43 and 44.
  • the average number of backlogged terminals ⁇ decreases exponentially.
  • the number 1 added to Equation 45 may mean that there is one or more backlogged terminals when the idle period ends.
  • the number of backlogged terminals may be estimated from rows 6 and 8 of the algorithm disclosed in FIG. 6 . That is, the number of backlogged terminals can be estimated according to whether the packet transmission succeeds or collides. Specifically, as for the number of backlogged terminals, if the packet transmission is successful, 1 may be subtracted from Equation 45 to exclude one successful transmission terminal. And, it can be added to Equation 45 by multiplying the number of new backlogged terminals by the packet transmission time. Here, the packet transmission time may be 1 by normalization. On the other hand, if packet transmission is a collision, 1 may be added without subtracting 1 from Equation 45, assuming the number of new backlogged terminals proportional to the length of the current collision period C.
  • the access point (AP) may calculate a backoff parameter based on the estimated number of backlogged terminals and transmit the calculated backoff parameters to the backlogged terminals.
  • the transmission time may be a specific time point corresponding to t k of FIG. 5 as a time point at which a success or collision period ends.
  • FIG. 7 is a diagram for explaining the performance according to the present embodiment.
  • the method for controlling packet retransmission according to the present embodiment is very close to the average of the EBI algorithm in the average of the random access delay.
  • the EBI can be controlled using the size information X tk of the backlogged terminal. That is, the EBI can control packet retransmission by setting the backoff interval to 1/(2X tk ).
  • the PF has a characteristic that it does not consider the estimation of new packet arrival and does not consider one successfully transmitted packet even in case of success.
  • BEB is suitable for a low traffic load corresponding to N ⁇ ⁇ 0.18, but has the lowest characteristic in terms of delay violation. Therefore, when the method for controlling packet retransmission, the PF-based algorithm, and the EBI algorithm according to the present embodiment are used, a sharp increase in D may not appear as the traffic load increases. That is, it can be expected that the bistable can be eliminated as the system transitions from the unsaturated stable state to the saturated state.
  • the method for controlling packet retransmission according to the present embodiment can estimate the number of backlogged terminals based on the time-dependent arrival rate.
  • the arrival of new packets may vary over time.
  • the packet arrival rate ⁇ for each terminal increases by 0.0005 every 10 4 seconds, and the traffic load may be 0.05.
  • the packet arrival rate ⁇ reaches 0.003, it may decrease by 0.0005 every 10 4 seconds again.
  • the solid line may indicate the actual number of backlogged terminals
  • the dotted line may indicate the estimated actual number of backlogged terminals.
  • the access point estimates the number of backlogged terminals to which packets are to be transmitted and calculates a backoff parameter that maximizes throughput, thereby adaptively adjusting the backoff time for packet retransmission.
  • a method and apparatus for controlling retransmission can be provided.
  • the above-described embodiments may be implemented through various means.
  • the present embodiments may be implemented by hardware, firmware, software, or a combination thereof.
  • the method according to the present embodiments may include one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), FPGAs (Field Programmable Gate Arrays), may be implemented by a processor, a controller, a microcontroller or a microprocessor.
  • ASICs Application Specific Integrated Circuits
  • DSPs Digital Signal Processors
  • DSPDs Digital Signal Processing Devices
  • PLDs Programmable Logic Devices
  • FPGAs Field Programmable Gate Arrays
  • the method according to the present embodiments may be implemented in the form of an apparatus, procedure, or function that performs the functions or operations described above.
  • the software code may be stored in the memory unit and driven by the processor.
  • the memory unit may be located inside or outside the processor, and may transmit/receive data to and from the processor by various well-known means.
  • terms such as “system”, “processor”, “controller”, “component”, “module”, “interface”, “model”, or “unit” generally refer to computer-related entities hardware, hardware and software. may mean a combination of, software, or running software.
  • the aforementioned component may be, but is not limited to, a process run by a processor, a processor, a controller, a controlling processor, an object, a thread of execution, a program, and/or a computer.
  • an application running on a controller or processor and a controller or processor can be a component.
  • One or more components may reside within a process and/or thread of execution, and the components may be located on one device (eg, a system, computing device, etc.) or distributed across two or more devices.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Selon les présents modes de réalisation, l'invention peut concerner un procédé et un appareil de commande de retransmission de paquets. En particulier, l'invention peut concerner un procédé et un appareil de commande de retransmission de paquets, qui ajustent de manière adaptative un temps de réduction de puissance pour une transmission de paquets en estimant une charge de réseau. Spécifiquement, l'invention peut concerner un procédé et un appareil de commande de retransmission de paquets, qui ajustent de manière adaptative un temps de réduction de puissance pour une retransmission de paquets en calculant un paramètre de réduction de puissance qui maximise le débit en estimant le nombre de terminaux en retard auxquels un point d'accès a l'intention de transmettre des paquets.
PCT/KR2021/017299 2020-11-24 2021-11-23 Procédé et appareil de commande de retransmission de paquets WO2022114737A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
KR20200158649 2020-11-24
KR10-2020-0158649 2020-11-24
KR1020210160629A KR102675807B1 (ko) 2020-11-24 2021-11-19 패킷 재전송을 제어하는 방법 및 그 장치
KR10-2021-0160629 2021-11-19

Publications (1)

Publication Number Publication Date
WO2022114737A1 true WO2022114737A1 (fr) 2022-06-02

Family

ID=81756229

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2021/017299 WO2022114737A1 (fr) 2020-11-24 2021-11-23 Procédé et appareil de commande de retransmission de paquets

Country Status (1)

Country Link
WO (1) WO2022114737A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20020079725A (ko) * 1999-09-01 2002-10-19 모토로라 인코포레이티드 경쟁-기반 예약을 갖는 다중 억세스 프로토콜들에서대역폭 할당을 위한 방법 및 디바이스
KR20080043159A (ko) * 2006-11-13 2008-05-16 고려대학교 산학협력단 랜덤 액세스의 백오프 방법 및 무선 이동 통신 시스템
WO2011140302A1 (fr) * 2010-05-05 2011-11-10 Qualcomm Incorporated Détection de collision et adaptation de fenêtre de réduction de puissance pour transmission mimo multi-utilisateur
US20160150569A1 (en) * 2001-07-05 2016-05-26 At&T Intellectual Property Ii, Lp. Hybrid coordination function (hcf) access through tiered contention and overlapped wireless cell mitigation

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20020079725A (ko) * 1999-09-01 2002-10-19 모토로라 인코포레이티드 경쟁-기반 예약을 갖는 다중 억세스 프로토콜들에서대역폭 할당을 위한 방법 및 디바이스
US20160150569A1 (en) * 2001-07-05 2016-05-26 At&T Intellectual Property Ii, Lp. Hybrid coordination function (hcf) access through tiered contention and overlapped wireless cell mitigation
KR20080043159A (ko) * 2006-11-13 2008-05-16 고려대학교 산학협력단 랜덤 액세스의 백오프 방법 및 무선 이동 통신 시스템
WO2011140302A1 (fr) * 2010-05-05 2011-11-10 Qualcomm Incorporated Détection de collision et adaptation de fenêtre de réduction de puissance pour transmission mimo multi-utilisateur

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
KIM JAYEONG; JIN HU; SEO JUN-BAE; KIM SEONG HWAN; SUNG DAN KEUN: "Adaptive Transmission Control for Uplink/Downlink Fairness in Unsaturated CSMA Networks", IEEE COMMUNICATIONS LETTERS, vol. 23, no. 10, 1 October 2019 (2019-10-01), US , pages 1879 - 1882, XP011749414, ISSN: 1089-7798, DOI: 10.1109/LCOMM.2019.2927910 *

Similar Documents

Publication Publication Date Title
WO2018023938A1 (fr) Procédé de transmission de liaison montante et station de base
WO2019245285A1 (fr) Procédé et appareil pour réaliser une réduction de puissance d'accès aléatoire dans un système de communication sans fil
EP0615365A1 (fr) Procédé d'accès à un médium de communication
WO2018080113A2 (fr) Dispositif et procédé de planification dans un réseau iot industriel basé sur tsch et rpl
WO2011136586A2 (fr) Procédé de transmission de signal de liaison montante utilisant des identifiants à base de conflit d'accès
WO2016175521A1 (fr) Appareil et procédé de commande de débit de liaison descendante dans un système de communication
WO2015020372A1 (fr) Procédé de communication de point d'accès (ap) et terminal de retransmission de paquet multidestinataire sur la base d'une rétroaction dans un réseau
WO2010117197A2 (fr) Appareil et procédé de commande de synchronisation de cycle de sommeil de mode de sommeil dans un système de communication sans fil
WO2011093663A2 (fr) Procédé et appareil pour la transmission de rafale de données en liaison montante dans un système de connexion sans fil
EP2454912A2 (fr) Procédé et appareil d'actualisation de fonctionnement en mode sommeil
WO2011053053A2 (fr) Procédé de communication
EP4169287A1 (fr) Appareil et procédé de demande d'informations de délai d'écoulement de trafic et alignement de décalage de trafic
WO2015002371A1 (fr) Procédé de communication pour un point d'accès et terminal pour la retransmission d'un paquet de diffusion groupée dans un réseau comprenant un point d'accès et une pluralité de terminaux
WO2021141296A1 (fr) Procédé et dispositif permettant de délivrer des informations de synchronisation de mise en réseau sensible au temps dans un système de communication mobile
WO2021230464A1 (fr) Procédé et appareil d'attribution asynchrone de ressources dans un système informatique périphérique mobile
WO2013036068A1 (fr) Procédé pour fournir un service m2m, et procédé et appareil pour une communication m2m
WO2014157979A1 (fr) Procédé de transmission sur un canal partagé en liaison montante physique et équipement utilisateur
WO2022114737A1 (fr) Procédé et appareil de commande de retransmission de paquets
WO2015056920A1 (fr) Procédé et système pour sélectionner une configuration drx optimale
WO2020145666A1 (fr) Procédé et dispositif pour déterminer une id de session de couche physique de liaison latérale dans un système de communication sans fil
WO2016159701A1 (fr) Procédé et appareil pour émettre et recevoir des données entre un terminal et une station de base dans un système de communication mobile
WO2022131760A1 (fr) Ajustement adaptatif pour configuration de temps d'éveil de cible (twt)
WO2011019152A9 (fr) Procédé de planification et appareil dans un système de communication de relais
WO2022149862A1 (fr) Appareil et procédé de réglage d'intervalle pour temps de réveil cible wi-fi
WO2021101252A1 (fr) Serveur de commande d'un élément de réseau dans un système de communication et son procédé de fonctionnement

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21898563

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21898563

Country of ref document: EP

Kind code of ref document: A1